/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy BADGER --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP -s ../../../trunk/examples/settings/gemcutter/SleepMap-ConcreteSmt-VarAbsGlobalSyntactic.epf --traceabstraction.coinflip.probability.value 85 --traceabstraction.coinflip.random.seed 0 --traceabstraction.coinflip.budget.determination.mode PURE -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/motivating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-e57bdd3-m [2022-10-06 03:54:10,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-06 03:54:10,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-06 03:54:10,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-06 03:54:10,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-06 03:54:10,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-06 03:54:10,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-06 03:54:10,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-06 03:54:10,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-06 03:54:10,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-06 03:54:10,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-06 03:54:10,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-06 03:54:10,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-06 03:54:10,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-06 03:54:10,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-06 03:54:10,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-06 03:54:10,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-06 03:54:10,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-06 03:54:10,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-06 03:54:10,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-06 03:54:10,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-06 03:54:10,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-06 03:54:10,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-06 03:54:10,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-06 03:54:10,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-06 03:54:10,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-06 03:54:10,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-06 03:54:10,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-06 03:54:10,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-06 03:54:10,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-06 03:54:10,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-06 03:54:10,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-06 03:54:10,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-06 03:54:10,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-06 03:54:10,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-06 03:54:10,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-06 03:54:10,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-06 03:54:10,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-06 03:54:10,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-06 03:54:10,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-06 03:54:10,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-06 03:54:10,737 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/SleepMap-ConcreteSmt-VarAbsGlobalSyntactic.epf [2022-10-06 03:54:10,763 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-06 03:54:10,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-06 03:54:10,764 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-06 03:54:10,764 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-06 03:54:10,765 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-06 03:54:10,765 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-06 03:54:10,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-06 03:54:10,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-06 03:54:10,767 INFO L138 SettingsManager]: * Use SBE=true [2022-10-06 03:54:10,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-06 03:54:10,767 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-06 03:54:10,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-06 03:54:10,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-06 03:54:10,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-06 03:54:10,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-06 03:54:10,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-06 03:54:10,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-06 03:54:10,768 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-06 03:54:10,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-06 03:54:10,768 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-06 03:54:10,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-06 03:54:10,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-06 03:54:10,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-06 03:54:10,769 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-06 03:54:10,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-06 03:54:10,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-06 03:54:10,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-06 03:54:10,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-06 03:54:10,770 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-06 03:54:10,770 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-06 03:54:10,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-06 03:54:10,770 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-06 03:54:10,770 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-06 03:54:10,770 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-06 03:54:10,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-06 03:54:10,770 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-06 03:54:10,771 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-06 03:54:10,771 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-06 03:54:10,771 INFO L138 SettingsManager]: * Number of independence relations to use for POR=2 [2022-10-06 03:54:10,771 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> BADGER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Coinflip probability value -> 85 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Coinflip random seed -> 0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Coinflip budget determination mode -> PURE [2022-10-06 03:54:11,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-06 03:54:11,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-06 03:54:11,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-06 03:54:11,060 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-06 03:54:11,061 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-06 03:54:11,062 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/motivating.bpl [2022-10-06 03:54:11,062 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/motivating.bpl' [2022-10-06 03:54:11,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-06 03:54:11,084 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-10-06 03:54:11,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-06 03:54:11,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-06 03:54:11,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-06 03:54:11,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.10 03:54:11" (1/1) ... [2022-10-06 03:54:11,101 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.10 03:54:11" (1/1) ... [2022-10-06 03:54:11,106 INFO L138 Inliner]: procedures = 4, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-10-06 03:54:11,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-06 03:54:11,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-06 03:54:11,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-06 03:54:11,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-06 03:54:11,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.10 03:54:11" (1/1) ... [2022-10-06 03:54:11,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.10 03:54:11" (1/1) ... [2022-10-06 03:54:11,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.10 03:54:11" (1/1) ... [2022-10-06 03:54:11,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.10 03:54:11" (1/1) ... [2022-10-06 03:54:11,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.10 03:54:11" (1/1) ... [2022-10-06 03:54:11,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.10 03:54:11" (1/1) ... [2022-10-06 03:54:11,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.10 03:54:11" (1/1) ... [2022-10-06 03:54:11,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-06 03:54:11,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-06 03:54:11,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-06 03:54:11,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-06 03:54:11,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.10 03:54:11" (1/1) ... [2022-10-06 03:54:11,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-06 03:54:11,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-06 03:54:11,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-06 03:54:11,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-06 03:54:11,180 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-10-06 03:54:11,180 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-10-06 03:54:11,180 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-10-06 03:54:11,181 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-10-06 03:54:11,181 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-10-06 03:54:11,181 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-10-06 03:54:11,181 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-10-06 03:54:11,181 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-10-06 03:54:11,181 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-10-06 03:54:11,181 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-10-06 03:54:11,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-06 03:54:11,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-06 03:54:11,182 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-06 03:54:11,225 INFO L234 CfgBuilder]: Building ICFG [2022-10-06 03:54:11,226 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-06 03:54:11,311 INFO L275 CfgBuilder]: Performing block encoding [2022-10-06 03:54:11,316 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-06 03:54:11,316 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-06 03:54:11,317 INFO L202 PluginConnector]: Adding new model motivating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 03:54:11 BoogieIcfgContainer [2022-10-06 03:54:11,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-06 03:54:11,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-06 03:54:11,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-06 03:54:11,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-06 03:54:11,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "motivating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.10 03:54:11" (1/2) ... [2022-10-06 03:54:11,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196011ee and model type motivating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 03:54:11, skipping insertion in model container [2022-10-06 03:54:11,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "motivating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 03:54:11" (2/2) ... [2022-10-06 03:54:11,323 INFO L112 eAbstractionObserver]: Analyzing ICFG motivating.bpl [2022-10-06 03:54:11,337 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-06 03:54:11,343 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-06 03:54:11,344 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-06 03:54:11,344 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-06 03:54:11,401 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-10-06 03:54:11,481 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-06 03:54:11,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-06 03:54:11,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-06 03:54:11,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-06 03:54:11,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-06 03:54:11,569 INFO L100 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-06 03:54:11,595 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2022-10-06 03:54:11,595 WARN L162 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2022-10-06 03:54:11,595 WARN L163 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2022-10-06 03:54:11,609 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-06 03:54:11,617 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;@6e7dd59d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-06 03:54:11,618 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-06 03:54:11,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-06 03:54:11,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-06 03:54:11,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1011172720, now seen corresponding path program 1 times [2022-10-06 03:54:11,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-06 03:54:11,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128094171] [2022-10-06 03:54:11,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-06 03:54:11,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-06 03:54:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-06 03:54:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-10-06 03:54:12,047 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-06 03:54:12,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128094171] [2022-10-06 03:54:12,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128094171] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-06 03:54:12,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-06 03:54:12,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-06 03:54:12,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637699653] [2022-10-06 03:54:12,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-06 03:54:12,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-06 03:54:12,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-06 03:54:12,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-06 03:54:12,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-06 03:54:12,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-06 03:54:12,078 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-06 03:54:12,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-06 03:54:12,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-06 03:54:12,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-06 03:54:12,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-06 03:54:12,252 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-06 03:54:12,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-06 03:54:12,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1107970577, now seen corresponding path program 1 times [2022-10-06 03:54:12,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-06 03:54:12,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840056015] [2022-10-06 03:54:12,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-06 03:54:12,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-06 03:54:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-06 03:54:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-10-06 03:54:12,293 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-06 03:54:12,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840056015] [2022-10-06 03:54:12,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840056015] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-06 03:54:12,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-06 03:54:12,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-06 03:54:12,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179569760] [2022-10-06 03:54:12,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-06 03:54:12,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-06 03:54:12,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-06 03:54:12,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-06 03:54:12,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-06 03:54:12,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-06 03:54:12,296 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-06 03:54:12,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-06 03:54:12,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-06 03:54:12,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-06 03:54:12,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-06 03:54:12,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-06 03:54:12,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-06 03:54:12,373 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-06 03:54:12,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-06 03:54:12,373 INFO L85 PathProgramCache]: Analyzing trace with hash 924906811, now seen corresponding path program 1 times [2022-10-06 03:54:12,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-06 03:54:12,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923797045] [2022-10-06 03:54:12,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-06 03:54:12,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-06 03:54:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-06 03:54:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-06 03:54:12,819 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-06 03:54:12,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923797045] [2022-10-06 03:54:12,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923797045] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-06 03:54:12,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-10-06 03:54:12,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-10-06 03:54:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553703744] [2022-10-06 03:54:12,820 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-10-06 03:54:12,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-06 03:54:12,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-06 03:54:12,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-06 03:54:12,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-10-06 03:54:12,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-06 03:54:12,821 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-06 03:54:12,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-06 03:54:12,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-06 03:54:12,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-06 03:54:12,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-06 03:54:13,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-06 03:54:13,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-06 03:54:13,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-06 03:54:13,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-06 03:54:13,264 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-06 03:54:13,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-06 03:54:13,265 INFO L85 PathProgramCache]: Analyzing trace with hash -582574728, now seen corresponding path program 2 times [2022-10-06 03:54:13,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-06 03:54:13,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47097915] [2022-10-06 03:54:13,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-06 03:54:13,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-06 03:54:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-06 03:54:13,765 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-06 03:54:13,766 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-06 03:54:13,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47097915] [2022-10-06 03:54:13,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47097915] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-06 03:54:13,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-10-06 03:54:13,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-10-06 03:54:13,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738949993] [2022-10-06 03:54:13,775 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-10-06 03:54:13,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-06 03:54:13,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-06 03:54:13,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-06 03:54:13,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-10-06 03:54:13,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-06 03:54:13,778 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-06 03:54:13,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-06 03:54:13,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-06 03:54:13,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-06 03:54:13,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-10-06 03:54:13,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-06 03:54:14,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-06 03:54:14,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-06 03:54:14,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-06 03:54:14,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-06 03:54:14,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-06 03:54:14,150 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-06 03:54:14,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-06 03:54:14,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1578510401, now seen corresponding path program 1 times [2022-10-06 03:54:14,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-06 03:54:14,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44712013] [2022-10-06 03:54:14,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-06 03:54:14,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-06 03:54:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-06 03:54:14,250 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-06 03:54:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-06 03:54:14,341 INFO L130 FreeRefinementEngine]: Strategy BADGER found a feasible trace [2022-10-06 03:54:14,341 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-06 03:54:14,342 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-06 03:54:14,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-06 03:54:14,353 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-10-06 03:54:14,356 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was UNSAFE (1/7) [2022-10-06 03:54:14,358 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-06 03:54:14,358 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-06 03:54:14,384 INFO L202 PluginConnector]: Adding new model motivating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 03:54:14 BasicIcfg [2022-10-06 03:54:14,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-06 03:54:14,385 INFO L158 Benchmark]: Toolchain (without parser) took 3300.19ms. Allocated memory was 210.8MB in the beginning and 280.0MB in the end (delta: 69.2MB). Free memory was 190.3MB in the beginning and 166.3MB in the end (delta: 24.1MB). Peak memory consumption was 94.9MB. Max. memory is 8.0GB. [2022-10-06 03:54:14,385 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 210.8MB. Free memory is still 191.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-06 03:54:14,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.85ms. Allocated memory is still 210.8MB. Free memory was 190.2MB in the beginning and 188.7MB in the end (delta: 1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-06 03:54:14,385 INFO L158 Benchmark]: Boogie Preprocessor took 18.67ms. Allocated memory is still 210.8MB. Free memory was 188.7MB in the beginning and 187.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-06 03:54:14,386 INFO L158 Benchmark]: RCFGBuilder took 189.26ms. Allocated memory is still 210.8MB. Free memory was 187.6MB in the beginning and 177.9MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-06 03:54:14,386 INFO L158 Benchmark]: TraceAbstraction took 3064.79ms. Allocated memory was 210.8MB in the beginning and 280.0MB in the end (delta: 69.2MB). Free memory was 177.3MB in the beginning and 166.3MB in the end (delta: 11.0MB). Peak memory consumption was 81.3MB. Max. memory is 8.0GB. [2022-10-06 03:54:14,387 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 210.8MB. Free memory is still 191.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.85ms. Allocated memory is still 210.8MB. Free memory was 190.2MB in the beginning and 188.7MB in the end (delta: 1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.67ms. Allocated memory is still 210.8MB. Free memory was 188.7MB in the beginning and 187.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 189.26ms. Allocated memory is still 210.8MB. Free memory was 187.6MB in the beginning and 177.9MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 3064.79ms. Allocated memory was 210.8MB in the beginning and 280.0MB in the end (delta: 69.2MB). Free memory was 177.3MB in the beginning and 166.3MB in the end (delta: 11.0MB). Peak memory consumption was 81.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 73, positive: 54, positive conditional: 54, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 294, positive: 221, positive conditional: 221, positive unconditional: 0, negative: 73, negative conditional: 73, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 246, positive: 221, positive conditional: 0, positive unconditional: 221, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 103, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 246, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 103, unknown conditional: 0, unknown unconditional: 103] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Independence queries for same thread: 14, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 86, positive: 71, positive conditional: 71, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 294, positive: 221, positive conditional: 221, positive unconditional: 0, negative: 73, negative conditional: 73, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 246, positive: 221, positive conditional: 0, positive unconditional: 221, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 103, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 246, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 103, unknown conditional: 0, unknown unconditional: 103] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Independence queries for same thread: 21, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 45, positive: 32, positive conditional: 32, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 294, positive: 221, positive conditional: 221, positive unconditional: 0, negative: 73, negative conditional: 73, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 246, positive: 221, positive conditional: 0, positive unconditional: 221, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 103, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 246, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 103, unknown conditional: 0, unknown unconditional: 103] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Independence queries for same thread: 30, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 45, positive: 32, positive conditional: 32, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 294, positive: 221, positive conditional: 221, positive unconditional: 0, negative: 73, negative conditional: 73, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 246, positive: 221, positive conditional: 0, positive unconditional: 221, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 103, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 246, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 103, unknown conditional: 0, unknown unconditional: 103] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 95, Positive conditional cache size: 0, Positive unconditional cache size: 95, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Independence queries for same thread: 39, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 45, positive: 32, positive conditional: 32, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 294, positive: 221, positive conditional: 221, positive unconditional: 0, negative: 73, negative conditional: 73, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 246, positive: 221, positive conditional: 0, positive unconditional: 221, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 103, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 246, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 103, unknown conditional: 0, unknown unconditional: 103] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 95, Positive conditional cache size: 0, Positive unconditional cache size: 95, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Independence queries for same thread: 48, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 889, positive: 628, positive conditional: 628, positive unconditional: 0, negative: 261, negative conditional: 261, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 664, positive: 628, positive conditional: 628, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 664, positive: 628, positive conditional: 628, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 700, positive: 628, positive conditional: 4, positive unconditional: 624, negative: 72, negative conditional: 32, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 700, positive: 628, positive conditional: 4, positive unconditional: 624, negative: 72, negative conditional: 26, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 700, positive: 628, positive conditional: 4, positive unconditional: 624, negative: 72, negative conditional: 26, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 147, positive: 128, positive conditional: 2, positive unconditional: 126, negative: 19, negative conditional: 9, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 147, positive: 122, positive conditional: 0, positive unconditional: 122, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, positive: 6, positive conditional: 2, positive unconditional: 4, negative: 19, negative conditional: 9, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70, positive: 17, positive conditional: 2, positive unconditional: 15, negative: 53, negative conditional: 18, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 700, positive: 500, positive conditional: 2, positive unconditional: 498, negative: 53, negative conditional: 17, negative unconditional: 36, unknown: 147, unknown conditional: 11, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 128, Positive conditional cache size: 2, Positive unconditional cache size: 126, Negative cache size: 19, Negative conditional cache size: 9, Negative unconditional cache size: 10, Eliminated conditions: 6, Maximal queried relation: 3, Independence queries for same thread: 225 - CounterExampleResult [Line: 34]: assertion can be violated assertion can be violated We found a FailurePath: [L17] 0 assume 0 <= m && m < N; VAL [m=1, N=3] [L19] 0 i := 0; VAL [i=0, m=1, N=3] [L21] FORK 0 fork 1 thread1(); VAL [i=0, m=1, N=3] [L42] 1 havoc i; VAL [m=1, N=3] [L43] COND TRUE 1 0 <= i && i < N VAL [i=0, m=1, N=3] [L44] 1 A := A[i := (if A[i] < 0 then 0 else A[i])]; VAL [i=0, m=1, N=3] [L22] FORK 0 fork 4, 4, 4, 4 thread1(); VAL [i=0, m=1, N=3] [L42] 2 havoc i; VAL [m=1, N=3] [L43] COND TRUE 2 0 <= i && i < N VAL [i=0, m=1, N=3] [L23] FORK 0 fork 5, 5, 5, 5, 5 thread1(); VAL [i=0, m=1, N=3] [L42] 3 havoc i; VAL [m=1, N=3] [L44] 2 A := A[i := (if A[i] < 0 then 0 else A[i])]; VAL [i=0, m=1, N=3] [L42] 2 havoc i; VAL [m=1, N=3] [L43] COND TRUE 2 0 <= i && i < N VAL [i=1, m=1, N=3] [L44] 2 A := A[i := (if A[i] < 0 then 0 else A[i])]; VAL [i=1, m=1, N=3] [L42] 2 havoc i; VAL [m=1, N=3] [L43] COND FALSE 2 !(0 <= i && i < N) VAL [i=3, m=1, N=3] [L43] COND FALSE 3 !(0 <= i && i < N) VAL [i=3, m=1, N=3] [L42] 3 havoc i; VAL [m=1, N=3] [L43] COND TRUE 3 0 <= i && i < N VAL [i=2, m=1, N=3] [L44] 3 A := A[i := (if A[i] < 0 then 0 else A[i])]; VAL [i=2, m=1, N=3] [L24] FORK 0 fork 6, 6, 6, 6, 6, 6 thread1(); VAL [i=2, m=1, N=3] [L42] 4 havoc i; VAL [m=1, N=3] [L43] COND TRUE 4 0 <= i && i < N VAL [i=1, m=1, N=3] [L25] FORK 0 fork 2, 2 thread2(); VAL [i=1, m=1, N=3] [L54] 5 cnt := 0; VAL [cnt=0, i=1, m=1, N=3] [L44] 4 A := A[i := (if A[i] < 0 then 0 else A[i])]; VAL [cnt=0, i=1, m=1, N=3] [L42] 4 havoc i; VAL [cnt=0, m=1, N=3] [L43] COND TRUE 4 0 <= i && i < N VAL [cnt=0, i=1, m=1, N=3] [L44] 4 A := A[i := (if A[i] < 0 then 0 else A[i])]; VAL [cnt=0, i=1, m=1, N=3] [L56] 5 j := 0; VAL [cnt=0, i=1, j=0, m=1, N=3] [L26] FORK 0 fork 3, 3, 3 thread3(); VAL [cnt=0, i=1, j=0, m=1, N=3] [L76] 6 havoc k; VAL [cnt=0, i=1, j=0, m=1, N=3] [L77] COND TRUE 6 0 <= k && k < N VAL [cnt=0, i=1, j=0, k=2, m=1, N=3] [L27] JOIN 1 join 1; VAL [cnt=0, i=1, j=0, k=2, m=1, N=3] [L28] JOIN 2 join 4, 4, 4, 4; VAL [cnt=0, i=1, j=0, k=2, m=1, N=3] [L78] 6 B[k] := k; VAL [cnt=0, i=1, j=0, k=2, m=1, N=3] [L76] 6 havoc k; VAL [cnt=0, i=1, j=0, m=1, N=3] [L77] COND TRUE 6 0 <= k && k < N VAL [cnt=0, i=1, j=0, k=2, m=1, N=3] [L78] 6 B[k] := k; VAL [cnt=0, i=1, j=0, k=2, m=1, N=3] [L29] JOIN 3 join 5, 5, 5, 5, 5; VAL [cnt=0, i=1, j=0, k=2, m=1, N=3] [L30] JOIN 4 join 6, 6, 6, 6, 6, 6; VAL [cnt=0, i=1, j=0, k=2, m=1, N=3] [L57] COND TRUE 5 j < N VAL [cnt=0, i=1, j=0, k=2, m=1, N=3] [L58] COND TRUE 5 A[j] > 0 && B[j] > 0 VAL [cnt=0, i=1, j=0, k=2, m=1, N=3] [L59] 5 cnt := cnt + 1; VAL [cnt=1, i=1, j=0, k=2, m=1, N=3] [L65] 5 j := j + 1; VAL [cnt=1, i=1, j=1, k=2, m=1, N=3] [L57] COND TRUE 5 j < N VAL [cnt=1, i=1, j=1, k=2, m=1, N=3] [L58] COND FALSE 5 !(A[j] > 0 && B[j] > 0) VAL [cnt=1, i=1, j=1, k=2, m=1, N=3] [L65] 5 j := j + 1; VAL [cnt=1, i=1, j=2, k=2, m=1, N=3] [L57] COND TRUE 5 j < N VAL [cnt=1, i=1, j=2, k=2, m=1, N=3] [L58] COND TRUE 5 A[j] > 0 && B[j] > 0 VAL [cnt=1, i=1, j=2, k=2, m=1, N=3] [L59] 5 cnt := cnt + 1; VAL [cnt=2, i=1, j=2, k=2, m=1, N=3] [L65] 5 j := j + 1; VAL [cnt=2, i=1, j=3, k=2, m=1, N=3] [L57] COND FALSE 5 !(j < N) VAL [cnt=2, i=1, j=3, k=2, m=1, N=3] [L31] JOIN 5 join 2, 2 assign result; VAL [cnt=2, i=1, j=3, k=2, m=1, N=3, result=2] [L32] JOIN 6 join 3, 3, 3; VAL [cnt=2, i=1, j=3, k=2, m=1, N=3, result=2] [L34] 0 assert result >= 1 ==> A[m] > 0 && B[m] > 0; VAL [cnt=2, i=1, j=3, k=2, m=1, N=3, result=2] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 10 procedures, 68 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 1.3s, 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: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 1972 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 154/169 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-10-06 03:54:14,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-10-06 03:54:14,631 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 0 Received shutdown request...