/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.line1425.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 14:41:50,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 14:41:50,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 14:41:50,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 14:41:50,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 14:41:50,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 14:41:50,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 14:41:50,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 14:41:50,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 14:41:50,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 14:41:50,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 14:41:50,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 14:41:50,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 14:41:50,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 14:41:50,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 14:41:50,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 14:41:50,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 14:41:50,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 14:41:50,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 14:41:50,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 14:41:50,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 14:41:50,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 14:41:50,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 14:41:50,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 14:41:50,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 14:41:50,487 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 14:41:50,487 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 14:41:50,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 14:41:50,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 14:41:50,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 14:41:50,489 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 14:41:50,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 14:41:50,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 14:41:50,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 14:41:50,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 14:41:50,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 14:41:50,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 14:41:50,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 14:41:50,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 14:41:50,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 14:41:50,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 14:41:50,496 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:41:50,519 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 14:41:50,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 14:41:50,519 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 14:41:50,520 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 14:41:50,520 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 14:41:50,520 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 14:41:50,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 14:41:50,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 14:41:50,521 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 14:41:50,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 14:41:50,522 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 14:41:50,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 14:41:50,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 14:41:50,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 14:41:50,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 14:41:50,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 14:41:50,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 14:41:50,522 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 14:41:50,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 14:41:50,523 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 14:41:50,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 14:41:50,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 14:41:50,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 14:41:50,524 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 14:41:50,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 14:41:50,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:41:50,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 14:41:50,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 14:41:50,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 14:41:50,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 14:41:50,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 14:41:50,525 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 14:41:50,525 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 14:41:50,525 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 14:41:50,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 14:41:50,525 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 14:41:50,525 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 14:41:50,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 14:41:50,525 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:41:50,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 14:41:50,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 14:41:50,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 14:41:50,736 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 14:41:50,736 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 14:41:50,737 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.line1425.bpl [2022-10-03 14:41:50,738 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1425.bpl' [2022-10-03 14:41:50,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 14:41:50,796 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 14:41:50,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 14:41:50,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 14:41:50,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 14:41:50,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1425.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:41:50" (1/1) ... [2022-10-03 14:41:50,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1425.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:41:50" (1/1) ... [2022-10-03 14:41:50,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1425.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:41:50" (1/1) ... [2022-10-03 14:41:50,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1425.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:41:50" (1/1) ... [2022-10-03 14:41:50,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1425.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:41:50" (1/1) ... [2022-10-03 14:41:50,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1425.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:41:50" (1/1) ... [2022-10-03 14:41:50,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1425.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:41:50" (1/1) ... [2022-10-03 14:41:50,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 14:41:50,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 14:41:50,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 14:41:50,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 14:41:50,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line1425.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:41:50" (1/1) ... [2022-10-03 14:41:50,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:41:50,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:41:50,961 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:41:51,003 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:41:51,018 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 14:41:51,018 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 14:41:51,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 14:41:51,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 14:41:51,020 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:41:51,225 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 14:41:51,226 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 14:41:52,135 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 14:41:52,149 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 14:41:52,150 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 14:41:52,152 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1425.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:41:52 BoogieIcfgContainer [2022-10-03 14:41:52,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 14:41:52,154 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 14:41:52,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 14:41:52,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 14:41:52,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1425.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:41:50" (1/2) ... [2022-10-03 14:41:52,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5ca117 and model type divinefifo-bug_1w1r.line1425.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:41:52, skipping insertion in model container [2022-10-03 14:41:52,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1425.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:41:52" (2/2) ... [2022-10-03 14:41:52,162 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line1425.bpl [2022-10-03 14:41:52,169 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 14:41:52,178 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 14:41:52,178 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 14:41:52,178 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 14:41:52,283 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 14:41:52,336 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 14:41:52,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 14:41:52,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:41:52,338 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:41:52,338 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:41:52,362 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 14:41:52,368 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 14:41:52,373 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;@6aaefe5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 14:41:52,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 14:41:52,687 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:41:52,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:41:52,692 INFO L85 PathProgramCache]: Analyzing trace with hash -43253743, now seen corresponding path program 1 times [2022-10-03 14:41:52,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:41:52,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011636039] [2022-10-03 14:41:52,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:41:52,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:41:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:41:53,165 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:41:53,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:41:53,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011636039] [2022-10-03 14:41:53,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011636039] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:41:53,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:41:53,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 14:41:53,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403068784] [2022-10-03 14:41:53,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:41:53,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 14:41:53,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:41:53,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 14:41:53,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 14:41:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:41:53,195 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:41:53,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 303.0) internal successors, (606), 2 states have internal predecessors, (606), 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:41:53,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:41:53,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:41:53,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 14:41:53,352 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:41:53,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:41:53,354 INFO L85 PathProgramCache]: Analyzing trace with hash 210874805, now seen corresponding path program 1 times [2022-10-03 14:41:53,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:41:53,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508947289] [2022-10-03 14:41:53,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:41:53,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:41:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:41:54,241 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:41:54,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:41:54,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508947289] [2022-10-03 14:41:54,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508947289] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:41:54,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:41:54,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-10-03 14:41:54,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166693480] [2022-10-03 14:41:54,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:41:54,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-03 14:41:54,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:41:54,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-03 14:41:54,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-10-03 14:41:54,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:41:54,248 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:41:54,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 42.0) internal successors, (672), 17 states have internal predecessors, (672), 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:41:54,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:41:54,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:41:56,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:41:56,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:41:56,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 14:41:56,148 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:41:56,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:41:56,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1926879085, now seen corresponding path program 1 times [2022-10-03 14:41:56,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:41:56,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074662665] [2022-10-03 14:41:56,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:41:56,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:41:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:41:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-03 14:41:56,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:41:56,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074662665] [2022-10-03 14:41:56,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074662665] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:41:56,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122317665] [2022-10-03 14:41:56,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:41:56,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:41:56,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:41:56,746 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:41:56,786 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:41:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:41:57,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 2530 conjuncts, 301 conjunts are in the unsatisfiable core [2022-10-03 14:41:57,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:41:57,347 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:41:57,735 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:41:58,381 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 14:41:58,382 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:41:58,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-10-03 14:42:01,676 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:42:02,043 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:42:03,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-03 14:42:03,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:42:03,746 INFO L356 Elim1Store]: treesize reduction 80, result has 17.5 percent of original size [2022-10-03 14:42:03,746 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 37 [2022-10-03 14:42:05,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:42:05,092 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 39 treesize of output 30 [2022-10-03 14:42:05,404 INFO L356 Elim1Store]: treesize reduction 36, result has 37.9 percent of original size [2022-10-03 14:42:05,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2022-10-03 14:42:07,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:42:07,474 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 33 treesize of output 26 [2022-10-03 14:42:08,704 INFO L356 Elim1Store]: treesize reduction 64, result has 38.5 percent of original size [2022-10-03 14:42:08,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 54 [2022-10-03 14:42:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 126 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:42:10,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:42:43,013 INFO L356 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-10-03 14:42:43,013 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 80 treesize of output 60 [2022-10-03 14:42:54,272 INFO L356 Elim1Store]: treesize reduction 34, result has 59.0 percent of original size [2022-10-03 14:42:54,273 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 196 treesize of output 184 [2022-10-03 14:42:54,287 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:42:54,287 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 237 treesize of output 243 [2022-10-03 14:42:54,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:42:54,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 78 [2022-10-03 14:42:54,384 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-10-03 14:42:54,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:42:54,400 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:42:54,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:42:54,425 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:42:54,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 80 treesize of output 96 [2022-10-03 14:42:56,501 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:42:56,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 89 [2022-10-03 14:42:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 100 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:42:56,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122317665] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 14:42:56,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 14:42:56,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 101, 99] total 211 [2022-10-03 14:42:56,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569962528] [2022-10-03 14:42:56,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 14:42:56,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 211 states [2022-10-03 14:42:56,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:42:56,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 211 interpolants. [2022-10-03 14:42:56,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1391, Invalid=42807, Unknown=112, NotChecked=0, Total=44310 [2022-10-03 14:42:56,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:56,832 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:42:56,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 211 states, 211 states have (on average 13.492890995260664) internal successors, (2847), 211 states have internal predecessors, (2847), 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:42:56,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:42:56,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:42:56,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:15,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:15,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:43:15,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-10-03 14:43:15,439 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:43:15,618 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:43:15,618 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:43:15,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:43:15,619 INFO L85 PathProgramCache]: Analyzing trace with hash -523100149, now seen corresponding path program 1 times [2022-10-03 14:43:15,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:43:15,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737403850] [2022-10-03 14:43:15,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:43:15,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:43:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:43:15,947 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:15,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:43:15,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737403850] [2022-10-03 14:43:15,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737403850] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:43:15,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:43:15,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-03 14:43:15,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351176828] [2022-10-03 14:43:15,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:43:15,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-03 14:43:15,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:43:15,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-03 14:43:15,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-10-03 14:43:15,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:15,950 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:43:15,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 65.0) internal successors, (715), 12 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:15,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:15,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:43:15,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2022-10-03 14:43:15,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:23,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:43:23,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-03 14:43:23,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-10-03 14:43:23,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-03 14:43:23,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-03 14:43:23,382 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:43:23,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:43:23,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1637855523, now seen corresponding path program 1 times [2022-10-03 14:43:23,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:43:23,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718794331] [2022-10-03 14:43:23,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:43:23,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:43:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:43:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5462 backedges. 0 proven. 3069 refuted. 0 times theorem prover too weak. 2393 trivial. 0 not checked. [2022-10-03 14:43:26,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:43:26,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718794331] [2022-10-03 14:43:26,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718794331] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:43:26,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462877124] [2022-10-03 14:43:26,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:43:26,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:43:26,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:43:26,106 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:43:26,107 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:43:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:43:27,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 7624 conjuncts, 355 conjunts are in the unsatisfiable core [2022-10-03 14:43:27,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:43:44,639 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:44,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-03 14:43:46,098 INFO L356 Elim1Store]: treesize reduction 104, result has 14.0 percent of original size [2022-10-03 14:43:46,098 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 51 [2022-10-03 14:43:46,121 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-10-03 14:43:46,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 34 [2022-10-03 14:43:49,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-10-03 14:43:50,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:43:50,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:43:50,149 INFO L356 Elim1Store]: treesize reduction 54, result has 33.3 percent of original size [2022-10-03 14:43:50,149 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2022-10-03 14:43:51,716 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 14:43:51,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2022-10-03 14:43:52,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:43:52,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:43:52,797 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-10-03 14:43:53,038 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:43:53,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:43:53,951 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 34 treesize of output 27 [2022-10-03 14:43:54,134 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-10-03 14:43:54,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2022-10-03 14:43:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5462 backedges. 2246 proven. 2829 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2022-10-03 14:43:55,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:43:58,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-10-03 14:43:59,030 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_852) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) is different from false [2022-10-03 14:43:59,043 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_852) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-10-03 14:43:59,049 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_852) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) is different from false [2022-10-03 14:43:59,068 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_852) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-10-03 14:43:59,072 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) v_ArrVal_852) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4)) (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))) is different from false [2022-10-03 14:43:59,149 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|) v_ArrVal_852) |c_ULTIMATE.start_fifo_pop_~self#1.base|))) (= (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_fifo_pop_~self#1.offset| 4))))) is different from false [2022-10-03 14:44:00,576 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse4 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_850)))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 (select .cse1 .cse2))) (let ((.cse3 (select (store .cse4 .cse0 v_ArrVal_852) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse3 .cse2)))))))) is different from false [2022-10-03 14:44:00,599 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse4 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| v_ArrVal_850)))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (not (= .cse0 (select .cse1 .cse2))) (let ((.cse3 (select (store .cse4 .cse0 v_ArrVal_852) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse3 .cse2)))))))) is different from false [2022-10-03 14:44:00,616 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_~self#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| v_ArrVal_850)))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (<= |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| |c_ULTIMATE.start_fifo_drop_head_~self#1.offset|)) (not (= (select .cse0 .cse1) .cse2)) (let ((.cse3 (select (store .cse4 .cse2 v_ArrVal_852) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse3 .cse1)))))))) is different from false [2022-10-03 14:44:00,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_drop_head_#in~self#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| v_ArrVal_850)))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (let ((.cse0 (select (store .cse2 .cse3 v_ArrVal_852) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (< |c_ULTIMATE.start_fifo_drop_head_#in~self#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48|) (not (= .cse3 (select .cse4 .cse1)))))))) is different from false [2022-10-03 14:44:00,822 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_~self#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| v_ArrVal_850)))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 (select .cse1 .cse2))) (< |c_ULTIMATE.start_fifo_front_~self#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48|) (let ((.cse3 (select (store .cse4 .cse0 v_ArrVal_852) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) is different from false [2022-10-03 14:44:02,111 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_#in~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_front_#in~self#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| v_ArrVal_850)))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|))) (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 (select .cse1 .cse2))) (let ((.cse3 (select (store .cse4 .cse0 v_ArrVal_852) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse3 .cse2))) (< |c_ULTIMATE.start_fifo_front_#in~self#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48|)))))) is different from false [2022-10-03 14:44:02,133 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| v_ArrVal_850))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse3 (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48|) (let ((.cse0 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#q~1#1.base| .cse2) .cse3 v_ArrVal_852) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (not (= (select .cse2 .cse1) .cse3)))))) is different from false [2022-10-03 14:44:04,123 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_848 Int)) (not (let ((.cse0 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_write~$Pointer$_#value#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_848)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse1))))) (forall ((v_ArrVal_850 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse4 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_write~$Pointer$_#value#1.base|)))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| v_ArrVal_850))) (let ((.cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (let ((.cse2 (select (store (store .cse4 |c_ULTIMATE.start_main_~#q~1#1.base| .cse5) .cse6 v_ArrVal_852) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse2 .cse3) (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (not (= (select .cse5 .cse3) .cse6)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48|))))))) is different from false [2022-10-03 14:44:04,168 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_848 Int)) (not (let ((.cse0 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_848)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse1))))) (forall ((v_ArrVal_850 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse4 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem41#1.base|)))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| v_ArrVal_850))) (let ((.cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48|) (let ((.cse2 (select (store (store .cse4 |c_ULTIMATE.start_main_~#q~1#1.base| .cse5) .cse6 v_ArrVal_852) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse2 .cse3) (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (not (= (select .cse5 .cse3) .cse6)))))))) is different from false [2022-10-03 14:44:04,196 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_850 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse2 (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_fifo_pop_#t~mem41#1.base|)))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| v_ArrVal_850))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (let ((.cse0 (select (store (store .cse2 |c_ULTIMATE.start_main_~#q~1#1.base| .cse3) .cse4 v_ArrVal_852) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (not (= (select .cse3 .cse1) .cse4)) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48|)))))) (forall ((v_ArrVal_848 Int)) (not (let ((.cse6 (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_fifo_pop_#t~mem41#1.base|)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= .cse5 (select (select .cse6 .cse5) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_848)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))))) is different from false [2022-10-03 14:44:04,235 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_848 Int)) (not (let ((.cse1 (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|)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_848)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))) (forall ((v_ArrVal_850 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse4 (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|)))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| v_ArrVal_850))) (let ((.cse3 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48|) (let ((.cse2 (select (store (store .cse4 |c_ULTIMATE.start_main_~#q~1#1.base| .cse5) .cse6 v_ArrVal_852) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse2 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse2 .cse3))) (not (= (select .cse5 .cse3) .cse6)))))))) is different from false [2022-10-03 14:44:04,252 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_850 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse4 (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|))))) (let ((.cse1 (store (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| v_ArrVal_850))) (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48|) (not (= .cse0 (select .cse1 .cse2))) (let ((.cse3 (select (store (store .cse4 |c_ULTIMATE.start_main_~#q~1#1.base| .cse1) .cse0 v_ArrVal_852) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse3 .cse2)))))))) (forall ((v_ArrVal_848 Int)) (not (let ((.cse6 (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|))))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= .cse5 (select (select .cse6 .cse5) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_848)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))))) is different from false [2022-10-03 14:44:04,301 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_848 Int)) (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (store .cse2 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select .cse2 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|)))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_848)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))) (forall ((v_ArrVal_850 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (store .cse8 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| (select .cse8 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|)))))) (let ((.cse4 (store (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| v_ArrVal_850))) (let ((.cse5 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48|) (not (= .cse3 (select .cse4 .cse5))) (let ((.cse6 (select (store (store .cse7 |c_ULTIMATE.start_main_~#q~1#1.base| .cse4) .cse3 v_ArrVal_852) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse6 .cse5))))))))) is different from false [2022-10-03 14:44:04,335 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_848 Int)) (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (store .cse2 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select .cse2 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|)))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| v_ArrVal_848)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))))))) (forall ((v_ArrVal_850 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (store .cse8 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| (select .cse8 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|)))))) (let ((.cse4 (store (select .cse7 |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| v_ArrVal_850))) (let ((.cse5 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48|) (not (= .cse3 (select .cse4 .cse5))) (let ((.cse6 (select (store (store .cse7 |c_ULTIMATE.start_main_~#q~1#1.base| .cse4) .cse3 v_ArrVal_852) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse6 .cse5) (select .cse6 |c_ULTIMATE.start_main_~#q~1#1.offset|))))))))) is different from false [2022-10-03 14:44:04,349 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_850 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse5)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store .cse6 .cse7 (select .cse6 .cse7))))))) (let ((.cse1 (store (select .cse4 |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| v_ArrVal_850))) (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= .cse0 (select .cse1 .cse2))) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48|) (let ((.cse3 (select (store (store .cse4 |c_ULTIMATE.start_main_~#q~1#1.base| .cse1) .cse0 v_ArrVal_852) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse3 .cse2) (select .cse3 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))))) (forall ((v_ArrVal_848 Int)) (not (let ((.cse11 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse10 (let ((.cse12 (select |c_#memory_$Pointer$.base| .cse10))) (store .cse12 .cse11 (select .cse12 .cse11)))))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= (select (select .cse8 .cse9) (select (select (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 v_ArrVal_848)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse9))))))) is different from false [2022-10-03 14:44:04,396 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_848 Int)) (not (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse2))) (store .cse4 .cse3 (select .cse4 .cse3)))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 v_ArrVal_848)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)))))))) (forall ((v_ArrVal_850 Int) (|v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse9 (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store |c_#memory_$Pointer$.base| .cse10 (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse10)) (.cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (store .cse11 .cse12 (select .cse11 .cse12))))))) (let ((.cse5 (store (select .cse9 |c_ULTIMATE.start_main_~#q~1#1.base|) |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48| v_ArrVal_850))) (let ((.cse6 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (.cse7 (select .cse5 |c_ULTIMATE.start_main_~#q~1#1.offset|))) (or (not (= (select .cse5 .cse6) .cse7)) (let ((.cse8 (select (store (store .cse9 |c_ULTIMATE.start_main_~#q~1#1.base| .cse5) .cse7 v_ArrVal_852) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse8 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse8 .cse6))) (< |c_ULTIMATE.start_main_~#q~1#1.offset| |v_ULTIMATE.start_write~$Pointer$_#ptr#1.offset_48|))))))) is different from false [2022-10-03 14:45:16,580 WARN L233 SmtUtils]: Spent 1.18m on a formula simplification. DAG size of input: 1151 DAG size of output: 526 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-10-03 14:45:16,582 INFO L356 Elim1Store]: treesize reduction 11967, result has 23.1 percent of original size [2022-10-03 14:45:16,584 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-10-03 14:45:16,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-03 14:45:16,795 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:45:16,796 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| input size 1058 context size 1058 output size 1058 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) 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) [2022-10-03 14:45:16,798 INFO L158 Benchmark]: Toolchain (without parser) took 206002.25ms. Allocated memory was 210.8MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 164.3MB in the beginning and 1.1GB in the end (delta: -914.2MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-10-03 14:45:16,798 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 210.8MB. Free memory was 170.4MB in the beginning and 170.3MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 14:45:16,798 INFO L158 Benchmark]: Boogie Preprocessor took 118.97ms. Allocated memory is still 210.8MB. Free memory was 164.1MB in the beginning and 157.6MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-03 14:45:16,798 INFO L158 Benchmark]: RCFGBuilder took 1236.16ms. Allocated memory was 210.8MB in the beginning and 347.1MB in the end (delta: 136.3MB). Free memory was 157.5MB in the beginning and 314.6MB in the end (delta: -157.2MB). Peak memory consumption was 47.6MB. Max. memory is 8.0GB. [2022-10-03 14:45:16,799 INFO L158 Benchmark]: TraceAbstraction took 204643.38ms. Allocated memory was 347.1MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 314.1MB in the beginning and 1.1GB in the end (delta: -764.3MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-10-03 14:45:16,800 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15ms. Allocated memory is still 210.8MB. Free memory was 170.4MB in the beginning and 170.3MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 118.97ms. Allocated memory is still 210.8MB. Free memory was 164.1MB in the beginning and 157.6MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1236.16ms. Allocated memory was 210.8MB in the beginning and 347.1MB in the end (delta: 136.3MB). Free memory was 157.5MB in the beginning and 314.6MB in the end (delta: -157.2MB). Peak memory consumption was 47.6MB. Max. memory is 8.0GB. * TraceAbstraction took 204643.38ms. Allocated memory was 347.1MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 314.1MB in the beginning and 1.1GB in the end (delta: -764.3MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| input size 1058 context size 1058 output size 1058 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| input size 1058 context size 1058 output size 1058: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-10-03 14:45:16,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2022-10-03 14:45:17,205 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-10-03 14:45:17,221 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 137 Received shutdown request...