/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.line1188.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-09-29 21:36:10,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 21:36:10,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 21:36:10,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 21:36:10,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 21:36:10,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 21:36:10,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 21:36:10,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 21:36:10,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 21:36:10,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 21:36:10,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 21:36:10,976 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 21:36:10,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 21:36:10,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 21:36:10,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 21:36:10,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 21:36:10,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 21:36:10,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 21:36:10,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 21:36:10,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 21:36:10,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 21:36:10,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 21:36:10,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 21:36:10,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 21:36:11,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 21:36:11,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 21:36:11,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 21:36:11,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 21:36:11,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 21:36:11,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 21:36:11,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 21:36:11,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 21:36:11,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 21:36:11,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 21:36:11,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 21:36:11,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 21:36:11,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 21:36:11,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 21:36:11,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 21:36:11,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 21:36:11,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 21:36:11,015 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-09-29 21:36:11,048 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 21:36:11,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 21:36:11,049 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 21:36:11,049 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 21:36:11,050 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-29 21:36:11,050 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-29 21:36:11,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 21:36:11,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 21:36:11,050 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 21:36:11,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 21:36:11,051 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 21:36:11,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 21:36:11,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 21:36:11,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 21:36:11,052 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-29 21:36:11,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-29 21:36:11,052 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-29 21:36:11,052 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 21:36:11,052 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 21:36:11,052 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 21:36:11,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-29 21:36:11,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 21:36:11,053 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 21:36:11,053 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-29 21:36:11,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-29 21:36:11,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-29 21:36:11,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 21:36:11,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-29 21:36:11,054 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-29 21:36:11,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 21:36:11,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-29 21:36:11,054 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-29 21:36:11,054 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-09-29 21:36:11,054 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-29 21:36:11,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-29 21:36:11,054 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-09-29 21:36:11,055 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-09-29 21:36:11,055 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-09-29 21:36:11,055 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-09-29 21:36:11,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 21:36:11,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 21:36:11,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 21:36:11,352 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 21:36:11,353 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 21:36:11,355 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.line1188.bpl [2022-09-29 21:36:11,355 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line1188.bpl' [2022-09-29 21:36:11,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 21:36:11,445 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-09-29 21:36:11,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 21:36:11,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 21:36:11,447 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 21:36:11,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1188.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 09:36:11" (1/1) ... [2022-09-29 21:36:11,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1188.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 09:36:11" (1/1) ... [2022-09-29 21:36:11,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1188.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 09:36:11" (1/1) ... [2022-09-29 21:36:11,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1188.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 09:36:11" (1/1) ... [2022-09-29 21:36:11,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1188.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 09:36:11" (1/1) ... [2022-09-29 21:36:11,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1188.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 09:36:11" (1/1) ... [2022-09-29 21:36:11,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line1188.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 09:36:11" (1/1) ... [2022-09-29 21:36:11,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 21:36:11,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 21:36:11,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 21:36:11,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 21:36:11,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line1188.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 09:36:11" (1/1) ... [2022-09-29 21:36:11,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-29 21:36:11,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 21:36:11,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-29 21:36:11,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-29 21:36:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-09-29 21:36:11,698 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-09-29 21:36:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 21:36:11,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 21:36:11,699 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-29 21:36:11,930 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 21:36:11,931 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 21:36:12,868 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 21:36:12,891 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 21:36:12,892 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-09-29 21:36:12,895 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1188.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 09:36:12 BoogieIcfgContainer [2022-09-29 21:36:12,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 21:36:12,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-29 21:36:12,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-29 21:36:12,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-29 21:36:12,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1188.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 09:36:11" (1/2) ... [2022-09-29 21:36:12,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26be4542 and model type divinefifo-bug_1w1r.line1188.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.09 09:36:12, skipping insertion in model container [2022-09-29 21:36:12,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line1188.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 09:36:12" (2/2) ... [2022-09-29 21:36:12,913 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line1188.bpl [2022-09-29 21:36:12,920 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-29 21:36:12,929 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-29 21:36:12,929 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-29 21:36:12,929 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-29 21:36:13,038 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-09-29 21:36:13,093 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-29 21:36:13,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-29 21:36:13,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 21:36:13,095 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-09-29 21:36:13,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-09-29 21:36:13,130 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-29 21:36:13,138 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-09-29 21:36:13,144 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;@3bc5ac25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-29 21:36:13,144 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-29 21:36:13,439 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 21:36:13,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 21:36:13,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1519936879, now seen corresponding path program 1 times [2022-09-29 21:36:13,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 21:36:13,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749385227] [2022-09-29 21:36:13,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 21:36:13,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 21:36:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 21:36:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 21:36:13,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 21:36:13,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749385227] [2022-09-29 21:36:13,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749385227] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 21:36:13,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 21:36:13,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-29 21:36:13,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830389888] [2022-09-29 21:36:13,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 21:36:13,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-29 21:36:13,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 21:36:13,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-29 21:36:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-29 21:36:14,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:36:14,007 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 21:36:14,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 206.0) internal successors, (412), 2 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 21:36:14,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:36:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:36:14,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-29 21:36:14,255 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 21:36:14,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 21:36:14,256 INFO L85 PathProgramCache]: Analyzing trace with hash -718008576, now seen corresponding path program 1 times [2022-09-29 21:36:14,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 21:36:14,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426162852] [2022-09-29 21:36:14,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 21:36:14,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 21:36:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 21:36:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 21:36:15,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 21:36:15,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426162852] [2022-09-29 21:36:15,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426162852] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 21:36:15,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 21:36:15,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-29 21:36:15,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951909991] [2022-09-29 21:36:15,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 21:36:15,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-09-29 21:36:15,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 21:36:15,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-09-29 21:36:15,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-09-29 21:36:15,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:36:15,075 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 21:36:15,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 39.916666666666664) internal successors, (479), 13 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 21:36:15,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:36:15,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:36:19,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 21:36:19,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-09-29 21:36:19,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-29 21:36:19,342 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 21:36:19,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 21:36:19,344 INFO L85 PathProgramCache]: Analyzing trace with hash 763718291, now seen corresponding path program 1 times [2022-09-29 21:36:19,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 21:36:19,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850195433] [2022-09-29 21:36:19,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 21:36:19,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 21:36:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 21:36:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 51373 backedges. 5127 proven. 19457 refuted. 0 times theorem prover too weak. 26789 trivial. 0 not checked. [2022-09-29 21:36:40,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 21:36:40,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850195433] [2022-09-29 21:36:40,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850195433] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 21:36:40,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676190581] [2022-09-29 21:36:40,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 21:36:40,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 21:36:40,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 21:36:40,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-29 21:36:40,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-09-29 21:36:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 21:36:43,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 18536 conjuncts, 205 conjunts are in the unsatisfiable core [2022-09-29 21:36:43,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 21:37:14,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-29 21:37:14,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-29 21:37:35,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-29 21:37:35,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-29 21:37:43,325 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 231 treesize of output 199 [2022-09-29 21:37:43,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 21:37:43,357 INFO L356 Elim1Store]: treesize reduction 25, result has 35.9 percent of original size [2022-09-29 21:37:43,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 290 treesize of output 246 [2022-09-29 21:37:43,378 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 153 treesize of output 145 [2022-09-29 21:37:43,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 21:37:43,389 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 201 treesize of output 177 [2022-09-29 21:37:43,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 21:37:43,437 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 118 treesize of output 112 [2022-09-29 21:37:43,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 21:37:43,473 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-29 21:37:43,474 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2022-09-29 21:37:43,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-29 21:37:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 51373 backedges. 5198 proven. 19346 refuted. 0 times theorem prover too weak. 26829 trivial. 0 not checked. [2022-09-29 21:37:44,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-29 21:37:44,769 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 10 treesize of output 8 [2022-09-29 21:38:23,900 INFO L356 Elim1Store]: treesize reduction 23, result has 65.2 percent of original size [2022-09-29 21:38:23,901 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 2 case distinctions, treesize of input 151 treesize of output 165 [2022-09-29 21:38:23,913 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 21:38:23,913 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 1 case distinctions, treesize of input 20 treesize of output 16 [2022-09-29 21:38:56,717 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1185 Int) (v_ArrVal_1183 (Array Int Int))) (or (let ((.cse1 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| v_ArrVal_1185)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1183) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (not (<= |c_ULTIMATE.start_write~$Pointer$_#value#1.offset| v_ArrVal_1185)))) (forall ((v_ArrVal_1190 Int) (v_ArrVal_1191 Int)) (let ((.cse2 (select (select (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| v_ArrVal_1191)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse2) (let ((.cse3 (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_1190)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse3 .cse2) .cse4) (+ .cse4 13)))))))) is different from false [2022-09-29 21:38:56,771 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1185 Int) (v_ArrVal_1183 (Array Int Int))) (or (let ((.cse1 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_1185)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ 12 .cse0) (select (select .cse1 (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_1183) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_1185 (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4)))) (forall ((v_ArrVal_1190 Int) (v_ArrVal_1191 Int)) (let ((.cse2 (select (select (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| v_ArrVal_1191)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse2) (let ((.cse3 (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_1190)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse3 .cse2) .cse4) (+ .cse4 13)))))))) is different from false [2022-09-29 21:38:56,799 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1185 Int) (v_ArrVal_1183 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_1185)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_1183) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_1185 (+ |c_ULTIMATE.start_fifo_pop_#t~mem41#1.offset| 4)))) (forall ((v_ArrVal_1190 Int) (v_ArrVal_1191 Int)) (let ((.cse2 (select (select (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| v_ArrVal_1191)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse2) (let ((.cse3 (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_1190)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse3 .cse2) .cse4) (+ .cse4 13)))))))) is different from false [2022-09-29 21:38:56,864 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1185 Int) (v_ArrVal_1183 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_1185)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_1183) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_1185 (+ |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4)))) (forall ((v_ArrVal_1190 Int) (v_ArrVal_1191 Int)) (let ((.cse2 (select (select (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| v_ArrVal_1191)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse2) (let ((.cse3 (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_1190)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse3 .cse2) .cse4) (+ .cse4 13)))))))) is different from false [2022-09-29 21:38:56,887 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1185 Int) (v_ArrVal_1183 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|) |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_1185)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_1183) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_1185 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|) 4)))) (forall ((v_ArrVal_1190 Int) (v_ArrVal_1191 Int)) (let ((.cse2 (select (select (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| v_ArrVal_1191)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse2) (let ((.cse3 (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_1190)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse3 .cse2) .cse4) (+ .cse4 13)))))))) is different from false [2022-09-29 21:38:56,954 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1185 Int) (v_ArrVal_1183 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base|))) (or (< v_ArrVal_1185 (+ (select .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset|) 4)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| (store .cse0 |c_ULTIMATE.start_fifo_pop_#t~mem40#1.offset| v_ArrVal_1185)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse1 12) (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_#t~mem40#1.base| v_ArrVal_1183) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse1))))))) (forall ((v_ArrVal_1190 Int) (v_ArrVal_1191 Int)) (let ((.cse3 (select (select (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| v_ArrVal_1191)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse3) (let ((.cse4 (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_1190)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse4 .cse3) .cse5) (+ .cse5 13)))))))) is different from false [2022-09-29 21:38:57,008 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1185 Int) (v_ArrVal_1183 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|))) (or (< v_ArrVal_1185 (+ (select .cse0 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset|) 4)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (store .cse0 |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| v_ArrVal_1185)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse1 12) (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_1183) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse1))))))) (forall ((v_ArrVal_1190 Int) (v_ArrVal_1191 Int)) (let ((.cse3 (select (select (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| v_ArrVal_1191)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse3) (let ((.cse4 (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_1190)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse4 .cse3) .cse5) (+ .cse5 13)))))))) is different from false [2022-09-29 21:38:57,031 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1185 Int) (v_ArrVal_1183 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 (store .cse3 .cse4 v_ArrVal_1185)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse0 12) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1183) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse0)))) (< v_ArrVal_1185 (+ (select .cse3 .cse4) 4)))))) (forall ((v_ArrVal_1190 Int) (v_ArrVal_1191 Int)) (let ((.cse5 (select (select (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| v_ArrVal_1191)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse5) (let ((.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| v_ArrVal_1190)))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse6 .cse5) .cse7) (+ .cse7 13)))))))) is different from false [2022-09-29 21:38:57,102 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1185 Int) (v_ArrVal_1183 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< v_ArrVal_1185 (+ (select .cse0 .cse1) 4)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse0 .cse1 v_ArrVal_1185)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse2 12) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1183) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse2)))))))) (forall ((v_ArrVal_1190 Int) (v_ArrVal_1191 Int)) (let ((.cse5 (select (select (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| v_ArrVal_1191)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse5) (let ((.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| v_ArrVal_1190)))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse6 .cse5) .cse7) (+ .cse7 13)))))))) is different from false [2022-09-29 21:38:58,224 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1185 Int) (v_ArrVal_1183 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< v_ArrVal_1185 (+ (select .cse0 .cse1) 4)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse0 .cse1 v_ArrVal_1185)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse2 12) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1183) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse2)))))))) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_39| Int) (v_ArrVal_1190 Int) (v_ArrVal_1191 Int)) (let ((.cse6 (select (select (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_39| v_ArrVal_1191)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (let ((.cse5 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_39| v_ArrVal_1190)))) (let ((.cse7 (select (select .cse5 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse5 .cse6) .cse7) (+ .cse7 13)))) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse6) (not (<= (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_39|)))))) is different from false [2022-09-29 21:38:58,271 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1185 Int) (v_ArrVal_1183 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (< v_ArrVal_1185 (+ (select .cse0 .cse1) 4)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse0 .cse1 v_ArrVal_1185)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (+ .cse2 12) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1183) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|)) .cse2)))))))) (forall ((|v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_39| Int) (v_ArrVal_1190 Int) (v_ArrVal_1191 Int)) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_39| v_ArrVal_1191)) |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (or (not (<= (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_39|)) (= |c_ULTIMATE.start_fifo_pop_~self#1.base| .cse5) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) |v_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.offset_39| v_ArrVal_1190)))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_fifo_pop_~self#1.base|) |c_ULTIMATE.start_fifo_pop_~self#1.offset|))) (< (select (select .cse6 .cse5) .cse7) (+ .cse7 13)))))))) is different from false [2022-09-29 21:38:58,684 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 21:38:58,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1629 treesize of output 1563 [2022-09-29 21:38:59,730 INFO L356 Elim1Store]: treesize reduction 94, result has 64.5 percent of original size [2022-09-29 21:38:59,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62365 treesize of output 53587 [2022-09-29 21:39:01,814 INFO L356 Elim1Store]: treesize reduction 191, result has 65.3 percent of original size [2022-09-29 21:39:01,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 45 case distinctions, treesize of input 68825 treesize of output 59573 [2022-09-29 21:39:04,930 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 59297 treesize of output 56893 [2022-09-29 21:39:06,232 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 36102 treesize of output 34270 [2022-09-29 21:42:54,293 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 21:42:54,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 363 treesize of output 384 [2022-09-29 21:43:11,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2022-09-29 21:43:11,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-09-29 21:43:12,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-09-29 21:43:13,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 21:43:13,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 24 treesize of output 20 [2022-09-29 21:43:13,399 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 21:43:13,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 405 treesize of output 409 [2022-09-29 21:43:22,442 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 21:43:22,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 402 treesize of output 421 [2022-09-29 21:43:57,976 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 21 treesize of output 12 [2022-09-29 21:44:05,873 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 21:44:05,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 143 treesize of output 147 [2022-09-29 21:44:11,377 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 21 treesize of output 12 [2022-09-29 21:44:16,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2022-09-29 21:44:17,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2022-09-29 21:44:17,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2022-09-29 21:44:18,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 12 [2022-09-29 21:44:19,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2022-09-29 21:44:19,773 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-09-29 21:44:19,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 143 treesize of output 132 [2022-09-29 21:44:21,000 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 21:44:21,000 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 391 treesize of output 386 [2022-09-29 21:44:28,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 21:44:28,491 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 1 case distinctions, treesize of input 322 treesize of output 322 [2022-09-29 21:44:36,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 12 [2022-09-29 21:44:37,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 12 [2022-09-29 21:44:39,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 12 [2022-09-29 21:44:40,066 INFO L356 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2022-09-29 21:44:40,067 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 1 case distinctions, treesize of input 198 treesize of output 191 [2022-09-29 21:44:44,134 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 21:44:44,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 145 [2022-09-29 21:44:45,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 5 Received shutdown request... [2022-09-29 21:49:53,940 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-09-29 21:49:53,944 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-29 21:49:53,959 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-29 21:49:53,959 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-29 21:49:53,959 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-29 21:49:53,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-09-29 21:49:54,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-09-29 21:49:54,151 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 7473 with TraceHistMax 19,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 11 for 8ms.. [2022-09-29 21:49:54,155 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-09-29 21:49:54,157 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-09-29 21:49:54,160 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-29 21:49:54,160 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-29 21:49:54,165 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line1188.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.09 09:49:54 BasicIcfg [2022-09-29 21:49:54,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-29 21:49:54,168 INFO L158 Benchmark]: Toolchain (without parser) took 822721.00ms. Allocated memory was 190.8MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 136.3MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. [2022-09-29 21:49:54,169 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 190.8MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 21:49:54,169 INFO L158 Benchmark]: Boogie Preprocessor took 158.37ms. Allocated memory is still 190.8MB. Free memory was 136.3MB in the beginning and 158.5MB in the end (delta: -22.2MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. [2022-09-29 21:49:54,169 INFO L158 Benchmark]: RCFGBuilder took 1289.52ms. Allocated memory was 190.8MB in the beginning and 251.7MB in the end (delta: 60.8MB). Free memory was 158.4MB in the beginning and 148.0MB in the end (delta: 10.5MB). Peak memory consumption was 74.0MB. Max. memory is 8.0GB. [2022-09-29 21:49:54,169 INFO L158 Benchmark]: TraceAbstraction took 821268.57ms. Allocated memory was 251.7MB in the beginning and 5.7GB in the end (delta: 5.4GB). Free memory was 147.4MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 5.0GB. Max. memory is 8.0GB. [2022-09-29 21:49:54,170 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.19ms. Allocated memory is still 190.8MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 158.37ms. Allocated memory is still 190.8MB. Free memory was 136.3MB in the beginning and 158.5MB in the end (delta: -22.2MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1289.52ms. Allocated memory was 190.8MB in the beginning and 251.7MB in the end (delta: 60.8MB). Free memory was 158.4MB in the beginning and 148.0MB in the end (delta: 10.5MB). Peak memory consumption was 74.0MB. Max. memory is 8.0GB. * TraceAbstraction took 821268.57ms. Allocated memory was 251.7MB in the beginning and 5.7GB in the end (delta: 5.4GB). Free memory was 147.4MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 5.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 198, positive: 187, positive conditional: 187, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43069, positive: 41643, positive conditional: 41643, positive unconditional: 0, negative: 1426, negative conditional: 1426, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41759, positive: 41643, positive conditional: 0, positive unconditional: 41643, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 23280, positive: 23199, positive conditional: 0, positive unconditional: 23199, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 41759, positive: 18444, positive conditional: 0, positive unconditional: 18444, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 23280, unknown conditional: 0, unknown unconditional: 23280] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 187, Positive conditional cache size: 0, Positive unconditional cache size: 187, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 11, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 828, positive: 801, positive conditional: 801, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43069, positive: 41643, positive conditional: 41643, positive unconditional: 0, negative: 1426, negative conditional: 1426, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41759, positive: 41643, positive conditional: 0, positive unconditional: 41643, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 23280, positive: 23199, positive conditional: 0, positive unconditional: 23199, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 41759, positive: 18444, positive conditional: 0, positive unconditional: 18444, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 23280, unknown conditional: 0, unknown unconditional: 23280] , Statistics on independence cache: Total cache size (in pairs): 801, Positive cache size: 801, Positive conditional cache size: 0, Positive unconditional cache size: 801, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 38, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 42043, positive: 40655, positive conditional: 40655, positive unconditional: 0, negative: 1388, negative conditional: 1388, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43069, positive: 41643, positive conditional: 41643, positive unconditional: 0, negative: 1426, negative conditional: 1426, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41759, positive: 41643, positive conditional: 0, positive unconditional: 41643, negative: 116, negative conditional: 0, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 23280, positive: 23199, positive conditional: 0, positive unconditional: 23199, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 41759, positive: 18444, positive conditional: 0, positive unconditional: 18444, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 23280, unknown conditional: 0, unknown unconditional: 23280] , Statistics on independence cache: Total cache size (in pairs): 23280, Positive cache size: 23199, Positive conditional cache size: 0, Positive unconditional cache size: 23199, Negative cache size: 81, Negative conditional cache size: 0, Negative unconditional cache size: 81, Independence queries for same thread: 1310, Statistics for Abstraction: - TimeoutResultAtElement [Line: 1188]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 7473 with TraceHistMax 19,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 11 for 8ms.. - 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: 821.1s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 4.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 20, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 891 NumberOfCodeBlocks, 891 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 889 ConstructedInterpolants, 0 QuantifiedInterpolants, 3284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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