/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 RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 --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/rfi002_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 12:29:40,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 12:29:40,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 12:29:40,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 12:29:40,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 12:29:40,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 12:29:40,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 12:29:40,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 12:29:40,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 12:29:40,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 12:29:40,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 12:29:40,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 12:29:40,627 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 12:29:40,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 12:29:40,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 12:29:40,628 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 12:29:40,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 12:29:40,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 12:29:40,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 12:29:40,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 12:29:40,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 12:29:40,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 12:29:40,630 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 12:29:40,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 12:29:40,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 12:29:40,631 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 12:29:40,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 12:29:40,631 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 12:29:40,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 12:29:40,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 12:29:40,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 12:29:40,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 12:29:40,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 12:29:40,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 12:29:40,633 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 12:29:40,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 12:29:40,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 12:29:40,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 12:29:40,634 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 12:29:40,634 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 -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 50 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 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 12:29:40,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 12:29:40,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 12:29:40,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 12:29:40,962 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 12:29:40,962 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 12:29:40,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_tso.i [2024-05-07 12:29:42,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 12:29:42,428 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 12:29:42,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_tso.i [2024-05-07 12:29:42,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1aed5221c/9c24f98b55b840a7b89bac990653620b/FLAG42e58e40a [2024-05-07 12:29:42,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1aed5221c/9c24f98b55b840a7b89bac990653620b [2024-05-07 12:29:42,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 12:29:42,458 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 12:29:42,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 12:29:42,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 12:29:42,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 12:29:42,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:29:42" (1/1) ... [2024-05-07 12:29:42,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fab9291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:42, skipping insertion in model container [2024-05-07 12:29:42,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:29:42" (1/1) ... [2024-05-07 12:29:42,518 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 12:29:42,683 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/rfi002_tso.i[987,1000] [2024-05-07 12:29:42,966 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 12:29:42,982 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 12:29:42,997 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/rfi002_tso.i[987,1000] [2024-05-07 12:29:43,054 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 12:29:43,085 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 12:29:43,085 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 12:29:43,093 INFO L206 MainTranslator]: Completed translation [2024-05-07 12:29:43,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:43 WrapperNode [2024-05-07 12:29:43,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 12:29:43,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 12:29:43,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 12:29:43,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 12:29:43,127 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:29:43" (1/1) ... [2024-05-07 12:29:43,212 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:29:43" (1/1) ... [2024-05-07 12:29:43,252 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 208 [2024-05-07 12:29:43,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 12:29:43,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 12:29:43,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 12:29:43,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 12:29:43,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:43" (1/1) ... [2024-05-07 12:29:43,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:43" (1/1) ... [2024-05-07 12:29:43,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:43" (1/1) ... [2024-05-07 12:29:43,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:43" (1/1) ... [2024-05-07 12:29:43,287 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:43" (1/1) ... [2024-05-07 12:29:43,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:43" (1/1) ... [2024-05-07 12:29:43,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:43" (1/1) ... [2024-05-07 12:29:43,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:43" (1/1) ... [2024-05-07 12:29:43,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 12:29:43,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 12:29:43,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 12:29:43,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 12:29:43,316 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:43" (1/1) ... [2024-05-07 12:29:43,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 12:29:43,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 12:29:43,350 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 12:29:43,359 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 12:29:43,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 12:29:43,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 12:29:43,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 12:29:43,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 12:29:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 12:29:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-07 12:29:43,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-07 12:29:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-07 12:29:43,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-07 12:29:43,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 12:29:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 12:29:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 12:29:43,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 12:29:43,397 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 12:29:43,524 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 12:29:43,526 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 12:29:43,941 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 12:29:44,143 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 12:29:44,143 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-07 12:29:44,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:29:44 BoogieIcfgContainer [2024-05-07 12:29:44,145 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 12:29:44,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 12:29:44,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 12:29:44,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 12:29:44,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 12:29:42" (1/3) ... [2024-05-07 12:29:44,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498a62ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:29:44, skipping insertion in model container [2024-05-07 12:29:44,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:29:43" (2/3) ... [2024-05-07 12:29:44,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498a62ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:29:44, skipping insertion in model container [2024-05-07 12:29:44,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:29:44" (3/3) ... [2024-05-07 12:29:44,155 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi002_tso.i [2024-05-07 12:29:44,163 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 12:29:44,172 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 12:29:44,173 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-05-07 12:29:44,173 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 12:29:44,234 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-07 12:29:44,282 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 12:29:44,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 12:29:44,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 12:29:44,288 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 12:29:44,316 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 12:29:44,338 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 12:29:44,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 12:29:44,354 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 12:29:44,361 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;@4a8df937, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-05-07 12:29:44,361 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-07 12:29:44,404 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-05-07 12:29:44,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 12:29:44,407 INFO L85 PathProgramCache]: Analyzing trace with hash -904272231, now seen corresponding path program 1 times [2024-05-07 12:29:44,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 12:29:44,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241371805] [2024-05-07 12:29:44,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:29:44,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:29:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:29:44,965 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 12:29:44,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 12:29:44,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241371805] [2024-05-07 12:29:44,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241371805] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 12:29:44,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 12:29:44,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 12:29:44,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351757432] [2024-05-07 12:29:44,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 12:29:44,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-07 12:29:44,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 12:29:44,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-07 12:29:44,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-07 12:29:44,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:29:44,998 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 12:29:45,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 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 12:29:45,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:29:45,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:29:45,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 12:29:45,045 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-05-07 12:29:45,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 12:29:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2032332449, now seen corresponding path program 1 times [2024-05-07 12:29:45,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 12:29:45,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922150607] [2024-05-07 12:29:45,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:29:45,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:29:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:29:45,212 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 12:29:45,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 12:29:45,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922150607] [2024-05-07 12:29:45,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922150607] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 12:29:45,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 12:29:45,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 12:29:45,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595884115] [2024-05-07 12:29:45,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 12:29:45,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-07 12:29:45,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 12:29:45,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-07 12:29:45,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-07 12:29:45,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:29:45,216 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 12:29:45,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 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 12:29:45,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:29:45,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:29:45,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:29:45,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:29:45,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-07 12:29:45,320 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-05-07 12:29:45,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 12:29:45,321 INFO L85 PathProgramCache]: Analyzing trace with hash -119744269, now seen corresponding path program 1 times [2024-05-07 12:29:45,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 12:29:45,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872857935] [2024-05-07 12:29:45,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:29:45,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:29:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:29:46,257 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 12:29:46,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 12:29:46,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872857935] [2024-05-07 12:29:46,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872857935] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 12:29:46,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 12:29:46,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 12:29:46,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891232030] [2024-05-07 12:29:46,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 12:29:46,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 12:29:46,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 12:29:46,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 12:29:46,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-07 12:29:46,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:29:46,264 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 12:29:46,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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 12:29:46,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:29:46,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:29:46,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:29:50,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1917373038, now seen corresponding path program 1 times [2024-05-07 12:29:50,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:29:50,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:29:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:29:50,738 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 12:29:50,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:29:50,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:29:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:29:51,043 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 12:29:51,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 12:29:51,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-07 12:29:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2028573162, now seen corresponding path program 1 times [2024-05-07 12:29:51,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:29:51,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:29:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:29:51,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:29:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:29:51,609 INFO L85 PathProgramCache]: Analyzing trace with hash -166793021, now seen corresponding path program 1 times [2024-05-07 12:29:51,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:29:51,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:29:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:29:51,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:29:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:29:54,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1968943095, now seen corresponding path program 1 times [2024-05-07 12:29:54,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:29:54,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:29:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:29:54,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:29:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:30:01,704 INFO L85 PathProgramCache]: Analyzing trace with hash 907694298, now seen corresponding path program 1 times [2024-05-07 12:30:01,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:30:01,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:30:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:30:01,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:30:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:30:08,497 INFO L85 PathProgramCache]: Analyzing trace with hash 415875227, now seen corresponding path program 1 times [2024-05-07 12:30:08,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:30:08,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:30:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:30:08,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:30:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:30:10,587 INFO L85 PathProgramCache]: Analyzing trace with hash -352127678, now seen corresponding path program 1 times [2024-05-07 12:30:10,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:30:10,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:30:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:30:10,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:30:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:30:25,868 INFO L85 PathProgramCache]: Analyzing trace with hash 907733731, now seen corresponding path program 1 times [2024-05-07 12:30:25,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:30:25,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:30:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:30:25,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:30:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:30:37,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1969000137, now seen corresponding path program 1 times [2024-05-07 12:30:37,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:30:37,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:30:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:30:37,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:30:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:30:39,591 INFO L85 PathProgramCache]: Analyzing trace with hash 531476634, now seen corresponding path program 1 times [2024-05-07 12:30:39,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:30:39,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:30:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:30:39,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:30:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:30:44,835 INFO L85 PathProgramCache]: Analyzing trace with hash -704093033, now seen corresponding path program 1 times [2024-05-07 12:30:44,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:30:44,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:30:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:30:44,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:30:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:30:57,137 INFO L85 PathProgramCache]: Analyzing trace with hash -352047045, now seen corresponding path program 1 times [2024-05-07 12:30:57,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:30:57,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:30:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:30:57,156 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:30:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:31:02,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1971443992, now seen corresponding path program 1 times [2024-05-07 12:31:02,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:31:02,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:31:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:31:02,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:31:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:31:04,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1645423519, now seen corresponding path program 1 times [2024-05-07 12:31:04,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:31:04,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:31:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:31:04,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:31:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:31:16,037 INFO L85 PathProgramCache]: Analyzing trace with hash -704020926, now seen corresponding path program 1 times [2024-05-07 12:31:16,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:31:16,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:31:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:31:16,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:31:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:31:21,406 INFO L85 PathProgramCache]: Analyzing trace with hash -349811727, now seen corresponding path program 1 times [2024-05-07 12:31:21,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:31:21,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:31:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:31:22,205 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 12:31:22,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:31:22,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:31:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:31:22,760 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 12:31:22,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 12:31:22,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2024-05-07 12:31:22,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1186708862, now seen corresponding path program 1 times [2024-05-07 12:31:22,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:31:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:31:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:31:22,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:31:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:31:23,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2028573162, now seen corresponding path program 2 times [2024-05-07 12:31:23,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:31:23,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:31:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:31:23,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:31:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:31:36,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1926247336, now seen corresponding path program 1 times [2024-05-07 12:31:36,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:31:36,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:31:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:31:36,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:31:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:32:04,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1055300546, now seen corresponding path program 1 times [2024-05-07 12:32:04,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:32:04,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:32:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:32:04,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:32:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:32:26,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1055325038, now seen corresponding path program 1 times [2024-05-07 12:32:26,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:32:26,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:32:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:32:26,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:32:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:32:49,679 INFO L85 PathProgramCache]: Analyzing trace with hash -87803856, now seen corresponding path program 1 times [2024-05-07 12:32:49,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:32:49,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:32:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:32:49,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:32:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:33:30,131 INFO L85 PathProgramCache]: Analyzing trace with hash -397799263, now seen corresponding path program 1 times [2024-05-07 12:33:30,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:33:30,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:33:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:33:30,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:33:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:04,044 INFO L85 PathProgramCache]: Analyzing trace with hash -576874982, now seen corresponding path program 1 times [2024-05-07 12:34:04,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:34:04,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:34:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:04,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:34:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1681097077, now seen corresponding path program 1 times [2024-05-07 12:34:26,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:34:26,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:34:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:26,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:34:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:26,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:34:26,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:34:26,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 12:34:26,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable2,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 12:34:26,226 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-05-07 12:34:26,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 12:34:26,226 INFO L85 PathProgramCache]: Analyzing trace with hash -98869508, now seen corresponding path program 1 times [2024-05-07 12:34:26,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 12:34:26,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705305215] [2024-05-07 12:34:26,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:34:26,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:34:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 12:34:27,493 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 12:34:27,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 12:34:27,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705305215] [2024-05-07 12:34:27,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705305215] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 12:34:27,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 12:34:27,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-05-07 12:34:27,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995018434] [2024-05-07 12:34:27,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 12:34:27,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-05-07 12:34:27,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 12:34:27,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-05-07 12:34:27,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-05-07 12:34:27,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:34:27,496 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 12:34:27,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 15 states have internal predecessors, (89), 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 12:34:27,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:34:27,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:34:27,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 12:34:27,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 12:34:27,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1186708862, now seen corresponding path program 2 times [2024-05-07 12:34:27,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:34:27,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:34:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:27,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:34:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:28,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2028573162, now seen corresponding path program 3 times [2024-05-07 12:34:28,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:34:28,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:34:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:28,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:34:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:28,334 INFO L85 PathProgramCache]: Analyzing trace with hash -166793021, now seen corresponding path program 2 times [2024-05-07 12:34:28,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:34:28,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:34:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:28,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:34:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:29,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1968943095, now seen corresponding path program 2 times [2024-05-07 12:34:29,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:34:29,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:34:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:29,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:34:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:35,065 INFO L85 PathProgramCache]: Analyzing trace with hash -352127678, now seen corresponding path program 2 times [2024-05-07 12:34:35,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:34:35,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:34:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:35,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:34:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:36,630 INFO L85 PathProgramCache]: Analyzing trace with hash -704095576, now seen corresponding path program 1 times [2024-05-07 12:34:36,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:34:36,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:34:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:36,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:34:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:50,933 INFO L85 PathProgramCache]: Analyzing trace with hash -352047045, now seen corresponding path program 2 times [2024-05-07 12:34:50,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:34:50,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:34:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:50,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:34:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:52,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1645423519, now seen corresponding path program 2 times [2024-05-07 12:34:52,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:34:52,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:34:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:52,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:34:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:53,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1055300546, now seen corresponding path program 2 times [2024-05-07 12:34:53,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:34:53,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:34:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:34:53,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:34:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash 531558755, now seen corresponding path program 1 times [2024-05-07 12:35:01,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:35:01,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:35:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:01,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:35:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:22,547 INFO L85 PathProgramCache]: Analyzing trace with hash 551396363, now seen corresponding path program 1 times [2024-05-07 12:35:22,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:35:22,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:35:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:22,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:35:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:32,970 INFO L85 PathProgramCache]: Analyzing trace with hash 553125605, now seen corresponding path program 2 times [2024-05-07 12:35:32,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:35:32,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:35:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:32,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:35:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:48,872 INFO L85 PathProgramCache]: Analyzing trace with hash -395355037, now seen corresponding path program 3 times [2024-05-07 12:35:48,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:35:48,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:35:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:35:48,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:35:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:15,126 INFO L85 PathProgramCache]: Analyzing trace with hash -576874982, now seen corresponding path program 2 times [2024-05-07 12:36:15,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:36:15,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:36:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:15,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:36:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:34,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1054192980, now seen corresponding path program 1 times [2024-05-07 12:36:34,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 12:36:34,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 12:36:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:36:34,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 12:36:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 12:37:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:37:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 12:37:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 12:37:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-07 12:37:15,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-05-07 12:37:15,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-07 12:37:15,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2024-05-07 12:37:15,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-05-07 12:37:15,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-07 12:37:15,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-05-07 12:37:15,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-07 12:37:15,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable30,SelfDestructingSolverStorable41,SelfDestructingSolverStorable31,SelfDestructingSolverStorable42,SelfDestructingSolverStorable32,SelfDestructingSolverStorable43,SelfDestructingSolverStorable33,SelfDestructingSolverStorable44,SelfDestructingSolverStorable34,SelfDestructingSolverStorable45,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2024-05-07 12:37:15,558 INFO L448 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:37:15,562 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 12:37:15,562 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 12:37:15,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 12:37:15 BasicIcfg [2024-05-07 12:37:15,566 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 12:37:15,566 INFO L158 Benchmark]: Toolchain (without parser) took 453107.91ms. Allocated memory was 273.7MB in the beginning and 888.1MB in the end (delta: 614.5MB). Free memory was 202.0MB in the beginning and 571.7MB in the end (delta: -369.8MB). Peak memory consumption was 245.7MB. Max. memory is 8.0GB. [2024-05-07 12:37:15,566 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 273.7MB. Free memory is still 241.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 12:37:15,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 635.00ms. Allocated memory is still 273.7MB. Free memory was 201.7MB in the beginning and 173.7MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2024-05-07 12:37:15,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 156.76ms. Allocated memory is still 273.7MB. Free memory was 173.7MB in the beginning and 238.0MB in the end (delta: -64.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2024-05-07 12:37:15,567 INFO L158 Benchmark]: Boogie Preprocessor took 62.19ms. Allocated memory is still 273.7MB. Free memory was 238.0MB in the beginning and 235.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-07 12:37:15,567 INFO L158 Benchmark]: RCFGBuilder took 829.52ms. Allocated memory is still 273.7MB. Free memory was 235.4MB in the beginning and 166.7MB in the end (delta: 68.7MB). Peak memory consumption was 68.2MB. Max. memory is 8.0GB. [2024-05-07 12:37:15,567 INFO L158 Benchmark]: TraceAbstraction took 451416.82ms. Allocated memory was 273.7MB in the beginning and 888.1MB in the end (delta: 614.5MB). Free memory was 165.7MB in the beginning and 571.7MB in the end (delta: -406.0MB). Peak memory consumption was 209.5MB. Max. memory is 8.0GB. [2024-05-07 12:37:15,569 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.12ms. Allocated memory is still 273.7MB. Free memory is still 241.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 635.00ms. Allocated memory is still 273.7MB. Free memory was 201.7MB in the beginning and 173.7MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 156.76ms. Allocated memory is still 273.7MB. Free memory was 173.7MB in the beginning and 238.0MB in the end (delta: -64.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.19ms. Allocated memory is still 273.7MB. Free memory was 238.0MB in the beginning and 235.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 829.52ms. Allocated memory is still 273.7MB. Free memory was 235.4MB in the beginning and 166.7MB in the end (delta: 68.7MB). Peak memory consumption was 68.2MB. Max. memory is 8.0GB. * TraceAbstraction took 451416.82ms. Allocated memory was 273.7MB in the beginning and 888.1MB in the end (delta: 614.5MB). Free memory was 165.7MB in the beginning and 571.7MB in the end (delta: -406.0MB). Peak memory consumption was 209.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10602, independent: 10216, independent conditional: 10159, independent unconditional: 57, dependent: 386, dependent conditional: 386, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10571, independent: 10216, independent conditional: 10159, independent unconditional: 57, dependent: 355, dependent conditional: 355, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10571, independent: 10216, independent conditional: 10159, independent unconditional: 57, dependent: 355, dependent conditional: 355, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10571, independent: 10216, independent conditional: 10159, independent unconditional: 57, dependent: 355, dependent conditional: 355, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11471, independent: 10216, independent conditional: 4710, independent unconditional: 5506, dependent: 1255, dependent conditional: 878, dependent unconditional: 377, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11471, independent: 10216, independent conditional: 3102, independent unconditional: 7114, dependent: 1255, dependent conditional: 618, dependent unconditional: 637, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11471, independent: 10216, independent conditional: 3102, independent unconditional: 7114, dependent: 1255, dependent conditional: 618, dependent unconditional: 637, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 648, independent: 602, independent conditional: 178, independent unconditional: 424, dependent: 46, dependent conditional: 28, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 648, independent: 580, independent conditional: 0, independent unconditional: 580, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 68, independent: 22, independent conditional: 21, independent unconditional: 1, dependent: 46, dependent conditional: 28, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 22, independent conditional: 21, independent unconditional: 1, dependent: 46, dependent conditional: 28, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 487, independent: 90, independent conditional: 89, independent unconditional: 1, dependent: 397, dependent conditional: 263, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 11471, independent: 9614, independent conditional: 2924, independent unconditional: 6690, dependent: 1209, dependent conditional: 590, dependent unconditional: 619, unknown: 648, unknown conditional: 206, unknown unconditional: 442] , Statistics on independence cache: Total cache size (in pairs): 648, Positive cache size: 602, Positive conditional cache size: 178, Positive unconditional cache size: 424, Negative cache size: 46, Negative conditional cache size: 28, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1868, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11471, independent: 10216, independent conditional: 4710, independent unconditional: 5506, dependent: 1255, dependent conditional: 878, dependent unconditional: 377, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11471, independent: 10216, independent conditional: 3102, independent unconditional: 7114, dependent: 1255, dependent conditional: 618, dependent unconditional: 637, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11471, independent: 10216, independent conditional: 3102, independent unconditional: 7114, dependent: 1255, dependent conditional: 618, dependent unconditional: 637, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 648, independent: 602, independent conditional: 178, independent unconditional: 424, dependent: 46, dependent conditional: 28, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 648, independent: 580, independent conditional: 0, independent unconditional: 580, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 68, independent: 22, independent conditional: 21, independent unconditional: 1, dependent: 46, dependent conditional: 28, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 22, independent conditional: 21, independent unconditional: 1, dependent: 46, dependent conditional: 28, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 487, independent: 90, independent conditional: 89, independent unconditional: 1, dependent: 397, dependent conditional: 263, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 11471, independent: 9614, independent conditional: 2924, independent unconditional: 6690, dependent: 1209, dependent conditional: 590, dependent unconditional: 619, unknown: 648, unknown conditional: 206, unknown unconditional: 442] , Statistics on independence cache: Total cache size (in pairs): 648, Positive cache size: 602, Positive conditional cache size: 178, Positive unconditional cache size: 424, Negative cache size: 46, Negative conditional cache size: 28, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1868 ], Independence queries for same thread: 31 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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 5 procedures, 132 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 451.2s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 448.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 28, 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, 2.5s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 1068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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: 446.3s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 2, ConditionalCommutativityConditionCalculations: 98, ConditionalCommutativityTraceChecks: 40, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-07 12:37:15,584 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 12:37:15,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...