/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_1w1r.line437.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-09-29 23:03:15,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 23:03:15,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 23:03:15,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 23:03:15,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 23:03:15,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 23:03:15,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 23:03:15,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 23:03:15,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 23:03:15,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 23:03:15,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 23:03:15,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 23:03:15,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 23:03:15,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 23:03:15,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 23:03:15,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 23:03:15,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 23:03:15,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 23:03:15,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 23:03:15,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 23:03:15,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 23:03:15,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 23:03:15,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 23:03:15,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 23:03:15,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 23:03:15,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 23:03:15,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 23:03:15,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 23:03:15,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 23:03:15,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 23:03:15,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 23:03:15,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 23:03:15,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 23:03:15,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 23:03:15,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 23:03:15,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 23:03:15,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 23:03:15,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 23:03:15,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 23:03:15,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 23:03:15,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 23:03:15,261 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-09-29 23:03:15,279 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 23:03:15,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 23:03:15,279 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 23:03:15,279 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 23:03:15,280 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-29 23:03:15,280 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-29 23:03:15,280 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 23:03:15,280 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 23:03:15,280 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 23:03:15,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 23:03:15,281 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 23:03:15,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 23:03:15,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 23:03:15,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 23:03:15,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-29 23:03:15,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-29 23:03:15,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-29 23:03:15,281 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 23:03:15,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 23:03:15,282 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 23:03:15,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-29 23:03:15,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 23:03:15,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 23:03:15,282 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-29 23:03:15,282 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-29 23:03:15,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-29 23:03:15,282 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 23:03:15,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-29 23:03:15,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-29 23:03:15,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 23:03:15,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-29 23:03:15,283 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-29 23:03:15,283 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-09-29 23:03:15,283 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-29 23:03:15,283 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-29 23:03:15,283 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-09-29 23:03:15,283 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-09-29 23:03:15,284 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-09-29 23:03:15,284 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 23:03:15,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 23:03:15,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 23:03:15,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 23:03:15,458 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 23:03:15,459 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 23:03:15,460 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_1w1r.line437.bpl [2022-09-29 23:03:15,460 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/divinefifo_1w1r.line437.bpl' [2022-09-29 23:03:15,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 23:03:15,528 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-09-29 23:03:15,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 23:03:15,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 23:03:15,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 23:03:15,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divinefifo_1w1r.line437.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 11:03:15" (1/1) ... [2022-09-29 23:03:15,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divinefifo_1w1r.line437.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 11:03:15" (1/1) ... [2022-09-29 23:03:15,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line437.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 11:03:15" (1/1) ... [2022-09-29 23:03:15,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divinefifo_1w1r.line437.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 11:03:15" (1/1) ... [2022-09-29 23:03:15,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divinefifo_1w1r.line437.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 11:03:15" (1/1) ... [2022-09-29 23:03:15,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divinefifo_1w1r.line437.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 11:03:15" (1/1) ... [2022-09-29 23:03:15,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divinefifo_1w1r.line437.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 11:03:15" (1/1) ... [2022-09-29 23:03:15,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 23:03:15,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 23:03:15,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 23:03:15,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 23:03:15,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo_1w1r.line437.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 11:03:15" (1/1) ... [2022-09-29 23:03:15,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-29 23:03:15,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 23:03:15,654 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 23:03:15,659 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 23:03:15,685 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-09-29 23:03:15,685 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-09-29 23:03:15,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 23:03:15,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 23:03:15,687 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 23:03:15,864 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 23:03:15,866 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 23:03:16,722 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 23:03:16,752 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 23:03:16,752 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-09-29 23:03:16,755 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line437.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 11:03:16 BoogieIcfgContainer [2022-09-29 23:03:16,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 23:03:16,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-29 23:03:16,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-29 23:03:16,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-29 23:03:16,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line437.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 11:03:15" (1/2) ... [2022-09-29 23:03:16,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae1a683 and model type divinefifo_1w1r.line437.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.09 11:03:16, skipping insertion in model container [2022-09-29 23:03:16,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo_1w1r.line437.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 11:03:16" (2/2) ... [2022-09-29 23:03:16,771 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.line437.bpl [2022-09-29 23:03:16,776 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-29 23:03:16,781 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-29 23:03:16,781 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-29 23:03:16,781 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-29 23:03:16,940 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-09-29 23:03:16,995 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-29 23:03:16,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-29 23:03:16,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 23:03:17,003 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 23:03:17,031 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 23:03:17,040 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-29 23:03:17,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == pusherErr0ASSERT_VIOLATIONASSERT ======== [2022-09-29 23:03:17,051 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;@37265c93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-29 23:03:17,051 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-29 23:03:17,053 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-09-29 23:03:17,055 INFO L805 garLoopResultBuilder]: Registering result SAFE for location pusherErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-29 23:03:17,058 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-29 23:03:17,059 INFO L307 ceAbstractionStarter]: Result for error location pusherErr0ASSERT_VIOLATIONASSERT was SAFE (1/3) [2022-09-29 23:03:17,070 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-29 23:03:17,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-29 23:03:17,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 23:03:17,085 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-09-29 23:03:17,085 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-09-29 23:03:17,114 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-29 23:03:17,114 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-09-29 23:03:17,116 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;@37265c93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-29 23:03:17,116 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-29 23:03:17,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-09-29 23:03:17,180 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-29 23:03:17,181 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/3) [2022-09-29 23:03:17,191 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-29 23:03:17,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-29 23:03:17,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 23:03:17,193 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-09-29 23:03:17,198 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-09-29 23:03:17,203 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-29 23:03:17,203 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == pusherErr0ASSERT_VIOLATIONASSERT ======== [2022-09-29 23:03:17,204 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;@37265c93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-29 23:03:17,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-29 23:03:17,409 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 23:03:17,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 23:03:17,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1511532441, now seen corresponding path program 1 times [2022-09-29 23:03:17,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 23:03:17,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873977259] [2022-09-29 23:03:17,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 23:03:17,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 23:03:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 23:03:17,803 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 23:03:17,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 23:03:17,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873977259] [2022-09-29 23:03:17,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873977259] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 23:03:17,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 23:03:17,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-29 23:03:17,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873999976] [2022-09-29 23:03:17,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 23:03:17,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-29 23:03:17,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 23:03:17,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-29 23:03:17,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-29 23:03:17,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:03:17,828 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 23:03:17,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 178.5) internal successors, (357), 2 states have internal predecessors, (357), 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 23:03:17,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:03:17,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:03:17,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-29 23:03:17,875 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 23:03:17,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 23:03:17,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1056322897, now seen corresponding path program 1 times [2022-09-29 23:03:17,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 23:03:17,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991058579] [2022-09-29 23:03:17,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 23:03:17,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 23:03:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 23:03:18,267 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 23:03:18,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 23:03:18,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991058579] [2022-09-29 23:03:18,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991058579] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 23:03:18,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 23:03:18,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-29 23:03:18,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844736284] [2022-09-29 23:03:18,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 23:03:18,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-29 23:03:18,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 23:03:18,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-29 23:03:18,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-09-29 23:03:18,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:03:18,270 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 23:03:18,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 50.857142857142854) internal successors, (356), 8 states have internal predecessors, (356), 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 23:03:18,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:03:18,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:03:22,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:03:22,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-29 23:03:22,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-29 23:03:22,254 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 23:03:22,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 23:03:22,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1946956672, now seen corresponding path program 1 times [2022-09-29 23:03:22,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 23:03:22,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441719376] [2022-09-29 23:03:22,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 23:03:22,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 23:03:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 23:03:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 27969 backedges. 25122 proven. 2687 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-09-29 23:03:28,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 23:03:28,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441719376] [2022-09-29 23:03:28,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441719376] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 23:03:28,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805075107] [2022-09-29 23:03:28,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 23:03:28,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 23:03:28,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 23:03:28,577 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-09-29 23:03:28,578 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-09-29 23:03:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 23:03:30,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 12546 conjuncts, 9 conjunts are in the unsatisfiable core [2022-09-29 23:03:30,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 23:03:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 27969 backedges. 17172 proven. 0 refuted. 0 times theorem prover too weak. 10797 trivial. 0 not checked. [2022-09-29 23:03:32,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-29 23:03:32,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805075107] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 23:03:32,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-29 23:03:32,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [21] total 22 [2022-09-29 23:03:32,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696764941] [2022-09-29 23:03:32,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 23:03:32,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-29 23:03:32,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 23:03:32,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-29 23:03:32,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2022-09-29 23:03:32,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:03:32,212 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 23:03:32,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 233.8) internal successors, (2338), 10 states have internal predecessors, (2338), 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 23:03:32,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:03:32,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-09-29 23:03:32,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:03:33,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 23:03:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-29 23:03:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-29 23:03:33,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-09-29 23:03:34,001 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-09-29 23:03:34,001 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 23:03:34,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 23:03:34,002 INFO L85 PathProgramCache]: Analyzing trace with hash 332718452, now seen corresponding path program 1 times [2022-09-29 23:03:34,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 23:03:34,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126502249] [2022-09-29 23:03:34,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 23:03:34,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 23:03:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 23:03:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3117 backedges. 1401 proven. 1071 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2022-09-29 23:03:49,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 23:03:49,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126502249] [2022-09-29 23:03:49,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126502249] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 23:03:49,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644721693] [2022-09-29 23:03:49,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 23:03:49,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 23:03:49,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 23:03:49,217 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-09-29 23:03:49,218 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-09-29 23:03:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 23:03:50,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 4302 conjuncts, 275 conjunts are in the unsatisfiable core [2022-09-29 23:03:50,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 23:03:52,755 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-09-29 23:03:53,103 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-29 23:03:53,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, 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-09-29 23:03:53,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:03:53,400 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-09-29 23:03:53,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-29 23:03:54,812 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-09-29 23:03:55,481 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-09-29 23:03:55,482 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 17 treesize of output 17 [2022-09-29 23:03:56,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:03:56,343 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 24 treesize of output 23 [2022-09-29 23:03:56,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-29 23:03:56,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:03:56,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-29 23:03:56,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:03:56,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:03:56,861 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 31 treesize of output 33 [2022-09-29 23:03:57,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:03:57,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-09-29 23:03:57,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:03:57,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:03:57,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:03:57,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:03:57,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2022-09-29 23:03:59,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:03:59,522 INFO L356 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2022-09-29 23:03:59,523 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 57 [2022-09-29 23:03:59,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:03:59,531 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 32 treesize of output 18 [2022-09-29 23:03:59,542 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-29 23:03:59,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 25 [2022-09-29 23:03:59,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 [2022-09-29 23:04:00,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:04:00,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-09-29 23:04:00,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-29 23:04:00,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 23:04:00,816 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 20 treesize of output 8 [2022-09-29 23:04:01,302 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 18 treesize of output 20 [2022-09-29 23:04:01,633 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-09-29 23:04:01,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:04:01,640 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 31 treesize of output 30 [2022-09-29 23:04:02,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 23:04:02,176 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 42 treesize of output 28 [2022-09-29 23:04:03,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 23:04:03,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2022-09-29 23:04:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3117 backedges. 2290 proven. 470 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2022-09-29 23:04:03,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-29 23:04:04,832 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 122 treesize of output 116 [2022-09-29 23:04:24,521 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (forall ((v_ArrVal_2753 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse4 (let ((.cse6 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2753))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse4 v_arrayElimCell_27) .cse5) .cse5)))))) (and (forall ((v_ArrVal_2753 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse0 (let ((.cse2 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_write~$Pointer$_#ptr#1.base| v_ArrVal_2753))) (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 ((.cse1 (+ (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse0 v_arrayElimCell_27) .cse1) .cse1) (< (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse1) .cse1))))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse3))) is different from false [2022-09-29 23:04:24,607 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_2753 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse4 (let ((.cse6 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_2753))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse4 v_arrayElimCell_27) .cse5) .cse5)))))) (and (or .cse0 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (forall ((v_ArrVal_2753 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse1 (let ((.cse3 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_2753))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |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 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse1 v_arrayElimCell_27) .cse2) .cse2) (< (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse2) .cse2))))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0))) is different from false [2022-09-29 23:04:24,645 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (forall ((v_ArrVal_2753 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_2753))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ 12 (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))))) (< (select (select .cse4 v_arrayElimCell_27) .cse5) .cse5)))))) (and (forall ((v_ArrVal_2753 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_fifo_push_#t~mem30#1.base| v_ArrVal_2753))) (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 ((.cse1 (+ 12 (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))))) (or (< (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse1) .cse1) (< (select (select .cse0 v_arrayElimCell_27) .cse1) .cse1))))) (or .cse3 (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|)) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) is different from false [2022-09-29 23:04:24,680 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_2753 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base| v_ArrVal_2753))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse4 v_arrayElimCell_27) .cse5) .cse5)))))) (and (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0) (forall ((v_ArrVal_2753 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_pusherThread1of1ForFork0_read~$Pointer$_#value#1.base| v_ArrVal_2753))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |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 (+ (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse1 v_arrayElimCell_27) .cse2) .cse2) (< (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse2) .cse2))))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse0))) is different from false [2022-09-29 23:04:24,699 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (forall ((v_ArrVal_2753 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse4 (let ((.cse6 (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_2753))) (store .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse6 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|))))) (let ((.cse5 (+ (select (select .cse4 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (< (select (select .cse4 v_arrayElimCell_27) .cse5) .cse5)))))) (and (forall ((v_ArrVal_2753 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse0 (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_2753))) (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 ((.cse1 (+ (select (select .cse0 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (or (< (select (select .cse0 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse1) .cse1) (< (select (select .cse0 v_arrayElimCell_27) .cse1) .cse1))))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse3) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse3))) is different from false [2022-09-29 23:04:24,760 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_2753 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse5 (let ((.cse8 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8) v_ArrVal_2753))) (store .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse7 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse8 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (let ((.cse6 (+ 12 (select (select .cse5 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))))) (< (select (select .cse5 v_arrayElimCell_27) .cse6) .cse6)))))) (and (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| |c_pusherThread1of1ForFork0_~q~0#1.offset|) .cse0) (forall ((v_ArrVal_2753 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse1 (let ((.cse4 (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4) v_ArrVal_2753))) (store .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select .cse3 |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) .cse4 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))))) (let ((.cse2 (+ 12 (select (select .cse1 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4))))) (or (< (select (select .cse1 |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|) .cse2) .cse2) (< (select (select .cse1 v_arrayElimCell_27) .cse2) .cse2))))) (or (= |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| |c_pusherThread1of1ForFork0_~q~0#1.base|) .cse0))) is different from false [2022-09-29 23:04:24,963 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 23:04:24,963 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 702 treesize of output 519 [2022-09-29 23:04:25,091 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 23:04:25,091 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 13361 treesize of output 12759 [2022-09-29 23:04:25,261 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 23:04:25,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 13580 treesize of output 12837 [2022-09-29 23:04:25,644 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 23:04:25,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 13774 treesize of output 12639 [2022-09-29 23:04:26,118 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-29 23:04:26,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 13478 treesize of output 12553 [2022-09-29 23:04:27,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 Received shutdown request... [2022-09-29 23:17:36,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location pusherErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-29 23:17:36,707 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 23:17:36,708 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-09-29 23:17:36,708 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-09-29 23:17:36,708 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 23:17:36,708 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-09-29 23:17:36,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-09-29 23:17:36,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 23:17:36,908 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 1553 with TraceHistMax 7,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-5-2-2-2-1 context. [2022-09-29 23:17:36,909 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-09-29 23:17:36,909 INFO L307 ceAbstractionStarter]: Result for error location pusherErr0ASSERT_VIOLATIONASSERT was TIMEOUT (3/3) [2022-09-29 23:17:36,914 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-29 23:17:36,914 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-29 23:17:36,916 INFO L202 PluginConnector]: Adding new model divinefifo_1w1r.line437.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.09 11:17:36 BasicIcfg [2022-09-29 23:17:36,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-29 23:17:36,917 INFO L158 Benchmark]: Toolchain (without parser) took 861389.30ms. Allocated memory was 191.9MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 165.1MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. [2022-09-29 23:17:36,917 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 23:17:36,917 INFO L158 Benchmark]: Boogie Preprocessor took 85.47ms. Allocated memory is still 191.9MB. Free memory was 165.1MB in the beginning and 158.3MB in the end (delta: 6.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-09-29 23:17:36,918 INFO L158 Benchmark]: RCFGBuilder took 1139.64ms. Allocated memory is still 191.9MB. Free memory was 158.3MB in the beginning and 121.2MB in the end (delta: 37.1MB). Peak memory consumption was 42.1MB. Max. memory is 8.0GB. [2022-09-29 23:17:36,918 INFO L158 Benchmark]: TraceAbstraction took 860159.32ms. Allocated memory was 191.9MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 120.7MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 5.0GB. Max. memory is 8.0GB. [2022-09-29 23:17:36,919 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.11ms. Allocated memory is still 191.9MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 85.47ms. Allocated memory is still 191.9MB. Free memory was 165.1MB in the beginning and 158.3MB in the end (delta: 6.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1139.64ms. Allocated memory is still 191.9MB. Free memory was 158.3MB in the beginning and 121.2MB in the end (delta: 37.1MB). Peak memory consumption was 42.1MB. Max. memory is 8.0GB. * TraceAbstraction took 860159.32ms. Allocated memory was 191.9MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 120.7MB in the beginning and 3.9GB in the end (delta: -3.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: 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: 133, positive: 127, positive conditional: 127, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 128857, positive: 124863, positive conditional: 124863, positive unconditional: 0, negative: 3994, negative conditional: 3994, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125241, positive: 124863, positive conditional: 0, positive unconditional: 124863, negative: 378, negative conditional: 0, negative unconditional: 378, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 40400, positive: 40229, positive conditional: 0, positive unconditional: 40229, negative: 171, negative conditional: 0, negative unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 125241, positive: 84634, positive conditional: 0, positive unconditional: 84634, negative: 207, negative conditional: 0, negative unconditional: 207, unknown: 40400, unknown conditional: 0, unknown unconditional: 40400] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 6, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 131, positive: 127, positive conditional: 127, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 128857, positive: 124863, positive conditional: 124863, positive unconditional: 0, negative: 3994, negative conditional: 3994, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125241, positive: 124863, positive conditional: 0, positive unconditional: 124863, negative: 378, negative conditional: 0, negative unconditional: 378, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 40400, positive: 40229, positive conditional: 0, positive unconditional: 40229, negative: 171, negative conditional: 0, negative unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 125241, positive: 84634, positive conditional: 0, positive unconditional: 84634, negative: 207, negative conditional: 0, negative unconditional: 207, unknown: 40400, unknown conditional: 0, unknown unconditional: 40400] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 10, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 64949, positive: 63036, positive conditional: 63036, positive unconditional: 0, negative: 1913, negative conditional: 1913, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 128857, positive: 124863, positive conditional: 124863, positive unconditional: 0, negative: 3994, negative conditional: 3994, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125241, positive: 124863, positive conditional: 0, positive unconditional: 124863, negative: 378, negative conditional: 0, negative unconditional: 378, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 40400, positive: 40229, positive conditional: 0, positive unconditional: 40229, negative: 171, negative conditional: 0, negative unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 125241, positive: 84634, positive conditional: 0, positive unconditional: 84634, negative: 207, negative conditional: 0, negative unconditional: 207, unknown: 40400, unknown conditional: 0, unknown unconditional: 40400] , Statistics on independence cache: Total cache size (in pairs): 33033, Positive cache size: 32973, Positive conditional cache size: 0, Positive unconditional cache size: 32973, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, Independence queries for same thread: 1851, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 63644, positive: 61573, positive conditional: 61573, positive unconditional: 0, negative: 2071, negative conditional: 2071, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 128857, positive: 124863, positive conditional: 124863, positive unconditional: 0, negative: 3994, negative conditional: 3994, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125241, positive: 124863, positive conditional: 0, positive unconditional: 124863, negative: 378, negative conditional: 0, negative unconditional: 378, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 40400, positive: 40229, positive conditional: 0, positive unconditional: 40229, negative: 171, negative conditional: 0, negative unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 125241, positive: 84634, positive conditional: 0, positive unconditional: 84634, negative: 207, negative conditional: 0, negative unconditional: 207, unknown: 40400, unknown conditional: 0, unknown unconditional: 40400] , Statistics on independence cache: Total cache size (in pairs): 40400, Positive cache size: 40229, Positive conditional cache size: 0, Positive unconditional cache size: 40229, Negative cache size: 171, Negative conditional cache size: 0, Negative unconditional cache size: 171, Independence queries for same thread: 3616, Statistics for Abstraction: - TimeoutResultAtElement [Line: 437]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 1553 with TraceHistMax 7,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-5-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for error location: pusherErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 1440 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, 1440 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 859.7s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 5.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: 23, 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, 3.1s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 9815 NumberOfCodeBlocks, 9815 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 9811 ConstructedInterpolants, 0 QuantifiedInterpolants, 21683 SizeOfPredicates, 0 NumberOfNonLiveVariables, 12546 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 53251/55938 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, 1440 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