/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking FORWARD --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 00:46:27,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 00:46:27,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 00:46:27,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 00:46:27,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 00:46:27,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 00:46:27,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 00:46:27,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 00:46:27,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 00:46:27,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 00:46:27,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 00:46:27,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 00:46:27,745 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 00:46:27,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 00:46:27,746 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 00:46:27,746 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 00:46:27,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 00:46:27,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 00:46:27,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 00:46:27,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 00:46:27,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 00:46:27,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 00:46:27,752 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 00:46:27,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 00:46:27,755 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 00:46:27,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 00:46:27,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 00:46:27,755 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 00:46:27,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 00:46:27,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 00:46:27,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 00:46:27,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 00:46:27,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 00:46:27,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 00:46:27,757 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 00:46:27,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 00:46:27,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 00:46:27,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 00:46:27,757 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 00:46:27,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-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: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> FORWARD Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 00:46:27,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 00:46:27,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 00:46:27,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 00:46:27,989 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 00:46:27,989 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 00:46:27,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-05-07 00:46:29,113 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 00:46:29,311 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 00:46:29,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-05-07 00:46:29,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6b761589a/a9dd18e1c4254466ac5d2e612c34e91c/FLAG59e47814a [2024-05-07 00:46:29,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6b761589a/a9dd18e1c4254466ac5d2e612c34e91c [2024-05-07 00:46:29,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 00:46:29,341 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 00:46:29,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 00:46:29,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 00:46:29,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 00:46:29,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:46:29" (1/1) ... [2024-05-07 00:46:29,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@341f32c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:46:29, skipping insertion in model container [2024-05-07 00:46:29,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:46:29" (1/1) ... [2024-05-07 00:46:29,385 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 00:46:29,519 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2024-05-07 00:46:29,671 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 00:46:29,682 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 00:46:29,691 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2024-05-07 00:46:29,730 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 00:46:29,756 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 00:46:29,756 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 00:46:29,761 INFO L206 MainTranslator]: Completed translation [2024-05-07 00:46:29,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:46:29 WrapperNode [2024-05-07 00:46:29,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 00:46:29,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 00:46:29,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 00:46:29,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 00:46:29,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:46:29" (1/1) ... [2024-05-07 00:46:29,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:46:29" (1/1) ... [2024-05-07 00:46:29,811 INFO L138 Inliner]: procedures = 177, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2024-05-07 00:46:29,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 00:46:29,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 00:46:29,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 00:46:29,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 00:46:29,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:46:29" (1/1) ... [2024-05-07 00:46:29,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:46:29" (1/1) ... [2024-05-07 00:46:29,831 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:46:29" (1/1) ... [2024-05-07 00:46:29,831 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:46:29" (1/1) ... [2024-05-07 00:46:29,834 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:46:29" (1/1) ... [2024-05-07 00:46:29,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:46:29" (1/1) ... [2024-05-07 00:46:29,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:46:29" (1/1) ... [2024-05-07 00:46:29,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:46:29" (1/1) ... [2024-05-07 00:46:29,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 00:46:29,839 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 00:46:29,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 00:46:29,839 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 00:46:29,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:46:29" (1/1) ... [2024-05-07 00:46:29,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 00:46:29,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 00:46:29,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-07 00:46:29,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-07 00:46:29,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 00:46:29,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 00:46:29,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 00:46:29,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 00:46:29,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 00:46:29,962 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-07 00:46:29,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-07 00:46:29,963 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-07 00:46:29,963 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-07 00:46:29,963 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-07 00:46:29,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-07 00:46:29,964 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-05-07 00:46:29,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-05-07 00:46:29,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 00:46:29,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 00:46:29,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 00:46:29,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 00:46:29,966 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 00:46:30,147 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 00:46:30,149 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 00:46:30,304 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 00:46:30,313 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 00:46:30,314 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-07 00:46:30,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:46:30 BoogieIcfgContainer [2024-05-07 00:46:30,315 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 00:46:30,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 00:46:30,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 00:46:30,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 00:46:30,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 12:46:29" (1/3) ... [2024-05-07 00:46:30,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf0fd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:46:30, skipping insertion in model container [2024-05-07 00:46:30,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:46:29" (2/3) ... [2024-05-07 00:46:30,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf0fd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:46:30, skipping insertion in model container [2024-05-07 00:46:30,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:46:30" (3/3) ... [2024-05-07 00:46:30,320 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-05-07 00:46:30,329 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 00:46:30,336 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 00:46:30,336 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 00:46:30,336 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 00:46:30,405 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-07 00:46:30,441 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 00:46:30,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 00:46:30,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 00:46:30,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 00:46:30,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-07 00:46:30,469 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 00:46:30,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:46:30,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 00:46:30,484 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=LoopHeads, 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;@2c19fc3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 00:46:30,484 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-07 00:46:30,528 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 00:46:30,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:46:30,530 INFO L85 PathProgramCache]: Analyzing trace with hash -489783755, now seen corresponding path program 1 times [2024-05-07 00:46:30,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:46:30,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904132799] [2024-05-07 00:46:30,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:30,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:46:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:46:30,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:46:30,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904132799] [2024-05-07 00:46:30,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904132799] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:46:30,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:46:30,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 00:46:30,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377286904] [2024-05-07 00:46:30,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:46:30,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 00:46:30,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:46:30,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 00:46:30,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 00:46:30,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:30,843 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:46:30,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 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) [2024-05-07 00:46:30,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:30,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:30,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 00:46:30,887 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 00:46:30,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:46:30,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1533697176, now seen corresponding path program 1 times [2024-05-07 00:46:30,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:46:30,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714114054] [2024-05-07 00:46:30,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:30,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:46:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:46:31,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:46:31,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714114054] [2024-05-07 00:46:31,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714114054] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:46:31,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:46:31,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 00:46:31,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177726730] [2024-05-07 00:46:31,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:46:31,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 00:46:31,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:46:31,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 00:46:31,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-07 00:46:31,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:31,335 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:46:31,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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) [2024-05-07 00:46:31,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:31,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:31,696 INFO L85 PathProgramCache]: Analyzing trace with hash -719748133, now seen corresponding path program 1 times [2024-05-07 00:46:31,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:31,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:46:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:46:31,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:31,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:46:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:46:32,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-07 00:46:32,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-07 00:46:32,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2134065697, now seen corresponding path program 1 times [2024-05-07 00:46:32,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:32,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:32,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:32,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 00:46:32,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-07 00:46:32,395 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 00:46:32,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:46:32,395 INFO L85 PathProgramCache]: Analyzing trace with hash -833427942, now seen corresponding path program 1 times [2024-05-07 00:46:32,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:46:32,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014610052] [2024-05-07 00:46:32,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:32,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:46:32,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:46:32,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:46:32,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014610052] [2024-05-07 00:46:32,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014610052] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:46:32,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:46:32,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 00:46:32,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728566023] [2024-05-07 00:46:32,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:46:32,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 00:46:32,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:46:32,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 00:46:32,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-07 00:46:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:32,576 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:46:32,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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) [2024-05-07 00:46:32,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:32,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 00:46:32,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:32,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2134065697, now seen corresponding path program 2 times [2024-05-07 00:46:32,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:32,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:32,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:32,813 INFO L85 PathProgramCache]: Analyzing trace with hash 820877376, now seen corresponding path program 1 times [2024-05-07 00:46:32,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:32,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:32,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:32,903 INFO L85 PathProgramCache]: Analyzing trace with hash -440646050, now seen corresponding path program 1 times [2024-05-07 00:46:32,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:32,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:32,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:33,226 INFO L85 PathProgramCache]: Analyzing trace with hash -390698447, now seen corresponding path program 1 times [2024-05-07 00:46:33,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:33,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:33,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:33,328 INFO L85 PathProgramCache]: Analyzing trace with hash -289697790, now seen corresponding path program 1 times [2024-05-07 00:46:33,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:33,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:33,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:33,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1099033609, now seen corresponding path program 1 times [2024-05-07 00:46:33,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:33,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:33,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:33,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1072925954, now seen corresponding path program 1 times [2024-05-07 00:46:33,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:33,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:33,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:33,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1766504862, now seen corresponding path program 1 times [2024-05-07 00:46:33,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:33,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:33,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:33,720 INFO L85 PathProgramCache]: Analyzing trace with hash -774299938, now seen corresponding path program 1 times [2024-05-07 00:46:33,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:33,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:33,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:33,867 INFO L85 PathProgramCache]: Analyzing trace with hash 390664574, now seen corresponding path program 1 times [2024-05-07 00:46:33,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:33,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:33,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:33,934 INFO L85 PathProgramCache]: Analyzing trace with hash 12602098, now seen corresponding path program 1 times [2024-05-07 00:46:33,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:33,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:33,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:34,068 INFO L85 PathProgramCache]: Analyzing trace with hash 240582786, now seen corresponding path program 1 times [2024-05-07 00:46:34,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:34,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:34,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:34,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2005857597, now seen corresponding path program 1 times [2024-05-07 00:46:34,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:34,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:34,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:34,326 INFO L85 PathProgramCache]: Analyzing trace with hash -854269330, now seen corresponding path program 1 times [2024-05-07 00:46:34,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:34,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:34,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:34,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1967219675, now seen corresponding path program 1 times [2024-05-07 00:46:34,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:34,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:34,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:35,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2137439031, now seen corresponding path program 1 times [2024-05-07 00:46:35,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:35,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:35,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:35,497 INFO L85 PathProgramCache]: Analyzing trace with hash -69597636, now seen corresponding path program 1 times [2024-05-07 00:46:35,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:35,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:35,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:35,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2080455025, now seen corresponding path program 1 times [2024-05-07 00:46:35,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:35,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:35,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:35,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1729679432, now seen corresponding path program 1 times [2024-05-07 00:46:35,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:35,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:35,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:35,708 INFO L85 PathProgramCache]: Analyzing trace with hash -332890716, now seen corresponding path program 1 times [2024-05-07 00:46:35,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:35,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:35,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:35,767 INFO L85 PathProgramCache]: Analyzing trace with hash -842022376, now seen corresponding path program 1 times [2024-05-07 00:46:35,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:35,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:35,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:35,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1219763972, now seen corresponding path program 1 times [2024-05-07 00:46:35,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:35,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:35,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:35,935 INFO L85 PathProgramCache]: Analyzing trace with hash 177894572, now seen corresponding path program 1 times [2024-05-07 00:46:35,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:35,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:35,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:36,021 INFO L85 PathProgramCache]: Analyzing trace with hash -751241746, now seen corresponding path program 1 times [2024-05-07 00:46:36,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:36,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:36,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:36,149 INFO L85 PathProgramCache]: Analyzing trace with hash -301328219, now seen corresponding path program 1 times [2024-05-07 00:46:36,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:36,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:36,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:39,118 INFO L85 PathProgramCache]: Analyzing trace with hash 580958151, now seen corresponding path program 1 times [2024-05-07 00:46:39,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:39,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:39,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:39,177 INFO L85 PathProgramCache]: Analyzing trace with hash -500931669, now seen corresponding path program 1 times [2024-05-07 00:46:39,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:39,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:39,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:39,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1230768664, now seen corresponding path program 1 times [2024-05-07 00:46:39,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:39,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:39,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:39,293 INFO L85 PathProgramCache]: Analyzing trace with hash -930127597, now seen corresponding path program 1 times [2024-05-07 00:46:39,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:39,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:39,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:39,440 INFO L85 PathProgramCache]: Analyzing trace with hash -999835044, now seen corresponding path program 1 times [2024-05-07 00:46:39,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:39,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:39,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:39,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1491769950, now seen corresponding path program 1 times [2024-05-07 00:46:39,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:39,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:39,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:39,532 INFO L85 PathProgramCache]: Analyzing trace with hash 879406652, now seen corresponding path program 1 times [2024-05-07 00:46:39,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:39,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:39,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:46:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:46:39,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:39,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-07 00:46:39,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:46:39,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable32,SelfDestructingSolverStorable11,SelfDestructingSolverStorable33,SelfDestructingSolverStorable12,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable35,SelfDestructingSolverStorable14,SelfDestructingSolverStorable36,SelfDestructingSolverStorable15,SelfDestructingSolverStorable37,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 00:46:39,557 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 00:46:39,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:46:39,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1756601824, now seen corresponding path program 2 times [2024-05-07 00:46:39,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:46:39,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961373308] [2024-05-07 00:46:39,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:39,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:46:39,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:46:39,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:46:39,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961373308] [2024-05-07 00:46:39,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961373308] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:46:39,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:46:39,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-07 00:46:39,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255293822] [2024-05-07 00:46:39,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:46:39,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-07 00:46:39,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:46:39,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 00:46:39,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-07 00:46:39,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:39,703 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:46:39,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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) [2024-05-07 00:46:39,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:39,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-07 00:46:39,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:46:39,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:44,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:44,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-07 00:46:44,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:46:44,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-07 00:46:44,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-07 00:46:44,711 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-07 00:46:44,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:46:44,711 INFO L85 PathProgramCache]: Analyzing trace with hash 49585030, now seen corresponding path program 3 times [2024-05-07 00:46:44,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:46:44,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323797227] [2024-05-07 00:46:44,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:46:44,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:46:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:46:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:46:44,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:46:44,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323797227] [2024-05-07 00:46:44,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323797227] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:46:44,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:46:44,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-07 00:46:44,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448312889] [2024-05-07 00:46:44,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:46:44,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-07 00:46:44,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:46:44,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 00:46:44,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-07 00:46:44,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:44,861 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:46:44,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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) [2024-05-07 00:46:44,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:44,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-07 00:46:44,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:46:44,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-07 00:46:44,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:53,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:46:53,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-07 00:46:53,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:46:53,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-07 00:46:53,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-07 00:46:53,603 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-07 00:46:53,607 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-05-07 00:46:53,607 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-07 00:46:53,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-07 00:46:53,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-05-07 00:46:53,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-07 00:46:53,618 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-07 00:46:53,620 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 00:46:53,620 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 00:46:53,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 12:46:53 BasicIcfg [2024-05-07 00:46:53,626 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 00:46:53,632 INFO L158 Benchmark]: Toolchain (without parser) took 24285.29ms. Allocated memory was 324.0MB in the beginning and 3.7GB in the end (delta: 3.4GB). Free memory was 254.1MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 343.7MB. Max. memory is 8.0GB. [2024-05-07 00:46:53,632 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 324.0MB. Free memory is still 290.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 00:46:53,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.43ms. Allocated memory is still 324.0MB. Free memory was 253.8MB in the beginning and 233.1MB in the end (delta: 20.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-05-07 00:46:53,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.38ms. Allocated memory is still 324.0MB. Free memory was 233.1MB in the beginning and 231.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 00:46:53,634 INFO L158 Benchmark]: Boogie Preprocessor took 26.37ms. Allocated memory is still 324.0MB. Free memory was 231.0MB in the beginning and 229.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 00:46:53,634 INFO L158 Benchmark]: RCFGBuilder took 475.95ms. Allocated memory is still 324.0MB. Free memory was 229.2MB in the beginning and 280.7MB in the end (delta: -51.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-05-07 00:46:53,634 INFO L158 Benchmark]: TraceAbstraction took 23309.22ms. Allocated memory was 324.0MB in the beginning and 3.7GB in the end (delta: 3.4GB). Free memory was 279.7MB in the beginning and 3.3GB in the end (delta: -3.0GB). Peak memory consumption was 369.3MB. Max. memory is 8.0GB. [2024-05-07 00:46:53,639 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 324.0MB. Free memory is still 290.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 420.43ms. Allocated memory is still 324.0MB. Free memory was 253.8MB in the beginning and 233.1MB in the end (delta: 20.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.38ms. Allocated memory is still 324.0MB. Free memory was 233.1MB in the beginning and 231.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.37ms. Allocated memory is still 324.0MB. Free memory was 231.0MB in the beginning and 229.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 475.95ms. Allocated memory is still 324.0MB. Free memory was 229.2MB in the beginning and 280.7MB in the end (delta: -51.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 23309.22ms. Allocated memory was 324.0MB in the beginning and 3.7GB in the end (delta: 3.4GB). Free memory was 279.7MB in the beginning and 3.3GB in the end (delta: -3.0GB). Peak memory consumption was 369.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1655672, independent: 1636778, independent conditional: 1636573, independent unconditional: 205, dependent: 18894, dependent conditional: 18894, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1655288, independent: 1636778, independent conditional: 1636573, independent unconditional: 205, dependent: 18510, dependent conditional: 18510, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1655288, independent: 1636778, independent conditional: 1636573, independent unconditional: 205, dependent: 18510, dependent conditional: 18510, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1655288, independent: 1636778, independent conditional: 1636573, independent unconditional: 205, dependent: 18510, dependent conditional: 18510, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1711213, independent: 1636778, independent conditional: 787659, independent unconditional: 849119, dependent: 74435, dependent conditional: 55842, dependent unconditional: 18593, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1711213, independent: 1636778, independent conditional: 419712, independent unconditional: 1217066, dependent: 74435, dependent conditional: 21605, dependent unconditional: 52830, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1711213, independent: 1636778, independent conditional: 419712, independent unconditional: 1217066, dependent: 74435, dependent conditional: 21605, dependent unconditional: 52830, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1755, independent: 1723, independent conditional: 334, independent unconditional: 1389, dependent: 32, dependent conditional: 16, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1755, independent: 1685, independent conditional: 0, independent unconditional: 1685, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 70, independent: 38, independent conditional: 27, independent unconditional: 11, dependent: 32, dependent conditional: 16, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 38, independent conditional: 27, independent unconditional: 11, dependent: 32, dependent conditional: 16, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, independent: 40, independent conditional: 32, independent unconditional: 8, dependent: 61, dependent conditional: 48, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1711213, independent: 1635055, independent conditional: 419378, independent unconditional: 1215677, dependent: 74403, dependent conditional: 21589, dependent unconditional: 52814, unknown: 1755, unknown conditional: 350, unknown unconditional: 1405] , Statistics on independence cache: Total cache size (in pairs): 1755, Positive cache size: 1723, Positive conditional cache size: 334, Positive unconditional cache size: 1389, Negative cache size: 32, Negative conditional cache size: 16, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 402184, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1711213, independent: 1636778, independent conditional: 787659, independent unconditional: 849119, dependent: 74435, dependent conditional: 55842, dependent unconditional: 18593, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1711213, independent: 1636778, independent conditional: 419712, independent unconditional: 1217066, dependent: 74435, dependent conditional: 21605, dependent unconditional: 52830, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1711213, independent: 1636778, independent conditional: 419712, independent unconditional: 1217066, dependent: 74435, dependent conditional: 21605, dependent unconditional: 52830, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1755, independent: 1723, independent conditional: 334, independent unconditional: 1389, dependent: 32, dependent conditional: 16, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1755, independent: 1685, independent conditional: 0, independent unconditional: 1685, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 70, independent: 38, independent conditional: 27, independent unconditional: 11, dependent: 32, dependent conditional: 16, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 38, independent conditional: 27, independent unconditional: 11, dependent: 32, dependent conditional: 16, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, independent: 40, independent conditional: 32, independent unconditional: 8, dependent: 61, dependent conditional: 48, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1711213, independent: 1635055, independent conditional: 419378, independent unconditional: 1215677, dependent: 74403, dependent conditional: 21589, dependent unconditional: 52814, unknown: 1755, unknown conditional: 350, unknown unconditional: 1405] , Statistics on independence cache: Total cache size (in pairs): 1755, Positive cache size: 1723, Positive conditional cache size: 334, Positive unconditional cache size: 1389, Negative cache size: 32, Negative conditional cache size: 16, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 402184 ], Independence queries for same thread: 384 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 140 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 23.2s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 21.9s, 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: 44, 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.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 396 ConstructedInterpolants, 0 QuantifiedInterpolants, 1644 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 7.3s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 91, ConditionalCommutativityTraceChecks: 34, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-07 00:46:53,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-07 00:46:53,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...