/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.line471.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 15:06:22,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 15:06:22,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 15:06:22,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 15:06:22,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 15:06:22,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 15:06:22,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 15:06:22,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 15:06:22,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 15:06:22,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 15:06:22,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 15:06:22,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 15:06:22,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 15:06:22,279 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 15:06:22,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 15:06:22,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 15:06:22,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 15:06:22,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 15:06:22,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 15:06:22,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 15:06:22,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 15:06:22,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 15:06:22,298 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 15:06:22,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 15:06:22,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 15:06:22,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 15:06:22,306 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 15:06:22,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 15:06:22,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 15:06:22,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 15:06:22,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 15:06:22,309 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 15:06:22,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 15:06:22,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 15:06:22,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 15:06:22,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 15:06:22,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 15:06:22,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 15:06:22,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 15:06:22,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 15:06:22,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 15:06:22,315 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 15:06:22,344 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 15:06:22,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 15:06:22,345 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 15:06:22,345 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 15:06:22,346 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 15:06:22,346 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 15:06:22,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 15:06:22,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 15:06:22,347 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 15:06:22,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 15:06:22,348 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 15:06:22,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 15:06:22,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 15:06:22,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 15:06:22,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 15:06:22,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 15:06:22,348 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 15:06:22,349 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 15:06:22,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 15:06:22,349 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 15:06:22,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 15:06:22,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 15:06:22,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 15:06:22,350 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 15:06:22,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 15:06:22,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:06:22,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 15:06:22,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 15:06:22,351 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 15:06:22,351 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 15:06:22,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 15:06:22,351 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 15:06:22,352 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 15:06:22,352 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 15:06:22,352 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 15:06:22,352 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 15:06:22,352 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 15:06:22,352 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 15:06:22,352 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 15:06:22,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 15:06:22,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 15:06:22,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 15:06:22,547 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 15:06:22,548 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 15:06:22,549 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.line471.bpl [2022-10-03 15:06:22,550 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo-bug_1w1r.line471.bpl' [2022-10-03 15:06:22,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 15:06:22,627 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 15:06:22,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 15:06:22,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 15:06:22,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 15:06:22,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:06:22" (1/1) ... [2022-10-03 15:06:22,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:06:22" (1/1) ... [2022-10-03 15:06:22,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:06:22" (1/1) ... [2022-10-03 15:06:22,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:06:22" (1/1) ... [2022-10-03 15:06:22,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:06:22" (1/1) ... [2022-10-03 15:06:22,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:06:22" (1/1) ... [2022-10-03 15:06:22,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo-bug_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:06:22" (1/1) ... [2022-10-03 15:06:22,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 15:06:22,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 15:06:22,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 15:06:22,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 15:06:22,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:06:22" (1/1) ... [2022-10-03 15:06:22,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 15:06:22,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:06:22,830 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 15:06:22,840 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 15:06:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-10-03 15:06:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-10-03 15:06:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 15:06:22,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 15:06:22,878 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 15:06:23,061 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 15:06:23,062 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 15:06:24,034 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 15:06:24,066 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 15:06:24,066 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-03 15:06:24,070 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:06:24 BoogieIcfgContainer [2022-10-03 15:06:24,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 15:06:24,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 15:06:24,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 15:06:24,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 15:06:24,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 03:06:22" (1/2) ... [2022-10-03 15:06:24,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77af20e7 and model type divinefifo-bug_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:06:24, skipping insertion in model container [2022-10-03 15:06:24,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:06:24" (2/2) ... [2022-10-03 15:06:24,080 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line471.bpl [2022-10-03 15:06:24,087 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 15:06:24,096 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 15:06:24,096 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 15:06:24,096 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 15:06:24,245 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-03 15:06:24,318 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:06:24,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:06:24,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:06:24,324 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 15:06:24,325 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 15:06:24,353 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:06:24,360 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == pusherErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:06:24,366 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;@33408a96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:06:24,366 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:06:24,369 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-03 15:06:24,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location pusherErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 15:06:24,375 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-03 15:06:24,377 INFO L307 ceAbstractionStarter]: Result for error location pusherErr0ASSERT_VIOLATIONASSERT was SAFE (1/3) [2022-10-03 15:06:24,390 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:06:24,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:06:24,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:06:24,396 INFO L229 MonitoredProcess]: Starting monitored process 3 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 15:06:24,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-10-03 15:06:24,403 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:06:24,404 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-03 15:06:24,405 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;@33408a96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:06:24,405 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:06:24,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-03 15:06:24,482 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-03 15:06:24,483 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/3) [2022-10-03 15:06:24,495 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 15:06:24,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 15:06:24,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:06:24,535 INFO L229 MonitoredProcess]: Starting monitored process 4 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 15:06:24,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-10-03 15:06:24,541 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 15:06:24,542 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == pusherErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 15:06:24,543 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;@33408a96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 15:06:24,543 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 15:06:24,836 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:06:24,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:06:24,844 INFO L85 PathProgramCache]: Analyzing trace with hash -363638362, now seen corresponding path program 1 times [2022-10-03 15:06:24,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:06:24,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137967835] [2022-10-03 15:06:24,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:06:24,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:06:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:06:25,280 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 15:06:25,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:06:25,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137967835] [2022-10-03 15:06:25,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137967835] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:06:25,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:06:25,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 15:06:25,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432297528] [2022-10-03 15:06:25,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:06:25,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 15:06:25,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:06:25,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 15:06:25,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 15:06:25,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:06:25,329 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:06:25,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 192.5) internal successors, (385), 2 states have internal predecessors, (385), 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 15:06:25,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:06:25,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:06:25,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 15:06:25,386 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:06:25,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:06:25,386 INFO L85 PathProgramCache]: Analyzing trace with hash 486382358, now seen corresponding path program 1 times [2022-10-03 15:06:25,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:06:25,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670910524] [2022-10-03 15:06:25,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:06:25,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:06:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:06:25,739 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 15:06:25,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:06:25,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670910524] [2022-10-03 15:06:25,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670910524] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:06:25,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 15:06:25,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-03 15:06:25,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178495652] [2022-10-03 15:06:25,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:06:25,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-03 15:06:25,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:06:25,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-03 15:06:25,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-03 15:06:25,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:06:25,742 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:06:25,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 76.8) internal successors, (384), 6 states have internal predecessors, (384), 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 15:06:25,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:06:25,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:06:30,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:06:30,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 15:06:30,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 15:06:30,382 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:06:30,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:06:30,383 INFO L85 PathProgramCache]: Analyzing trace with hash 171236868, now seen corresponding path program 1 times [2022-10-03 15:06:30,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:06:30,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856999862] [2022-10-03 15:06:30,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:06:30,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:06:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:06:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 15095 backedges. 0 proven. 7623 refuted. 0 times theorem prover too weak. 7472 trivial. 0 not checked. [2022-10-03 15:06:35,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:06:35,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856999862] [2022-10-03 15:06:35,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856999862] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:06:35,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459579028] [2022-10-03 15:06:35,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:06:35,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:06:35,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:06:35,289 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 15:06:35,290 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 15:06:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:06:37,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 10116 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-03 15:06:37,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:06:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 15095 backedges. 11208 proven. 0 refuted. 0 times theorem prover too weak. 3887 trivial. 0 not checked. [2022-10-03 15:06:39,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-03 15:06:39,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459579028] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 15:06:39,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-03 15:06:39,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2022-10-03 15:06:39,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4028914] [2022-10-03 15:06:39,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 15:06:39,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-03 15:06:39,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 15:06:39,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-03 15:06:39,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2022-10-03 15:06:39,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:06:39,313 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 15:06:39,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 237.8) internal successors, (2378), 10 states have internal predecessors, (2378), 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 15:06:39,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:06:39,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-03 15:06:39,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:06:40,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 15:06:40,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 15:06:40,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-03 15:06:40,556 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 15:06:40,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:06:40,736 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 15:06:40,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 15:06:40,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1465885582, now seen corresponding path program 1 times [2022-10-03 15:06:40,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 15:06:40,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318490557] [2022-10-03 15:06:40,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:06:40,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 15:06:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:07:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3285 backedges. 1131 proven. 1853 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-10-03 15:07:12,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 15:07:12,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318490557] [2022-10-03 15:07:12,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318490557] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 15:07:12,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282749431] [2022-10-03 15:07:12,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 15:07:12,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 15:07:12,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 15:07:12,812 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-03 15:07:12,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-03 15:07:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 15:07:13,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 4386 conjuncts, 353 conjunts are in the unsatisfiable core [2022-10-03 15:07:13,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 15:07:17,358 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 15:07:17,369 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 15:07:19,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:07:19,667 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 15:07:19,690 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 15:07:20,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:07:20,449 INFO L356 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2022-10-03 15:07:20,450 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 1 case distinctions, treesize of input 34 treesize of output 36 [2022-10-03 15:07:20,469 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-03 15:07:20,470 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 21 treesize of output 20 [2022-10-03 15:07:21,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:07:21,103 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 21 treesize of output 20 [2022-10-03 15:07:21,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:07:21,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:07:21,112 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 32 treesize of output 34 [2022-10-03 15:07:22,963 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-10-03 15:07:22,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2022-10-03 15:07:22,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:07:22,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2022-10-03 15:07:22,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:07:22,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:07:22,998 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-03 15:07:22,999 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 2 case distinctions, treesize of input 37 treesize of output 35 [2022-10-03 15:07:24,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:07:24,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-10-03 15:07:24,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-03 15:07:25,996 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 20 treesize of output 8 [2022-10-03 15:07:26,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:07:26,982 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 15:07:26,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 34 [2022-10-03 15:07:26,999 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 15:07:27,667 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 15:07:27,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 15:07:27,678 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 27 treesize of output 26 [2022-10-03 15:07:28,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 15:07:28,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 14 [2022-10-03 15:07:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3285 backedges. 1801 proven. 58 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2022-10-03 15:07:30,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 15:07:32,407 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 124 treesize of output 118 [2022-10-03 15:08:17,456 WARN L833 $PredicateComparison]: unable to prove that (and (not (let ((.cse1 (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|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (let ((.cse0 (+ 12 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))))) (<= .cse0 (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse0))))) (or (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((v_arrayElimCell_20 Int)) (not (let ((.cse3 (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|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (let ((.cse2 (+ 12 (select (select .cse3 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))))) (<= .cse2 (select (select .cse3 v_arrayElimCell_20) .cse2)))))))) is different from false [2022-10-03 15:08:17,494 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2241 (Array Int Int))) (not (let ((.cse1 (let ((.cse2 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2241))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse0 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse0 (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse0)))))) (or (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((v_ArrVal_2241 (Array Int Int)) (v_arrayElimCell_20 Int)) (not (let ((.cse4 (let ((.cse5 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2241))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse3 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse3 (select (select .cse4 v_arrayElimCell_20) .cse3)))))))) is different from false [2022-10-03 15:08:17,541 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2241 (Array Int Int))) (not (let ((.cse1 (let ((.cse2 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_2241))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse0 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse0 (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse0)))))) (or (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((v_ArrVal_2241 (Array Int Int)) (v_arrayElimCell_20 Int)) (not (let ((.cse4 (let ((.cse5 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_2241))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse3 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse3 (select (select .cse4 v_arrayElimCell_20) .cse3)))))))) is different from false [2022-10-03 15:08:17,563 WARN L833 $PredicateComparison]: unable to prove that (and (or (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((v_ArrVal_2241 (Array Int Int)) (v_arrayElimCell_20 Int)) (not (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_2241))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse0 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse0 (select (select .cse1 v_arrayElimCell_20) .cse0))))))) (forall ((v_ArrVal_2241 (Array Int Int))) (not (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_2241))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse3 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse3 (select (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse3))))))) is different from false [2022-10-03 15:08:17,585 WARN L833 $PredicateComparison]: unable to prove that (and (or (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((v_ArrVal_2241 (Array Int Int)) (v_arrayElimCell_20 Int)) (not (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base| v_ArrVal_2241))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse0 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse0 (select (select .cse1 v_arrayElimCell_20) .cse0))))))) (forall ((v_ArrVal_2241 (Array Int Int))) (not (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base| v_ArrVal_2241))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse3 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse3 (select (select .cse4 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse3))))))) is different from false [2022-10-03 15:08:17,601 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2241 (Array Int Int))) (not (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.offset|) v_ArrVal_2241))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse0 (+ 12 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))))) (<= .cse0 (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse0)))))) (or (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((v_ArrVal_2241 (Array Int Int)) (v_arrayElimCell_20 Int)) (not (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.base|) |c_pusherThread1of1ForFork0_read~$Pointer$_#ptr#1.offset|) v_ArrVal_2241))) (store .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse3 (+ 12 (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))))) (<= .cse3 (select (select .cse4 v_arrayElimCell_20) .cse3)))))))) is different from false [2022-10-03 15:08:17,655 WARN L833 $PredicateComparison]: unable to prove that (and (or (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((v_ArrVal_2241 (Array Int Int)) (v_arrayElimCell_20 Int)) (not (let ((.cse1 (let ((.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3) v_ArrVal_2241))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (let ((.cse0 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse0 (select (select .cse1 v_arrayElimCell_20) .cse0))))))) (forall ((v_ArrVal_2241 (Array Int Int))) (not (let ((.cse5 (let ((.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) v_ArrVal_2241))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (let ((.cse4 (+ (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse4 (select (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse4))))))) is different from false [2022-10-03 15:08:18,828 WARN L833 $PredicateComparison]: unable to prove that (or (and (or (and (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((v_ArrVal_2241 (Array Int Int)) (v_arrayElimCell_20 Int)) (not (let ((.cse1 (let ((.cse3 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3) v_ArrVal_2241))) (store .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse2 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse3 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (let ((.cse0 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse0 (select (select .cse1 v_arrayElimCell_20) .cse0))))))) (forall ((v_ArrVal_2241 (Array Int Int))) (not (let ((.cse5 (let ((.cse7 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7) v_ArrVal_2241))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse7 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (let ((.cse4 (+ (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse4 (select (select .cse5 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse4))))))) (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8))))) is different from false [2022-10-03 15:08:51,911 WARN L233 SmtUtils]: Spent 14.53s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:09:34,943 WARN L233 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:12:56,243 WARN L233 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:14:04,600 WARN L233 SmtUtils]: Spent 11.64s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 15:15:06,486 WARN L233 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-10-03 15:20:25,502 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 15:20:25,502 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:20:25,502 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 15:20:25,502 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:20:25,502 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 15:20:26,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2022-10-03 15:20:26,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2022-10-03 15:20:26,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-10-03 15:20:26,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-03 15:20:26,703 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-10-03 15:20:26,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-10-03 15:20:26,756 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location pusherErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 15:20:26,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-03 15:20:26,756 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 1581 with TraceHistMax 7,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2022-10-03 15:20:26,758 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-10-03 15:20:26,758 INFO L307 ceAbstractionStarter]: Result for error location pusherErr0ASSERT_VIOLATIONASSERT was TIMEOUT (3/3) [2022-10-03 15:20:26,761 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 15:20:26,761 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 15:20:26,764 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:20:26 BasicIcfg [2022-10-03 15:20:26,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 15:20:26,765 INFO L158 Benchmark]: Toolchain (without parser) took 844137.29ms. Allocated memory was 176.2MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 123.7MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-10-03 15:20:26,765 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 15:20:26,765 INFO L158 Benchmark]: Boogie Preprocessor took 140.96ms. Allocated memory is still 176.2MB. Free memory was 123.6MB in the beginning and 117.2MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-03 15:20:26,766 INFO L158 Benchmark]: RCFGBuilder took 1283.14ms. Allocated memory was 176.2MB in the beginning and 262.1MB in the end (delta: 86.0MB). Free memory was 144.9MB in the beginning and 216.4MB in the end (delta: -71.5MB). Peak memory consumption was 64.4MB. Max. memory is 8.0GB. [2022-10-03 15:20:26,766 INFO L158 Benchmark]: TraceAbstraction took 842692.41ms. Allocated memory was 262.1MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 215.9MB in the beginning and 3.5GB in the end (delta: -3.3GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-10-03 15:20:26,767 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 140.96ms. Allocated memory is still 176.2MB. Free memory was 123.6MB in the beginning and 117.2MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1283.14ms. Allocated memory was 176.2MB in the beginning and 262.1MB in the end (delta: 86.0MB). Free memory was 144.9MB in the beginning and 216.4MB in the end (delta: -71.5MB). Peak memory consumption was 64.4MB. Max. memory is 8.0GB. * TraceAbstraction took 842692.41ms. Allocated memory was 262.1MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 215.9MB in the beginning and 3.5GB in the end (delta: -3.3GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 2, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 163, positive: 156, positive conditional: 156, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 98095, positive: 95070, positive conditional: 95070, positive unconditional: 0, negative: 3025, negative conditional: 3025, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95399, positive: 95070, positive conditional: 0, positive unconditional: 95070, negative: 329, negative conditional: 0, negative unconditional: 329, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 43245, positive: 43081, positive conditional: 0, positive unconditional: 43081, negative: 164, negative conditional: 0, negative unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 95399, positive: 51989, positive conditional: 0, positive unconditional: 51989, negative: 165, negative conditional: 0, negative unconditional: 165, unknown: 43245, unknown conditional: 0, unknown unconditional: 43245] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 156, Positive conditional cache size: 0, Positive unconditional cache size: 156, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 7, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 161, positive: 156, positive conditional: 156, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 98095, positive: 95070, positive conditional: 95070, positive unconditional: 0, negative: 3025, negative conditional: 3025, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95399, positive: 95070, positive conditional: 0, positive unconditional: 95070, negative: 329, negative conditional: 0, negative unconditional: 329, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 43245, positive: 43081, positive conditional: 0, positive unconditional: 43081, negative: 164, negative conditional: 0, negative unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 95399, positive: 51989, positive conditional: 0, positive unconditional: 51989, negative: 165, negative conditional: 0, negative unconditional: 165, unknown: 43245, unknown conditional: 0, unknown unconditional: 43245] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 156, Positive conditional cache size: 0, Positive unconditional cache size: 156, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 12, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 68537, positive: 66429, positive conditional: 66429, positive unconditional: 0, negative: 2108, negative conditional: 2108, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 98095, positive: 95070, positive conditional: 95070, positive unconditional: 0, negative: 3025, negative conditional: 3025, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95399, positive: 95070, positive conditional: 0, positive unconditional: 95070, negative: 329, negative conditional: 0, negative unconditional: 329, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 43245, positive: 43081, positive conditional: 0, positive unconditional: 43081, negative: 164, negative conditional: 0, negative unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 95399, positive: 51989, positive conditional: 0, positive unconditional: 51989, negative: 165, negative conditional: 0, negative unconditional: 165, unknown: 43245, unknown conditional: 0, unknown unconditional: 43245] , Statistics on independence cache: Total cache size (in pairs): 34792, Positive cache size: 34687, Positive conditional cache size: 0, Positive unconditional cache size: 34687, Negative cache size: 105, Negative conditional cache size: 0, Negative unconditional cache size: 105, Independence queries for same thread: 1991, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 29234, positive: 28329, positive conditional: 28329, positive unconditional: 0, negative: 905, negative conditional: 905, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 98095, positive: 95070, positive conditional: 95070, positive unconditional: 0, negative: 3025, negative conditional: 3025, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95399, positive: 95070, positive conditional: 0, positive unconditional: 95070, negative: 329, negative conditional: 0, negative unconditional: 329, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 43245, positive: 43081, positive conditional: 0, positive unconditional: 43081, negative: 164, negative conditional: 0, negative unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 95399, positive: 51989, positive conditional: 0, positive unconditional: 51989, negative: 165, negative conditional: 0, negative unconditional: 165, unknown: 43245, unknown conditional: 0, unknown unconditional: 43245] , Statistics on independence cache: Total cache size (in pairs): 43245, Positive cache size: 43081, Positive conditional cache size: 0, Positive unconditional cache size: 43081, Negative cache size: 164, Negative conditional cache size: 0, Negative unconditional cache size: 164, Independence queries for same thread: 2696, Statistics for Abstraction: - TimeoutResultAtElement [Line: 471]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 1581 with TraceHistMax 7,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for error location: pusherErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 1465 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: pusherErr0ASSERT_VIOLATIONASSERT with 2 thread instances CFG has 3 procedures, 1465 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 842.2s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 6.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: 21, 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.5s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 8243 NumberOfCodeBlocks, 8243 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 8239 ConstructedInterpolants, 0 QuantifiedInterpolants, 18909 SizeOfPredicates, 0 NumberOfNonLiveVariables, 10116 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 22567/30190 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 3 procedures, 1465 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.1s, 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: 0, 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: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown