/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.line1522.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 14:45:19,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 14:45:19,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 14:45:19,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 14:45:19,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 14:45:19,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 14:45:19,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 14:45:19,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 14:45:19,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 14:45:19,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 14:45:19,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 14:45:19,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 14:45:19,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 14:45:19,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 14:45:19,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 14:45:19,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 14:45:19,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 14:45:19,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 14:45:19,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 14:45:19,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 14:45:19,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 14:45:19,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 14:45:19,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 14:45:19,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 14:45:19,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 14:45:19,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 14:45:19,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 14:45:19,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 14:45:19,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 14:45:19,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 14:45:19,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 14:45:19,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 14:45:19,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 14:45:19,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 14:45:19,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 14:45:19,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 14:45:19,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 14:45:19,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 14:45:19,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 14:45:19,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 14:45:19,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 14:45:19,661 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:45:19,686 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 14:45:19,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 14:45:19,687 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 14:45:19,687 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 14:45:19,687 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 14:45:19,688 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 14:45:19,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 14:45:19,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 14:45:19,688 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 14:45:19,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 14:45:19,689 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 14:45:19,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 14:45:19,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 14:45:19,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 14:45:19,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 14:45:19,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 14:45:19,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 14:45:19,689 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 14:45:19,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 14:45:19,689 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 14:45:19,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 14:45:19,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 14:45:19,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 14:45:19,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 14:45:19,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 14:45:19,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:45:19,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 14:45:19,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 14:45:19,690 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 14:45:19,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 14:45:19,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 14:45:19,690 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 14:45:19,691 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 14:45:19,691 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 14:45:19,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 14:45:19,691 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 14:45:19,691 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 14:45:19,691 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 14:45:19,691 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:45:19,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 14:45:19,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 14:45:19,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 14:45:19,914 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 14:45:19,915 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 14:45:19,916 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.line1522.bpl [2022-10-03 14:45:19,916 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1522.bpl' [2022-10-03 14:45:19,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 14:45:19,985 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 14:45:19,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 14:45:19,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 14:45:19,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 14:45:19,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1522.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:45:19" (1/1) ... [2022-10-03 14:45:19,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1522.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:45:19" (1/1) ... [2022-10-03 14:45:20,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1522.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:45:19" (1/1) ... [2022-10-03 14:45:20,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1522.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:45:19" (1/1) ... [2022-10-03 14:45:20,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1522.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:45:19" (1/1) ... [2022-10-03 14:45:20,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1522.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:45:19" (1/1) ... [2022-10-03 14:45:20,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1522.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:45:19" (1/1) ... [2022-10-03 14:45:20,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 14:45:20,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 14:45:20,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 14:45:20,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 14:45:20,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line1522.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:45:19" (1/1) ... [2022-10-03 14:45:20,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 14:45:20,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:45:20,158 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:45:20,171 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:45:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 14:45:20,225 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 14:45:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 14:45:20,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 14:45:20,227 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:45:20,389 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 14:45:20,390 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 14:45:21,254 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 14:45:21,276 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 14:45:21,276 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 14:45:21,279 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1522.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:45:21 BoogieIcfgContainer [2022-10-03 14:45:21,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 14:45:21,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 14:45:21,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 14:45:21,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 14:45:21,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1522.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 02:45:19" (1/2) ... [2022-10-03 14:45:21,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10af8f35 and model type divinefifo-bug_1w1r.line1522.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:45:21, skipping insertion in model container [2022-10-03 14:45:21,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1522.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:45:21" (2/2) ... [2022-10-03 14:45:21,289 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line1522.bpl [2022-10-03 14:45:21,295 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 14:45:21,303 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 14:45:21,303 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 14:45:21,303 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 14:45:21,413 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 14:45:21,475 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 14:45:21,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 14:45:21,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:45:21,477 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:45:21,478 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:45:21,503 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 14:45:21,512 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 14:45:21,519 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;@2b500d7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 14:45:21,519 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 14:45:21,918 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:45:21,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:45:21,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1776336605, now seen corresponding path program 1 times [2022-10-03 14:45:21,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:45:21,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691627062] [2022-10-03 14:45:21,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:45:21,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:45:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:45:22,410 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:45:22,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:45:22,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691627062] [2022-10-03 14:45:22,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691627062] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:45:22,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:45:22,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 14:45:22,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423406817] [2022-10-03 14:45:22,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:45:22,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 14:45:22,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:45:22,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 14:45:22,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 14:45:22,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:45:22,444 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:45:22,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 338.0) internal successors, (676), 2 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:45:22,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:45:22,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:45:22,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 14:45:22,650 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:45:22,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:45:22,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1811830990, now seen corresponding path program 1 times [2022-10-03 14:45:22,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:45:22,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364981748] [2022-10-03 14:45:22,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:45:22,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:45:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:45:26,203 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:45:26,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:45:26,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364981748] [2022-10-03 14:45:26,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364981748] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:45:26,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:45:26,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-10-03 14:45:26,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420760457] [2022-10-03 14:45:26,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:45:26,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-10-03 14:45:26,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:45:26,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-10-03 14:45:26,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=4340, Unknown=0, NotChecked=0, Total=4556 [2022-10-03 14:45:26,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:45:26,208 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:45:26,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 10.897058823529411) internal successors, (741), 68 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:45:26,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:45:26,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:45:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:45:45,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-10-03 14:45:45,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 14:45:45,356 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:45:45,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:45:45,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2055179962, now seen corresponding path program 1 times [2022-10-03 14:45:45,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:45:45,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836024813] [2022-10-03 14:45:45,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:45:45,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:45:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:45:47,583 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:45:47,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:45:47,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836024813] [2022-10-03 14:45:47,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836024813] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:45:47,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:45:47,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-10-03 14:45:47,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040223061] [2022-10-03 14:45:47,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:45:47,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-10-03 14:45:47,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:45:47,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-10-03 14:45:47,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3592, Unknown=0, NotChecked=0, Total=3782 [2022-10-03 14:45:47,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:45:47,589 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:45:47,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 12.64516129032258) internal successors, (784), 62 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-03 14:45:47,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:45:47,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2022-10-03 14:45:47,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:46:01,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:46:01,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-10-03 14:46:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-10-03 14:46:01,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-03 14:46:01,641 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:46:01,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:46:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1693768336, now seen corresponding path program 1 times [2022-10-03 14:46:01,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:46:01,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670059092] [2022-10-03 14:46:01,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:46:01,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:46:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:46:04,365 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:46:04,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:46:04,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670059092] [2022-10-03 14:46:04,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670059092] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:46:04,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:46:04,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2022-10-03 14:46:04,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664736915] [2022-10-03 14:46:04,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:46:04,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-10-03 14:46:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:46:04,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-10-03 14:46:04,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=5600, Unknown=0, NotChecked=0, Total=5852 [2022-10-03 14:46:04,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:46:04,369 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:46:04,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 8.883116883116884) internal successors, (684), 77 states have internal predecessors, (684), 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:46:04,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:46:04,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2022-10-03 14:46:04,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2022-10-03 14:46:04,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:46:24,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:46:24,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-10-03 14:46:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-10-03 14:46:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-10-03 14:46:24,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-03 14:46:24,467 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:46:24,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:46:24,467 INFO L85 PathProgramCache]: Analyzing trace with hash 184586747, now seen corresponding path program 1 times [2022-10-03 14:46:24,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:46:24,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337987004] [2022-10-03 14:46:24,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:46:24,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:46:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:46:24,627 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:46:24,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:46:24,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337987004] [2022-10-03 14:46:24,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337987004] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:46:24,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:46:24,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-03 14:46:24,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128314024] [2022-10-03 14:46:24,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:46:24,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-03 14:46:24,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:46:24,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-03 14:46:24,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-10-03 14:46:24,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:46:24,631 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:46:24,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 55.27272727272727) internal successors, (608), 12 states have internal predecessors, (608), 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:46:24,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:46:24,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2022-10-03 14:46:24,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2022-10-03 14:46:24,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states. [2022-10-03 14:46:24,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:46:27,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:46:27,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-10-03 14:46:27,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-10-03 14:46:27,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-10-03 14:46:27,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-03 14:46:27,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-03 14:46:27,368 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:46:27,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:46:27,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1853552309, now seen corresponding path program 1 times [2022-10-03 14:46:27,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:46:27,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90212253] [2022-10-03 14:46:27,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:46:27,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:46:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:46:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:46:30,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:46:30,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90212253] [2022-10-03 14:46:30,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90212253] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:46:30,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:46:30,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [83] imperfect sequences [] total 83 [2022-10-03 14:46:30,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721792797] [2022-10-03 14:46:30,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:46:30,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-10-03 14:46:30,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:46:30,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-10-03 14:46:30,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=6536, Unknown=0, NotChecked=0, Total=6806 [2022-10-03 14:46:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:46:30,375 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:46:30,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 11.036144578313253) internal successors, (916), 83 states have internal predecessors, (916), 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:46:30,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:46:30,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2022-10-03 14:46:30,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2022-10-03 14:46:30,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-10-03 14:46:30,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-03 14:46:30,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:46:57,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:46:57,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-10-03 14:46:57,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-10-03 14:46:57,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-10-03 14:46:57,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-10-03 14:46:57,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2022-10-03 14:46:57,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-03 14:46:57,843 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:46:57,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:46:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash -117451635, now seen corresponding path program 1 times [2022-10-03 14:46:57,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:46:57,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110785653] [2022-10-03 14:46:57,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:46:57,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:46:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:47:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 186 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 14:47:01,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:47:01,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110785653] [2022-10-03 14:47:01,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110785653] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:47:01,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556818156] [2022-10-03 14:47:01,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:47:01,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:47:01,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:47:01,827 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:47:01,827 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:47:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:47:02,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 2772 conjuncts, 193 conjunts are in the unsatisfiable core [2022-10-03 14:47:02,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:47:02,862 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:47:03,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:47:03,215 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 17 treesize of output 17 [2022-10-03 14:47:04,050 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 14:47:04,051 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:47:04,355 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:47:05,537 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:47:05,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:47:05,970 INFO L356 Elim1Store]: treesize reduction 80, result has 17.5 percent of original size [2022-10-03 14:47:05,970 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 27 [2022-10-03 14:47:08,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:47:08,380 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:47:08,625 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:47:09,934 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:47:09,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2022-10-03 14:47:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 279 proven. 86 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-03 14:47:10,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:47:11,574 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 18 treesize of output 12 [2022-10-03 14:47:15,076 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:47:15,113 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (let ((.cse0 (select (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|))))) is different from false [2022-10-03 14:47:15,118 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#p~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:47:15,126 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)) (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|)))) is different from false [2022-10-03 14:47:16,235 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-03 14:47:16,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-10-03 14:47:16,242 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| Int) (v_ArrVal_498 (Array Int Int))) (or (= |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) (let ((.cse0 (select (store (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|)) |ULTIMATE.start_#Ultimate.allocOnStack_#res#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~#q~1#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~#q~1#1.offset|) (select .cse0 (+ 4 |c_ULTIMATE.start_main_~#q~1#1.offset|)))))) is different from false [2022-10-03 14:47:16,830 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-10-03 14:47:16,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 46 [2022-10-03 14:47:16,858 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:47:16,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 99 [2022-10-03 14:47:16,864 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 13 treesize of output 7 [2022-10-03 14:47:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 100 proven. 265 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-03 14:47:17,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556818156] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 14:47:17,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 14:47:17,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 61, 50] total 201 [2022-10-03 14:47:17,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204212113] [2022-10-03 14:47:17,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 14:47:17,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 201 states [2022-10-03 14:47:17,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:47:17,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2022-10-03 14:47:17,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=796, Invalid=37049, Unknown=395, NotChecked=1960, Total=40200 [2022-10-03 14:47:17,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:47:17,581 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:47:17,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 201 states, 201 states have (on average 14.64179104477612) internal successors, (2943), 201 states have internal predecessors, (2943), 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:47:17,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:47:17,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-10-03 14:47:17,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2022-10-03 14:47:17,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2022-10-03 14:47:17,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-10-03 14:47:17,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 141 states. [2022-10-03 14:47:17,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:49:08,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:49:08,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-10-03 14:49:08,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-10-03 14:49:08,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-10-03 14:49:08,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-10-03 14:49:08,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-10-03 14:49:08,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2022-10-03 14:49:08,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-03 14:49:08,384 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,SelfDestructingSolverStorable6 [2022-10-03 14:49:08,384 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:49:08,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:49:08,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1594251051, now seen corresponding path program 1 times [2022-10-03 14:49:08,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:49:08,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874551808] [2022-10-03 14:49:08,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:49:08,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:49:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:49:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-10-03 14:49:12,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:49:12,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874551808] [2022-10-03 14:49:12,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874551808] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:49:12,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:49:12,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-10-03 14:49:12,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144468374] [2022-10-03 14:49:12,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:49:12,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-10-03 14:49:12,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:49:12,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-10-03 14:49:12,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=5066, Unknown=0, NotChecked=0, Total=5256 [2022-10-03 14:49:12,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:49:12,190 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:49:12,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 13.753424657534246) internal successors, (1004), 73 states have internal predecessors, (1004), 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:49:12,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:49:12,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-10-03 14:49:12,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2022-10-03 14:49:12,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2022-10-03 14:49:12,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-10-03 14:49:12,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 144 states. [2022-10-03 14:49:12,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 233 states. [2022-10-03 14:49:12,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:49:43,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:49:43,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-10-03 14:49:43,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-10-03 14:49:43,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-10-03 14:49:43,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-10-03 14:49:43,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-10-03 14:49:43,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2022-10-03 14:49:43,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-10-03 14:49:43,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-03 14:49:43,677 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:49:43,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:49:43,677 INFO L85 PathProgramCache]: Analyzing trace with hash -269697792, now seen corresponding path program 1 times [2022-10-03 14:49:43,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:49:43,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61317755] [2022-10-03 14:49:43,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:49:43,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:49:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:49:46,827 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:49:46,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:49:46,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61317755] [2022-10-03 14:49:46,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61317755] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 14:49:46,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 14:49:46,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-10-03 14:49:46,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280043667] [2022-10-03 14:49:46,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 14:49:46,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-10-03 14:49:46,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:49:46,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-10-03 14:49:46,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=4509, Unknown=0, NotChecked=0, Total=4692 [2022-10-03 14:49:46,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:49:46,830 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:49:46,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 10.81159420289855) internal successors, (746), 69 states have internal predecessors, (746), 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:49:46,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:49:46,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-10-03 14:49:46,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2022-10-03 14:49:46,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2022-10-03 14:49:46,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-10-03 14:49:46,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 144 states. [2022-10-03 14:49:46,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 235 states. [2022-10-03 14:49:46,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 117 states. [2022-10-03 14:49:46,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:50:37,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:50:37,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-10-03 14:50:37,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-10-03 14:50:37,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2022-10-03 14:50:37,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-10-03 14:50:37,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2022-10-03 14:50:37,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2022-10-03 14:50:37,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-10-03 14:50:37,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-10-03 14:50:37,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-03 14:50:37,741 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:50:37,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:50:37,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1746266713, now seen corresponding path program 1 times [2022-10-03 14:50:37,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:50:37,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869397763] [2022-10-03 14:50:37,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:50:37,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:50:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:50:49,215 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 4 proven. 414 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-10-03 14:50:49,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:50:49,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869397763] [2022-10-03 14:50:49,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869397763] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:50:49,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881190420] [2022-10-03 14:50:49,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:50:49,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:50:49,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:50:49,217 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:50:49,218 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:50:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:50:49,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 2876 conjuncts, 151 conjunts are in the unsatisfiable core [2022-10-03 14:50:49,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:50:53,624 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:50:57,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:50:57,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-10-03 14:50:57,526 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:50:58,100 INFO L356 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2022-10-03 14:50:58,101 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 21 treesize of output 21 [2022-10-03 14:50:59,112 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:50:59,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2022-10-03 14:50:59,300 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 31 proven. 359 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-10-03 14:50:59,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:51:01,041 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 18 treesize of output 12 [2022-10-03 14:51:05,798 INFO L356 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2022-10-03 14:51:05,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1720 treesize of output 1569 [2022-10-03 14:51:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2022-10-03 14:51:08,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881190420] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 14:51:08,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 14:51:08,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [136, 54, 43] total 225 [2022-10-03 14:51:08,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778226436] [2022-10-03 14:51:08,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 14:51:08,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 225 states [2022-10-03 14:51:08,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 14:51:08,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 225 interpolants. [2022-10-03 14:51:08,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1391, Invalid=49009, Unknown=0, NotChecked=0, Total=50400 [2022-10-03 14:51:08,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:08,090 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 14:51:08,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 225 states, 225 states have (on average 11.715555555555556) internal successors, (2636), 225 states have internal predecessors, (2636), 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:51:08,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:51:08,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2022-10-03 14:51:08,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-10-03 14:51:08,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 164 states. [2022-10-03 14:51:08,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-10-03 14:51:08,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 182 states. [2022-10-03 14:51:08,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 264 states. [2022-10-03 14:51:08,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 117 states. [2022-10-03 14:51:08,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-10-03 14:51:08,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:56:07,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 14:56:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-10-03 14:56:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-10-03 14:56:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2022-10-03 14:56:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-10-03 14:56:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2022-10-03 14:56:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2022-10-03 14:56:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-10-03 14:56:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-10-03 14:56:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 569 states. [2022-10-03 14:56:07,265 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:56:07,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:56:07,443 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 14:56:07,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 14:56:07,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1760396239, now seen corresponding path program 1 times [2022-10-03 14:56:07,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 14:56:07,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009366928] [2022-10-03 14:56:07,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:56:07,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 14:56:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:56:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 35 proven. 413 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-03 14:56:25,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 14:56:25,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009366928] [2022-10-03 14:56:25,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009366928] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 14:56:25,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959938721] [2022-10-03 14:56:25,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 14:56:25,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:56:25,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 14:56:25,037 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 14:56:25,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-03 14:56:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 14:56:25,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 2791 conjuncts, 357 conjunts are in the unsatisfiable core [2022-10-03 14:56:25,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 14:56:26,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:56:27,486 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:56:28,656 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-10-03 14:56:28,656 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 16 treesize of output 26 [2022-10-03 14:56:29,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 14:56:29,747 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 14:56:29,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-10-03 14:56:29,752 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 5 treesize of output 3 [2022-10-03 14:56:29,753 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-10-03 14:56:40,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 14:56:40,215 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 47 treesize of output 51 [2022-10-03 14:56:41,249 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-03 14:56:41,249 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 57 [2022-10-03 14:56:42,529 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:56:42,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:42,536 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 22 treesize of output 21 [2022-10-03 14:56:43,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:43,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-03 14:56:43,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:43,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:43,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2022-10-03 14:56:44,377 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 25 treesize of output 24 [2022-10-03 14:56:44,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:44,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:44,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:44,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-10-03 14:56:47,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:47,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:47,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:47,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:47,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:47,739 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-10-03 14:56:47,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 71 [2022-10-03 14:56:47,760 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-10-03 14:56:47,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 37 [2022-10-03 14:56:48,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:48,946 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-03 14:56:48,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 40 [2022-10-03 14:56:48,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:48,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:48,965 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-10-03 14:56:48,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 49 [2022-10-03 14:56:49,851 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 14:56:49,851 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 1 case distinctions, treesize of input 16 treesize of output 22 [2022-10-03 14:56:49,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:49,870 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-10-03 14:56:49,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2022-10-03 14:56:49,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-03 14:56:49,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-10-03 14:56:49,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-03 14:56:50,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:50,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:50,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-10-03 14:56:50,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:56:50,757 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 60 treesize of output 59 [2022-10-03 14:57:02,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:57:02,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:57:02,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:57:02,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:57:02,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:57:02,293 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-03 14:57:02,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 101 treesize of output 52 [2022-10-03 14:57:03,756 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:57:03,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:57:03,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:57:03,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 14:57:03,767 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-03 14:57:03,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 53 [2022-10-03 14:57:04,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-03 14:57:04,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 14:57:04,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 21 [2022-10-03 14:57:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 31 proven. 359 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-10-03 14:57:04,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 14:57:05,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-10-03 14:57:29,146 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int)) (or (forall ((v_ArrVal_1073 Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1071 Int)) (or (forall ((v_ArrVal_1075 Int) (v_ArrVal_1077 Int) (v_ArrVal_1078 (Array Int Int)) (v_subst_2 Int)) (let ((.cse1 (select (let ((.cse10 (store (let ((.cse11 (store |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071)))) (store .cse11 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (select .cse11 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_2 v_ArrVal_1078))) (store .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (< .cse0 0) (not (= .cse0 (select .cse1 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))) (forall ((v_ArrVal_1079 (Array Int Int))) (let ((.cse6 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (select (let ((.cse8 (store (let ((.cse9 (store |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073)))) (store .cse9 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_2 v_ArrVal_1079))) (store .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (not (= (select .cse2 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) .cse3)) (= (let ((.cse4 (let ((.cse5 (store (let ((.cse7 (store |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071)))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_2 v_ArrVal_1078))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (select (select .cse4 .cse3) (+ 16 (select (select .cse4 |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|)))) 0)))))))))) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (not (<= |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset|)))) (forall ((|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int)) (or (forall ((v_ArrVal_1073 Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1071 Int)) (or (forall ((v_ArrVal_1075 Int) (v_ArrVal_1077 Int) (v_ArrVal_1078 (Array Int Int)) (v_subst_1 Int)) (let ((.cse13 (select (let ((.cse22 (store (let ((.cse23 (store |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071)))) (store .cse23 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (select .cse23 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_1 v_ArrVal_1078))) (store .cse22 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse22 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (< .cse12 0) (not (= .cse12 (select .cse13 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))) (forall ((v_ArrVal_1079 (Array Int Int))) (let ((.cse17 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse14 (let ((.cse20 (store (let ((.cse21 (store |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073)))) (store .cse21 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (select .cse21 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_1 v_ArrVal_1079))) (store .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse17 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))))) (let ((.cse19 (select .cse14 |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse15 (select .cse19 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (= (select (select .cse14 .cse15) (+ (select (select (let ((.cse16 (store (let ((.cse18 (store |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_pusherThread1of1ForFork0_write~int_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071)))) (store .cse18 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (select .cse18 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_1 v_ArrVal_1078))) (store .cse16 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse16 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse17 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 16)) 0) (not (= (select .cse19 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) .cse15)))))))))))) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (not (<= |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset|))))) is different from false [2022-10-03 14:57:29,291 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int)) (or (forall ((v_ArrVal_1073 Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1071 Int)) (or (forall ((v_ArrVal_1075 Int) (v_ArrVal_1077 Int) (v_ArrVal_1078 (Array Int Int)) (v_subst_2 Int)) (let ((.cse1 (select (let ((.cse10 (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071)))) (store .cse11 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (select .cse11 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_2 v_ArrVal_1078))) (store .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (< .cse0 0) (not (= .cse0 (select .cse1 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)))) (forall ((v_ArrVal_1079 (Array Int Int))) (let ((.cse6 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (select (let ((.cse8 (store (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073)))) (store .cse9 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_2 v_ArrVal_1079))) (store .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (not (= (select .cse2 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) .cse3)) (= (let ((.cse4 (let ((.cse5 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071)))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_2 v_ArrVal_1078))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse6 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (select (select .cse4 .cse3) (+ (select (select .cse4 |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|) 16))) 0)))))))))) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (not (<= |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset|)))) (forall ((|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int)) (or (forall ((v_ArrVal_1073 Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1071 Int)) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (forall ((v_ArrVal_1075 Int) (v_ArrVal_1077 Int) (v_ArrVal_1078 (Array Int Int)) (v_subst_1 Int)) (let ((.cse21 (select (let ((.cse22 (store (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071)))) (store .cse23 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (select .cse23 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_1 v_ArrVal_1078))) (store .cse22 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse22 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse12 (select .cse21 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (< .cse12 0) (forall ((v_ArrVal_1079 (Array Int Int))) (let ((.cse16 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse13 (let ((.cse19 (store (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073)))) (store .cse20 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_1 v_ArrVal_1079))) (store .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse19 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse16 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))))) (let ((.cse18 (select .cse13 |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse14 (select .cse18 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (= (select (select .cse13 .cse14) (+ 16 (select (select (let ((.cse15 (store (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base| (store (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.base|) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071)))) (store .cse17 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (select .cse17 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_1 v_ArrVal_1078))) (store .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse16 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_ULTIMATE.start_fifo_front_~self#1.base|) |c_ULTIMATE.start_fifo_front_~self#1.offset|))) 0) (not (= (select .cse18 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) .cse14)))))))) (not (= (select .cse21 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) .cse12)))))))) (not (<= |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| |c_pusherThread1of1ForFork0_fifo_push_#t~mem26#1.offset|))))) is different from false [2022-10-03 14:57:42,206 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1073 Int) (v_ArrVal_1075 Int) (|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1077 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_1071 Int)) (let ((.cse3 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse10 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse3))) (let ((.cse4 (let ((.cse11 (store (let ((.cse12 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071)))) (store .cse12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (select .cse12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_2 v_ArrVal_1078))) (store .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse6 (select (let ((.cse7 (store (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073)))) (store .cse9 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_2 v_ArrVal_1079))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse0 (select .cse4 |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse5 (select .cse6 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4))) (or (not (= (select .cse0 .cse1) .cse2)) (< (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse3) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11|) (< .cse2 0) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| .cse3)) (= (select (select .cse4 .cse5) (+ 16 .cse2)) 0) (not (= .cse5 (select .cse6 .cse1)))))))))) (forall ((v_ArrVal_1073 Int) (v_ArrVal_1075 Int) (|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1077 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_1071 Int)) (let ((.cse16 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) (let ((.cse21 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse23 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse16))) (let ((.cse13 (let ((.cse24 (store (let ((.cse25 (store |c_#memory_$Pointer$.base| .cse23 (store (select |c_#memory_$Pointer$.base| .cse23) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073)))) (store .cse25 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (select .cse25 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_1 v_ArrVal_1079))) (store .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse21 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))))) (let ((.cse19 (select (let ((.cse20 (store (let ((.cse22 (store |c_#memory_$Pointer$.offset| .cse23 (store (select |c_#memory_$Pointer$.offset| .cse23) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071)))) (store .cse22 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (store (select .cse22 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_1 v_ArrVal_1078))) (store .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse21 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))) |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse17 (select .cse13 |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse14 (select .cse17 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse18 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) (.cse15 (select .cse19 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (= (select (select .cse13 .cse14) (+ 16 .cse15)) 0) (< (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse16) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11|) (< .cse15 0) (not (= (select .cse17 .cse18) .cse14)) (not (= (select .cse19 .cse18) .cse15)) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| .cse16)))))))))) is different from false [2022-10-03 14:57:42,520 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1073 Int) (v_ArrVal_1075 Int) (|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1077 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_1071 Int)) (let ((.cse3 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset|))) (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse10 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base|) .cse3))) (let ((.cse4 (let ((.cse11 (store (let ((.cse12 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071)))) (store .cse12 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| (store (select .cse12 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_2 v_ArrVal_1078))) (store .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset|))))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse0 (select (let ((.cse7 (store (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073)))) (store .cse9 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| (store (select .cse9 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_2 v_ArrVal_1079))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base|))) |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) (.cse5 (select .cse6 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (not (= (select .cse0 .cse1) .cse2)) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| .cse3)) (= (select (select .cse4 .cse2) (+ 16 .cse5)) 0) (< (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base|) .cse3) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11|) (not (= (select .cse6 .cse1) .cse5)) (< .cse5 0)))))))) (forall ((v_ArrVal_1073 Int) (v_ArrVal_1075 Int) (|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1077 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_1071 Int)) (let ((.cse16 (+ 12 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset|))) (let ((.cse21 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse23 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base|) .cse16))) (let ((.cse19 (let ((.cse24 (store (let ((.cse25 (store |c_#memory_$Pointer$.base| .cse23 (store (select |c_#memory_$Pointer$.base| .cse23) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073)))) (store .cse25 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| (store (select .cse25 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_1 v_ArrVal_1079))) (store .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse21 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base|))))) (let ((.cse17 (select (let ((.cse20 (store (let ((.cse22 (store |c_#memory_$Pointer$.offset| .cse23 (store (select |c_#memory_$Pointer$.offset| .cse23) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071)))) (store .cse22 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base| (store (select .cse22 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_1 v_ArrVal_1078))) (store .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse21 |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.offset|))) |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse14 (select .cse19 |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse15 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) (.cse13 (select .cse14 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse18 (select .cse17 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (not (= .cse13 (select .cse14 .cse15))) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| .cse16)) (< (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~ret24#1.base|) .cse16) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11|) (not (= (select .cse17 .cse15) .cse18)) (= 0 (select (select .cse19 .cse13) (+ .cse18 16))) (< .cse18 0))))))))) is different from false [2022-10-03 14:57:42,713 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1073 Int) (v_ArrVal_1075 Int) (|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1077 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_1071 Int)) (let ((.cse0 (+ |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| 12))) (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse10 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) .cse0))) (let ((.cse2 (let ((.cse11 (store (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073)))) (store .cse12 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| (store (select .cse12 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_1 v_ArrVal_1079))) (store .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|))))) (let ((.cse6 (select .cse2 |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse4 (select (let ((.cse7 (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071)))) (store .cse9 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| (store (select .cse9 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_1 v_ArrVal_1078))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|))) |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) (.cse3 (select .cse6 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| .cse0)) (< .cse1 0) (< (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) .cse0) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11|) (= (select (select .cse2 .cse3) (+ .cse1 16)) 0) (not (= .cse1 (select .cse4 .cse5))) (not (= (select .cse6 .cse5) .cse3))))))))) (forall ((v_ArrVal_1073 Int) (v_ArrVal_1075 Int) (|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1077 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_1071 Int)) (let ((.cse13 (+ |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset| 12))) (let ((.cse21 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse23 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) .cse13))) (let ((.cse19 (let ((.cse24 (store (let ((.cse25 (store |c_#memory_$Pointer$.offset| .cse23 (store (select |c_#memory_$Pointer$.offset| .cse23) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071)))) (store .cse25 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| (store (select .cse25 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_2 v_ArrVal_1078))) (store .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse21 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.offset|))))) (let ((.cse15 (select .cse19 |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse17 (select (let ((.cse20 (store (let ((.cse22 (store |c_#memory_$Pointer$.base| .cse23 (store (select |c_#memory_$Pointer$.base| .cse23) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073)))) (store .cse22 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base| (store (select .cse22 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_2 v_ArrVal_1079))) (store .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse21 |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|))) |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse16 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) (.cse18 (select .cse17 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse14 (select .cse15 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| .cse13)) (not (= .cse14 (select .cse15 .cse16))) (< (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_#res#1.base|) .cse13) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11|) (not (= (select .cse17 .cse16) .cse18)) (= 0 (select (select .cse19 .cse18) (+ .cse14 16))) (< .cse14 0))))))))) is different from false [2022-10-03 14:57:42,812 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1073 Int) (v_ArrVal_1075 Int) (|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1077 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_1071 Int)) (let ((.cse3 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse10 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse3))) (let ((.cse0 (let ((.cse11 (store (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073)))) (store .cse12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_1 v_ArrVal_1079))) (store .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse11 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))))) (let ((.cse6 (select (let ((.cse7 (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071)))) (store .cse9 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse9 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_1 v_ArrVal_1078))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse4 (select .cse0 |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) (.cse2 (select .cse6 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (= (select (select .cse0 .cse1) (+ 16 .cse2)) 0) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| .cse3)) (not (= .cse1 (select .cse4 .cse5))) (not (= .cse2 (select .cse6 .cse5))) (< .cse2 0) (< (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse3) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11|)))))))) (forall ((v_ArrVal_1073 Int) (v_ArrVal_1075 Int) (|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1077 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_1071 Int)) (let ((.cse18 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse21 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse23 (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse18))) (let ((.cse16 (let ((.cse24 (store (let ((.cse25 (store |c_#memory_$Pointer$.offset| .cse23 (store (select |c_#memory_$Pointer$.offset| .cse23) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071)))) (store .cse25 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse25 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_2 v_ArrVal_1078))) (store .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse24 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse21 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))))) (let ((.cse19 (select (let ((.cse20 (store (let ((.cse22 (store |c_#memory_$Pointer$.base| .cse23 (store (select |c_#memory_$Pointer$.base| .cse23) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073)))) (store .cse22 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse22 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_2 v_ArrVal_1079))) (store .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse20 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse21 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse14 (select .cse16 |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse17 (select .cse19 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse15 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4))) (or (< .cse13 0) (not (= (select .cse14 .cse15) .cse13)) (= (select (select .cse16 .cse17) (+ 16 .cse13)) 0) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| .cse18)) (not (= .cse17 (select .cse19 .cse15))) (< (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse18) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11|))))))))) is different from false [2022-10-03 14:57:43,034 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1073 Int) (v_ArrVal_1075 Int) (|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1077 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_1071 Int)) (let ((.cse11 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|))) (.cse3 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse9 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse6 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset|))) (.cse12 (select (select .cse11 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse3))) (let ((.cse1 (let ((.cse13 (store (let ((.cse14 (store .cse6 .cse12 (store (select .cse6 .cse12) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071)))) (store .cse14 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse14 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_2 v_ArrVal_1078))) (store .cse13 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse13 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))))) (let ((.cse7 (select (let ((.cse8 (store (let ((.cse10 (store .cse11 .cse12 (store (select .cse11 .cse12) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073)))) (store .cse10 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_2 v_ArrVal_1079))) (store .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse4 (select .cse1 |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse2 (select .cse7 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4))) (or (< .cse0 0) (= (select (select .cse1 .cse2) (+ 16 .cse0)) 0) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| .cse3)) (not (= (select .cse4 .cse5) .cse0)) (< (select (select .cse6 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse3) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11|) (not (= .cse2 (select .cse7 .cse5)))))))))) (forall ((v_ArrVal_1073 Int) (v_ArrVal_1075 Int) (|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1077 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_1071 Int)) (let ((.cse29 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|))) (.cse18 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse24 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse26 (select (select .cse29 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse18))) (let ((.cse22 (let ((.cse27 (store (let ((.cse28 (store .cse29 .cse26 (store (select .cse29 .cse26) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073)))) (store .cse28 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse28 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_1 v_ArrVal_1079))) (store .cse27 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse27 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse24 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) (.cse21 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.offset|)))) (let ((.cse16 (select (let ((.cse23 (store (let ((.cse25 (store .cse21 .cse26 (store (select .cse21 .cse26) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071)))) (store .cse25 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse25 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_1 v_ArrVal_1078))) (store .cse23 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse23 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse24 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse20 (select .cse22 |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse17 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) (.cse19 (select .cse20 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse15 (select .cse16 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (< .cse15 0) (not (= .cse15 (select .cse16 .cse17))) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| .cse18)) (not (= .cse19 (select .cse20 .cse17))) (< (select (select .cse21 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) .cse18) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11|) (= (select (select .cse22 .cse19) (+ .cse15 16)) 0))))))))) is different from false [2022-10-03 14:57:43,531 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1073 Int) (v_ArrVal_1075 Int) (|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1077 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_1071 Int)) (let ((.cse17 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (.cse1 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse9 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse12 (select .cse17 .cse1)) (.cse13 (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse5 (let ((.cse14 (store (let ((.cse15 (let ((.cse16 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse17 .cse13 0)))) (store .cse16 .cse12 (store (select .cse16 .cse12) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073))))) (store .cse15 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse15 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_1 v_ArrVal_1079))) (store .cse14 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse14 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) (.cse0 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse7 (select (let ((.cse8 (store (let ((.cse10 (let ((.cse11 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse0 .cse13 0)))) (store .cse11 .cse12 (store (select .cse11 .cse12) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071))))) (store .cse10 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_1 v_ArrVal_1078))) (store .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse2 (select .cse5 |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) (.cse6 (select .cse7 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (< (select .cse0 .cse1) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11|) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| .cse1)) (not (= (select .cse2 .cse3) .cse4)) (= (select (select .cse5 .cse4) (+ 16 .cse6)) 0) (< .cse6 0) (not (= (select .cse7 .cse3) .cse6))))))))) (forall ((v_ArrVal_1073 Int) (v_ArrVal_1075 Int) (|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1077 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_1071 Int)) (let ((.cse31 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (.cse22 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse27 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse30 (select .cse31 .cse22)) (.cse21 (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (.cse32 (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse25 (let ((.cse33 (store (let ((.cse34 (let ((.cse35 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse21 .cse32 0)))) (store .cse35 .cse30 (store (select .cse35 .cse30) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071))))) (store .cse34 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse34 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_2 v_ArrVal_1078))) (store .cse33 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse33 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse27 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))))) (let ((.cse18 (select .cse25 |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse24 (select (let ((.cse26 (store (let ((.cse28 (let ((.cse29 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse31 .cse32 0)))) (store .cse29 .cse30 (store (select .cse29 .cse30) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073))))) (store .cse28 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse28 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_2 v_ArrVal_1079))) (store .cse26 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse26 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse27 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse19 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) (.cse23 (select .cse24 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse20 (select .cse18 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (not (= (select .cse18 .cse19) .cse20)) (< (select .cse21 .cse22) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11|) (not (= .cse23 (select .cse24 .cse19))) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| .cse22)) (= (select (select .cse25 .cse23) (+ 16 .cse20)) 0) (< .cse20 0))))))))) is different from false [2022-10-03 14:57:43,863 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1073 Int) (v_ArrVal_1075 Int) (|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1077 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_1071 Int)) (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (.cse3 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse9 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse12 (select .cse13 .cse3)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (.cse14 (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse6 (let ((.cse15 (store (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse7 .cse14 0)))) (store .cse17 .cse12 (store (select .cse17 .cse12) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071))))) (store .cse16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_2 v_ArrVal_1078))) (store .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse15 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse1 (select (let ((.cse8 (store (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse13 .cse14 0)))) (store .cse11 .cse12 (store (select .cse11 .cse12) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073))))) (store .cse10 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_2 v_ArrVal_1079))) (store .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse2 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) (.cse0 (select .cse1 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (not (= .cse0 (select .cse1 .cse2))) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| .cse3)) (< .cse4 0) (not (= .cse4 (select .cse5 .cse2))) (= (select (select .cse6 .cse0) (+ 16 .cse4)) 0) (< (select .cse7 .cse3) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11|)))))))) (forall ((v_ArrVal_1073 Int) (v_ArrVal_1075 Int) (|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1077 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_1071 Int)) (let ((.cse35 (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (.cse23 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse27 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse30 (select .cse35 .cse23)) (.cse31 (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse24 (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (.cse18 (let ((.cse32 (store (let ((.cse33 (let ((.cse34 (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse35 .cse31 0)))) (store .cse34 .cse30 (store (select .cse34 .cse30) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073))))) (store .cse33 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse33 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_1 v_ArrVal_1079))) (store .cse32 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse32 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse27 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))))) (let ((.cse25 (select .cse18 |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse21 (select (let ((.cse26 (store (let ((.cse28 (let ((.cse29 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse24 .cse31 0)))) (store .cse29 .cse30 (store (select .cse29 .cse30) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071))))) (store .cse28 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse28 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_1 v_ArrVal_1078))) (store .cse26 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse26 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse27 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse19 (select .cse25 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse22 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4))) (or (= (select (select .cse18 .cse19) (+ 16 .cse20)) 0) (not (= .cse20 (select .cse21 .cse22))) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| .cse23)) (< .cse20 0) (< (select .cse24 .cse23) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11|) (not (= .cse19 (select .cse25 .cse22))))))))))) is different from false [2022-10-03 14:57:44,260 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1073 Int) (v_ArrVal_1064 Int) (v_ArrVal_1075 Int) (|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1077 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_1071 Int)) (let ((.cse13 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse19 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| v_ArrVal_1064))) (.cse14 (select .cse13 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (.cse4 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse9 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse12 (select .cse14 .cse4)) (.cse3 (select .cse19 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (.cse15 (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse0 (let ((.cse16 (store (let ((.cse17 (let ((.cse18 (store .cse19 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse3 .cse15 0)))) (store .cse18 .cse12 (store (select .cse18 .cse12) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071))))) (store .cse17 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse17 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_2 v_ArrVal_1078))) (store .cse16 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse16 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))))) (let ((.cse7 (select .cse0 |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse5 (select (let ((.cse8 (store (let ((.cse10 (let ((.cse11 (store .cse13 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse14 .cse15 0)))) (store .cse11 .cse12 (store (select .cse11 .cse12) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073))))) (store .cse10 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse10 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_2 v_ArrVal_1079))) (store .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse8 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse9 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse2 (select .cse7 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4))) (or (= (select (select .cse0 .cse1) (+ 16 .cse2)) 0) (< (select .cse3 .cse4) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11|) (not (= .cse1 (select .cse5 .cse6))) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| .cse4)) (< .cse2 0) (not (= .cse2 (select .cse7 .cse6))))))))))) (forall ((v_ArrVal_1073 Int) (v_ArrVal_1064 Int) (v_ArrVal_1075 Int) (|v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| Int) (|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| Int) (v_ArrVal_1077 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1078 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_1071 Int)) (let ((.cse38 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#value#1.base|)))) (let ((.cse39 (select .cse38 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)) (.cse21 (+ 12 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse33 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset| v_ArrVal_1064))) (.cse29 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4)) (.cse32 (select .cse39 .cse21)) (.cse34 (+ 16 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) (let ((.cse27 (let ((.cse35 (store (let ((.cse36 (let ((.cse37 (store .cse38 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse39 .cse34 0)))) (store .cse37 .cse32 (store (select .cse37 .cse32) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1073))))) (store .cse36 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse36 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1077))) v_subst_1 v_ArrVal_1079))) (store .cse35 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse35 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse29 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|)))) (.cse20 (select .cse33 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|))) (let ((.cse22 (select (let ((.cse28 (store (let ((.cse30 (let ((.cse31 (store .cse33 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store .cse20 .cse34 0)))) (store .cse31 .cse32 (store (select .cse31 .cse32) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11| v_ArrVal_1071))))) (store .cse30 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base| (store (select .cse30 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| v_ArrVal_1075))) v_subst_1 v_ArrVal_1078))) (store .cse28 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse28 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse29 |c_pusherThread1of1ForFork0_fifo_node_init_~self#1.offset|))) |c_ULTIMATE.start_fifo_front_~self#1.base|)) (.cse25 (select .cse27 |c_ULTIMATE.start_fifo_front_~self#1.base|))) (let ((.cse23 (+ |c_ULTIMATE.start_fifo_front_~self#1.offset| 4)) (.cse26 (select .cse25 |c_ULTIMATE.start_fifo_front_~self#1.offset|)) (.cse24 (select .cse22 |c_ULTIMATE.start_fifo_front_~self#1.offset|))) (or (< (select .cse20 .cse21) |v_pusherThread1of1ForFork0_write~int_#ptr#1.offset_11|) (not (= (select .cse22 .cse23) .cse24)) (not (<= |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_49| .cse21)) (not (= (select .cse25 .cse23) .cse26)) (= (select (select .cse27 .cse26) (+ 16 .cse24)) 0) (< .cse24 0)))))))))) is different from false Received shutdown request... [2022-10-03 14:57:47,426 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 14:57:47,426 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 14:57:47,426 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 14:57:47,468 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 14:57:47,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-03 14:57:47,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 14:57:47,669 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 1126 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 312 known predicates. [2022-10-03 14:57:47,673 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-03 14:57:47,674 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-10-03 14:57:47,675 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 14:57:47,675 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 14:57:47,677 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1522.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:57:47 BasicIcfg [2022-10-03 14:57:47,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 14:57:47,677 INFO L158 Benchmark]: Toolchain (without parser) took 747692.31ms. Allocated memory was 173.0MB in the beginning and 978.3MB in the end (delta: 805.3MB). Free memory was 118.8MB in the beginning and 129.7MB in the end (delta: -10.9MB). Peak memory consumption was 795.1MB. Max. memory is 8.0GB. [2022-10-03 14:57:47,677 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 173.0MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 14:57:47,678 INFO L158 Benchmark]: Boogie Preprocessor took 136.98ms. Allocated memory is still 173.0MB. Free memory was 118.8MB in the beginning and 139.9MB in the end (delta: -21.1MB). Peak memory consumption was 16.3MB. Max. memory is 8.0GB. [2022-10-03 14:57:47,678 INFO L158 Benchmark]: RCFGBuilder took 1155.04ms. Allocated memory was 173.0MB in the beginning and 272.6MB in the end (delta: 99.6MB). Free memory was 139.8MB in the beginning and 226.2MB in the end (delta: -86.4MB). Peak memory consumption was 65.5MB. Max. memory is 8.0GB. [2022-10-03 14:57:47,678 INFO L158 Benchmark]: TraceAbstraction took 746396.87ms. Allocated memory was 272.6MB in the beginning and 978.3MB in the end (delta: 705.7MB). Free memory was 225.7MB in the beginning and 129.7MB in the end (delta: 96.0MB). Peak memory consumption was 802.2MB. Max. memory is 8.0GB. [2022-10-03 14:57:47,678 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.13ms. Allocated memory is still 173.0MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 136.98ms. Allocated memory is still 173.0MB. Free memory was 118.8MB in the beginning and 139.9MB in the end (delta: -21.1MB). Peak memory consumption was 16.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1155.04ms. Allocated memory was 173.0MB in the beginning and 272.6MB in the end (delta: 99.6MB). Free memory was 139.8MB in the beginning and 226.2MB in the end (delta: -86.4MB). Peak memory consumption was 65.5MB. Max. memory is 8.0GB. * TraceAbstraction took 746396.87ms. Allocated memory was 272.6MB in the beginning and 978.3MB in the end (delta: 705.7MB). Free memory was 225.7MB in the beginning and 129.7MB in the end (delta: 96.0MB). Peak memory consumption was 802.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 474, positive: 457, positive conditional: 457, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 35752, positive: 34573, positive conditional: 34573, positive unconditional: 0, negative: 1179, negative conditional: 1179, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34581, positive: 34573, positive conditional: 0, positive unconditional: 34573, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7256, positive: 7250, positive conditional: 0, positive unconditional: 7250, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 34581, positive: 27323, positive conditional: 0, positive unconditional: 27323, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 7256, unknown conditional: 0, unknown unconditional: 7256] , Statistics on independence cache: Total cache size (in pairs): 457, Positive cache size: 457, Positive conditional cache size: 0, Positive unconditional cache size: 457, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 17, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1474, positive: 1431, positive conditional: 1431, positive unconditional: 0, negative: 43, negative conditional: 43, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 35752, positive: 34573, positive conditional: 34573, positive unconditional: 0, negative: 1179, negative conditional: 1179, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34581, positive: 34573, positive conditional: 0, positive unconditional: 34573, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7256, positive: 7250, positive conditional: 0, positive unconditional: 7250, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 34581, positive: 27323, positive conditional: 0, positive unconditional: 27323, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 7256, unknown conditional: 0, unknown unconditional: 7256] , Statistics on independence cache: Total cache size (in pairs): 1431, Positive cache size: 1431, Positive conditional cache size: 0, Positive unconditional cache size: 1431, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 60, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1712, positive: 1656, positive conditional: 1656, positive unconditional: 0, negative: 56, negative conditional: 56, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 35752, positive: 34573, positive conditional: 34573, positive unconditional: 0, negative: 1179, negative conditional: 1179, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34581, positive: 34573, positive conditional: 0, positive unconditional: 34573, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7256, positive: 7250, positive conditional: 0, positive unconditional: 7250, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 34581, positive: 27323, positive conditional: 0, positive unconditional: 27323, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 7256, unknown conditional: 0, unknown unconditional: 7256] , Statistics on independence cache: Total cache size (in pairs): 2140, Positive cache size: 2139, Positive conditional cache size: 0, Positive unconditional cache size: 2139, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 115, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2100, positive: 2031, positive conditional: 2031, positive unconditional: 0, negative: 69, negative conditional: 69, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 35752, positive: 34573, positive conditional: 34573, positive unconditional: 0, negative: 1179, negative conditional: 1179, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34581, positive: 34573, positive conditional: 0, positive unconditional: 34573, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7256, positive: 7250, positive conditional: 0, positive unconditional: 7250, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 34581, positive: 27323, positive conditional: 0, positive unconditional: 27323, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 7256, unknown conditional: 0, unknown unconditional: 7256] , Statistics on independence cache: Total cache size (in pairs): 2305, Positive cache size: 2304, Positive conditional cache size: 0, Positive unconditional cache size: 2304, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 184, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1694, positive: 1637, positive conditional: 1637, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 35752, positive: 34573, positive conditional: 34573, positive unconditional: 0, negative: 1179, negative conditional: 1179, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34581, positive: 34573, positive conditional: 0, positive unconditional: 34573, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7256, positive: 7250, positive conditional: 0, positive unconditional: 7250, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 34581, positive: 27323, positive conditional: 0, positive unconditional: 27323, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 7256, unknown conditional: 0, unknown unconditional: 7256] , Statistics on independence cache: Total cache size (in pairs): 2333, Positive cache size: 2332, Positive conditional cache size: 0, Positive unconditional cache size: 2332, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 241, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2815, positive: 2724, positive conditional: 2724, positive unconditional: 0, negative: 91, negative conditional: 91, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 35752, positive: 34573, positive conditional: 34573, positive unconditional: 0, negative: 1179, negative conditional: 1179, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34581, positive: 34573, positive conditional: 0, positive unconditional: 34573, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7256, positive: 7250, positive conditional: 0, positive unconditional: 7250, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 34581, positive: 27323, positive conditional: 0, positive unconditional: 27323, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 7256, unknown conditional: 0, unknown unconditional: 7256] , Statistics on independence cache: Total cache size (in pairs): 2605, Positive cache size: 2604, Positive conditional cache size: 0, Positive unconditional cache size: 2604, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 332, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4348, positive: 4206, positive conditional: 4206, positive unconditional: 0, negative: 142, negative conditional: 142, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 35752, positive: 34573, positive conditional: 34573, positive unconditional: 0, negative: 1179, negative conditional: 1179, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34581, positive: 34573, positive conditional: 0, positive unconditional: 34573, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7256, positive: 7250, positive conditional: 0, positive unconditional: 7250, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 34581, positive: 27323, positive conditional: 0, positive unconditional: 27323, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 7256, unknown conditional: 0, unknown unconditional: 7256] , Statistics on independence cache: Total cache size (in pairs): 2811, Positive cache size: 2810, Positive conditional cache size: 0, Positive unconditional cache size: 2810, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 474, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4267, positive: 4127, positive conditional: 4127, positive unconditional: 0, negative: 140, negative conditional: 140, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 35752, positive: 34573, positive conditional: 34573, positive unconditional: 0, negative: 1179, negative conditional: 1179, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34581, positive: 34573, positive conditional: 0, positive unconditional: 34573, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7256, positive: 7250, positive conditional: 0, positive unconditional: 7250, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 34581, positive: 27323, positive conditional: 0, positive unconditional: 27323, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 7256, unknown conditional: 0, unknown unconditional: 7256] , Statistics on independence cache: Total cache size (in pairs): 2858, Positive cache size: 2857, Positive conditional cache size: 0, Positive unconditional cache size: 2857, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 614, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 8678, positive: 8400, positive conditional: 8400, positive unconditional: 0, negative: 278, negative conditional: 278, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 35752, positive: 34573, positive conditional: 34573, positive unconditional: 0, negative: 1179, negative conditional: 1179, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34581, positive: 34573, positive conditional: 0, positive unconditional: 34573, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7256, positive: 7250, positive conditional: 0, positive unconditional: 7250, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 34581, positive: 27323, positive conditional: 0, positive unconditional: 27323, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 7256, unknown conditional: 0, unknown unconditional: 7256] , Statistics on independence cache: Total cache size (in pairs): 5827, Positive cache size: 5823, Positive conditional cache size: 0, Positive unconditional cache size: 5823, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Independence queries for same thread: 889, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2835, positive: 2744, positive conditional: 2744, positive unconditional: 0, negative: 91, negative conditional: 91, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 35752, positive: 34573, positive conditional: 34573, positive unconditional: 0, negative: 1179, negative conditional: 1179, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34581, positive: 34573, positive conditional: 0, positive unconditional: 34573, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7256, positive: 7250, positive conditional: 0, positive unconditional: 7250, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 34581, positive: 27323, positive conditional: 0, positive unconditional: 27323, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 7256, unknown conditional: 0, unknown unconditional: 7256] , Statistics on independence cache: Total cache size (in pairs): 6343, Positive cache size: 6337, Positive conditional cache size: 0, Positive unconditional cache size: 6337, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Independence queries for same thread: 978, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5355, positive: 5160, positive conditional: 5160, positive unconditional: 0, negative: 195, negative conditional: 195, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 35752, positive: 34573, positive conditional: 34573, positive unconditional: 0, negative: 1179, negative conditional: 1179, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34581, positive: 34573, positive conditional: 0, positive unconditional: 34573, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7256, positive: 7250, positive conditional: 0, positive unconditional: 7250, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 34581, positive: 27323, positive conditional: 0, positive unconditional: 27323, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 7256, unknown conditional: 0, unknown unconditional: 7256] , Statistics on independence cache: Total cache size (in pairs): 7256, Positive cache size: 7250, Positive conditional cache size: 0, Positive unconditional cache size: 7250, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Independence queries for same thread: 1171, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1522]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 1126 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 312 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 1463 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 746.2s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 576.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 1656, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 66.3s InterpolantComputationTime, 10840 NumberOfCodeBlocks, 10840 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 13126 ConstructedInterpolants, 549 QuantifiedInterpolants, 221951 SizeOfPredicates, 217 NumberOfNonLiveVariables, 5648 ConjunctsInSsa, 344 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 1572/3023 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown