/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-09-29 22:16:02,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 22:16:02,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 22:16:02,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 22:16:02,990 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 22:16:02,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 22:16:02,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 22:16:02,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 22:16:02,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 22:16:02,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 22:16:02,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 22:16:02,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 22:16:02,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 22:16:02,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 22:16:02,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 22:16:02,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 22:16:02,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 22:16:02,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 22:16:02,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 22:16:03,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 22:16:03,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 22:16:03,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 22:16:03,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 22:16:03,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 22:16:03,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 22:16:03,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 22:16:03,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 22:16:03,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 22:16:03,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 22:16:03,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 22:16:03,016 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 22:16:03,017 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 22:16:03,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 22:16:03,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 22:16:03,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 22:16:03,019 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 22:16:03,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 22:16:03,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 22:16:03,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 22:16:03,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 22:16:03,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 22:16:03,021 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-09-29 22:16:03,034 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 22:16:03,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 22:16:03,035 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 22:16:03,035 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 22:16:03,035 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-29 22:16:03,035 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-29 22:16:03,036 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 22:16:03,036 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 22:16:03,036 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 22:16:03,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 22:16:03,036 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 22:16:03,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 22:16:03,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 22:16:03,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 22:16:03,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-29 22:16:03,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-29 22:16:03,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-29 22:16:03,037 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 22:16:03,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 22:16:03,037 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 22:16:03,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-29 22:16:03,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 22:16:03,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 22:16:03,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-29 22:16:03,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-29 22:16:03,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-29 22:16:03,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 22:16:03,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-29 22:16:03,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-29 22:16:03,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 22:16:03,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-29 22:16:03,038 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-29 22:16:03,039 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-09-29 22:16:03,039 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-29 22:16:03,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-29 22:16:03,039 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-09-29 22:16:03,039 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-09-29 22:16:03,039 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-09-29 22:16:03,039 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 22:16:03,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 22:16:03,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 22:16:03,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 22:16:03,223 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 22:16:03,224 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 22:16:03,225 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-09-29 22:16:03,226 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-09-29 22:16:03,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 22:16:03,296 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-09-29 22:16:03,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 22:16:03,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 22:16:03,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 22:16:03,307 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 29.09 10:16:03" (1/1) ... [2022-09-29 22:16:03,308 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 29.09 10:16:03" (1/1) ... [2022-09-29 22:16:03,340 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 29.09 10:16:03" (1/1) ... [2022-09-29 22:16:03,346 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 29.09 10:16:03" (1/1) ... [2022-09-29 22:16:03,374 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 29.09 10:16:03" (1/1) ... [2022-09-29 22:16:03,378 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 29.09 10:16:03" (1/1) ... [2022-09-29 22:16:03,383 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 29.09 10:16:03" (1/1) ... [2022-09-29 22:16:03,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 22:16:03,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 22:16:03,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 22:16:03,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 22:16:03,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divinefifo-bug_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:16:03" (1/1) ... [2022-09-29 22:16:03,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-29 22:16:03,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:16:03,450 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 22:16:03,523 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 22:16:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2022-09-29 22:16:03,553 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2022-09-29 22:16:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 22:16:03,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 22:16:03,555 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 22:16:03,697 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 22:16:03,699 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 22:16:04,541 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 22:16:04,565 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 22:16:04,566 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-09-29 22:16:04,568 INFO L202 PluginConnector]: Adding new model divinefifo-bug_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 10:16:04 BoogieIcfgContainer [2022-09-29 22:16:04,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 22:16:04,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-29 22:16:04,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-29 22:16:04,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-29 22:16:04,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divinefifo-bug_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 10:16:03" (1/2) ... [2022-09-29 22:16:04,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0c4475 and model type divinefifo-bug_1w1r.line471.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.09 10:16:04, skipping insertion in model container [2022-09-29 22:16:04,579 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 29.09 10:16:04" (2/2) ... [2022-09-29 22:16:04,580 INFO L112 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.line471.bpl [2022-09-29 22:16:04,585 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-29 22:16:04,594 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-29 22:16:04,594 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-29 22:16:04,594 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-29 22:16:04,748 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-09-29 22:16:04,807 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-29 22:16:04,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-29 22:16:04,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:16:04,812 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 22:16:04,813 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 22:16:04,872 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-29 22:16:04,886 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == pusherErr0ASSERT_VIOLATIONASSERT ======== [2022-09-29 22:16:04,895 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;@4d15861f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-29 22:16:04,898 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-29 22:16:04,901 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-09-29 22:16:04,903 INFO L805 garLoopResultBuilder]: Registering result SAFE for location pusherErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-09-29 22:16:04,914 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-29 22:16:04,920 INFO L307 ceAbstractionStarter]: Result for error location pusherErr0ASSERT_VIOLATIONASSERT was SAFE (1/3) [2022-09-29 22:16:04,930 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-29 22:16:04,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-29 22:16:04,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:16:04,933 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 22:16:04,934 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 22:16:04,937 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-29 22:16:04,941 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-09-29 22:16:04,942 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;@4d15861f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-29 22:16:04,942 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-29 22:16:04,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-09-29 22:16:04,995 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-09-29 22:16:04,995 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/3) [2022-09-29 22:16:05,003 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-09-29 22:16:05,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-29 22:16:05,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:16:05,052 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 22:16:05,053 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 22:16:05,056 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-29 22:16:05,056 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == pusherErr0ASSERT_VIOLATIONASSERT ======== [2022-09-29 22:16:05,057 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;@4d15861f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-29 22:16:05,057 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-09-29 22:16:05,246 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:16:05,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:16:05,249 INFO L85 PathProgramCache]: Analyzing trace with hash -363638362, now seen corresponding path program 1 times [2022-09-29 22:16:05,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:16:05,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121766574] [2022-09-29 22:16:05,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:16:05,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:16:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:16:05,571 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 22:16:05,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:16:05,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121766574] [2022-09-29 22:16:05,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121766574] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:16:05,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:16:05,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-29 22:16:05,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125819912] [2022-09-29 22:16:05,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:16:05,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-29 22:16:05,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:16:05,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-29 22:16:05,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-29 22:16:05,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:16:05,593 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:16:05,594 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-09-29 22:16:05,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:16:05,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:16:05,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-29 22:16:05,614 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:16:05,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:16:05,614 INFO L85 PathProgramCache]: Analyzing trace with hash 486382358, now seen corresponding path program 1 times [2022-09-29 22:16:05,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:16:05,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402943468] [2022-09-29 22:16:05,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:16:05,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:16:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:16:05,880 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 22:16:05,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:16:05,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402943468] [2022-09-29 22:16:05,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402943468] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:16:05,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 22:16:05,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-09-29 22:16:05,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634990119] [2022-09-29 22:16:05,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:16:05,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-29 22:16:05,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:16:05,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-29 22:16:05,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-09-29 22:16:05,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:16:05,883 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:16:05,883 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-09-29 22:16:05,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:16:05,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:16:09,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:16:09,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-29 22:16:09,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-29 22:16:09,254 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:16:09,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:16:09,255 INFO L85 PathProgramCache]: Analyzing trace with hash 171236868, now seen corresponding path program 1 times [2022-09-29 22:16:09,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:16:09,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297134847] [2022-09-29 22:16:09,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:16:09,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:16:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:16:12,673 INFO L134 CoverageAnalysis]: Checked inductivity of 15095 backedges. 0 proven. 7623 refuted. 0 times theorem prover too weak. 7472 trivial. 0 not checked. [2022-09-29 22:16:12,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:16:12,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297134847] [2022-09-29 22:16:12,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297134847] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:16:12,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392058199] [2022-09-29 22:16:12,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:16:12,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:16:12,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:16:12,676 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 22:16:12,677 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 22:16:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:16:14,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 10116 conjuncts, 9 conjunts are in the unsatisfiable core [2022-09-29 22:16:14,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:16:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 15095 backedges. 11208 proven. 0 refuted. 0 times theorem prover too weak. 3887 trivial. 0 not checked. [2022-09-29 22:16:15,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-29 22:16:15,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392058199] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 22:16:15,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-29 22:16:15,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2022-09-29 22:16:15,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873401962] [2022-09-29 22:16:15,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 22:16:15,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-29 22:16:15,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 22:16:15,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-29 22:16:15,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2022-09-29 22:16:15,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:16:15,820 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-29 22:16:15,821 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-09-29 22:16:15,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:16:15,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-09-29 22:16:15,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:16:16,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-29 22:16:16,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-29 22:16:16,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-29 22:16:16,853 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-09-29 22:16:17,047 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 22:16:17,048 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting pusherErr0ASSERT_VIOLATIONASSERT === [pusherErr0ASSERT_VIOLATIONASSERT] === [2022-09-29 22:16:17,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 22:16:17,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1465885582, now seen corresponding path program 1 times [2022-09-29 22:16:17,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 22:16:17,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099102027] [2022-09-29 22:16:17,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:16:17,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 22:16:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:16:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3285 backedges. 1131 proven. 1853 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-09-29 22:16:42,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 22:16:42,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099102027] [2022-09-29 22:16:42,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099102027] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-29 22:16:42,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320696969] [2022-09-29 22:16:42,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 22:16:42,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-29 22:16:42,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 22:16:42,348 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 22:16:42,354 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 22:16:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 22:16:43,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 4386 conjuncts, 353 conjunts are in the unsatisfiable core [2022-09-29 22:16:43,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-29 22:16:46,277 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 22:16:46,284 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 22:16:48,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:16:48,212 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-09-29 22:16:48,221 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 22:16:48,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:16:48,744 INFO L356 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2022-09-29 22:16:48,763 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-09-29 22:16:48,772 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-29 22:16:48,772 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 22:16:49,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:16:49,253 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 22:16:49,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:16:49,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:16:49,259 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-09-29 22:16:50,711 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-09-29 22:16:50,712 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-09-29 22:16:50,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 22:16:50,725 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-09-29 22:16:50,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:16:50,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 22:16:50,740 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-29 22:16:50,740 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-09-29 22:16:52,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:16:52,199 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-09-29 22:16:52,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-29 22:16:53,495 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-09-29 22:16:54,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:16:54,162 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-29 22:16:54,162 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-09-29 22:16:54,180 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-09-29 22:16:54,772 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 22:16:54,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-29 22:16:54,777 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-09-29 22:16:55,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-29 22:16:55,556 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-09-29 22:16:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3285 backedges. 1801 proven. 58 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2022-09-29 22:16:57,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-29 22:16:59,205 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-09-29 22:17:45,364 WARN L833 $PredicateComparison]: unable to prove that (and (not (let ((.cse1 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |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_arrayElimCell_20 Int)) (not (let ((.cse3 (store |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base| (store (select |c_pusherThread1of1ForFork0_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_pusherThread1of1ForFork0_fifo_push_~self#1.base|) (+ |c_pusherThread1of1ForFork0_fifo_push_~self#1.offset| 4) |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|)))) (let ((.cse2 (+ (select (select .cse3 |c_pusherThread1of1ForFork0_~q~0#1.base|) (+ |c_pusherThread1of1ForFork0_~q~0#1.offset| 4)) 12))) (<= .cse2 (select (select .cse3 v_arrayElimCell_20) .cse2)))))))) is different from false [2022-09-29 22:17:55,800 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-09-29 22:17:55,833 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-09-29 22:17:55,851 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-09-29 22:17:55,887 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-09-29 22:17:55,902 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-09-29 22:17:55,945 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-09-29 22:17:55,983 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))))))) (and (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem29#1.offset| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.offset|) (= |c_pusherThread1of1ForFork0_fifo_push_#t~mem29#1.base| |c_pusherThread1of1ForFork0_fifo_push_~t~0#1.base|))) is different from false [2022-09-29 22:18:32,830 WARN L233 SmtUtils]: Spent 15.91s 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-09-29 22:19:32,126 WARN L233 SmtUtils]: Spent 5.20s 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-09-29 22:20:50,163 WARN L233 SmtUtils]: Spent 10.95s 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-09-29 22:21:46,725 WARN L233 SmtUtils]: Spent 6.67s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-29 22:22:51,400 WARN L233 SmtUtils]: Spent 6.23s 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-09-29 22:23:27,480 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-09-29 22:23:27,481 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-09-29 22:23:27,505 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 101 [2022-09-29 22:23:27,506 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 22:23:27,682 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 22:23:27,683 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:625) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 53 more [2022-09-29 22:23:27,685 INFO L158 Benchmark]: Toolchain (without parser) took 444388.74ms. Allocated memory was 201.3MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 149.7MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-09-29 22:23:27,685 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.68ms. Allocated memory is still 201.3MB. Free memory was 155.9MB in the beginning and 155.7MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 22:23:27,685 INFO L158 Benchmark]: Boogie Preprocessor took 93.34ms. Allocated memory is still 201.3MB. Free memory was 149.6MB in the beginning and 143.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-09-29 22:23:27,686 INFO L158 Benchmark]: RCFGBuilder took 1175.53ms. Allocated memory is still 201.3MB. Free memory was 143.1MB in the beginning and 103.7MB in the end (delta: 39.4MB). Peak memory consumption was 40.6MB. Max. memory is 8.0GB. [2022-09-29 22:23:27,686 INFO L158 Benchmark]: TraceAbstraction took 443114.80ms. Allocated memory was 201.3MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 103.2MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-09-29 22:23:27,687 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.68ms. Allocated memory is still 201.3MB. Free memory was 155.9MB in the beginning and 155.7MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 93.34ms. Allocated memory is still 201.3MB. Free memory was 149.6MB in the beginning and 143.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1175.53ms. Allocated memory is still 201.3MB. Free memory was 143.1MB in the beginning and 103.7MB in the end (delta: 39.4MB). Peak memory consumption was 40.6MB. Max. memory is 8.0GB. * TraceAbstraction took 443114.80ms. Allocated memory was 201.3MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 103.2MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 1.9GB. 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: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-09-29 22:23:27,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2022-09-29 22:23:27,933 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-09-29 22:23:28,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 Received shutdown request...