/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 SLEEP_SET --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/rfi000_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 19:58:09,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 19:58:09,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 19:58:09,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 19:58:09,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 19:58:09,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 19:58:09,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 19:58:09,897 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 19:58:09,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 19:58:09,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 19:58:09,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 19:58:09,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 19:58:09,898 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 19:58:09,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 19:58:09,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 19:58:09,899 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 19:58:09,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 19:58:09,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 19:58:09,900 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 19:58:09,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 19:58:09,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 19:58:09,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 19:58:09,901 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 19:58:09,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 19:58:09,901 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 19:58:09,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 19:58:09,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 19:58:09,902 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 19:58:09,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 19:58:09,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 19:58:09,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 19:58:09,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 19:58:09,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 19:58:09,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 19:58:09,903 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 19:58:09,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 19:58:09,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 19:58:09,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 19:58:09,904 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 19:58:09,904 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 -> SLEEP_SET 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-06 19:58:10,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 19:58:10,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 19:58:10,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 19:58:10,126 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 19:58:10,127 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 19:58:10,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.i [2024-05-06 19:58:11,163 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 19:58:11,320 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 19:58:11,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_tso.i [2024-05-06 19:58:11,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2d9ec3926/dd470ef5598442ac80b0a94a5c5bf7d2/FLAG6645f705b [2024-05-06 19:58:11,341 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2d9ec3926/dd470ef5598442ac80b0a94a5c5bf7d2 [2024-05-06 19:58:11,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 19:58:11,343 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 19:58:11,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 19:58:11,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 19:58:11,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 19:58:11,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 07:58:11" (1/1) ... [2024-05-06 19:58:11,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1763ec9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:58:11, skipping insertion in model container [2024-05-06 19:58:11,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 07:58:11" (1/1) ... [2024-05-06 19:58:11,404 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 19:58:11,552 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/rfi000_tso.i[944,957] [2024-05-06 19:58:11,763 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 19:58:11,773 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 19:58:11,782 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/rfi000_tso.i[944,957] [2024-05-06 19:58:11,842 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 19:58:11,867 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 19:58:11,868 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 19:58:11,873 INFO L206 MainTranslator]: Completed translation [2024-05-06 19:58:11,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:58:11 WrapperNode [2024-05-06 19:58:11,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 19:58:11,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 19:58:11,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 19:58:11,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 19:58:11,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:58:11" (1/1) ... [2024-05-06 19:58:11,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:58:11" (1/1) ... [2024-05-06 19:58:11,929 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 169 [2024-05-06 19:58:11,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 19:58:11,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 19:58:11,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 19:58:11,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 19:58:11,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:58:11" (1/1) ... [2024-05-06 19:58:11,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:58:11" (1/1) ... [2024-05-06 19:58:11,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:58:11" (1/1) ... [2024-05-06 19:58:11,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:58:11" (1/1) ... [2024-05-06 19:58:11,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:58:11" (1/1) ... [2024-05-06 19:58:11,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:58:11" (1/1) ... [2024-05-06 19:58:11,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:58:11" (1/1) ... [2024-05-06 19:58:11,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:58:11" (1/1) ... [2024-05-06 19:58:11,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 19:58:11,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 19:58:11,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 19:58:11,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 19:58:11,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:58:11" (1/1) ... [2024-05-06 19:58:12,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 19:58:12,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 19:58:12,024 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-06 19:58:12,062 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-06 19:58:12,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 19:58:12,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 19:58:12,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 19:58:12,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 19:58:12,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 19:58:12,081 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 19:58:12,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 19:58:12,081 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 19:58:12,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 19:58:12,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 19:58:12,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 19:58:12,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 19:58:12,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 19:58:12,083 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 19:58:12,195 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 19:58:12,196 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 19:58:12,493 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 19:58:12,614 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 19:58:12,615 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 19:58:12,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 07:58:12 BoogieIcfgContainer [2024-05-06 19:58:12,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 19:58:12,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 19:58:12,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 19:58:12,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 19:58:12,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 07:58:11" (1/3) ... [2024-05-06 19:58:12,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35783b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 07:58:12, skipping insertion in model container [2024-05-06 19:58:12,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 07:58:11" (2/3) ... [2024-05-06 19:58:12,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35783b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 07:58:12, skipping insertion in model container [2024-05-06 19:58:12,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 07:58:12" (3/3) ... [2024-05-06 19:58:12,624 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_tso.i [2024-05-06 19:58:12,630 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 19:58:12,636 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 19:58:12,637 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 19:58:12,637 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 19:58:12,677 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 19:58:12,714 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 19:58:12,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 19:58:12,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 19:58:12,717 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-06 19:58:12,728 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-06 19:58:12,745 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 19:58:12,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 19:58:12,754 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 19:58:12,759 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;@749ff7fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 19:58:12,760 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-06 19:58:12,783 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-06 19:58:12,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 19:58:12,784 INFO L85 PathProgramCache]: Analyzing trace with hash -436960994, now seen corresponding path program 1 times [2024-05-06 19:58:12,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 19:58:12,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108804418] [2024-05-06 19:58:12,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:12,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 19:58:13,359 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-06 19:58:13,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 19:58:13,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108804418] [2024-05-06 19:58:13,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108804418] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 19:58:13,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 19:58:13,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 19:58:13,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065550238] [2024-05-06 19:58:13,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 19:58:13,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 19:58:13,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 19:58:13,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 19:58:13,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 19:58:13,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 19:58:13,387 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 19:58:13,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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-06 19:58:13,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 19:58:13,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 19:58:13,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 19:58:13,475 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-06 19:58:13,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 19:58:13,475 INFO L85 PathProgramCache]: Analyzing trace with hash 363720988, now seen corresponding path program 1 times [2024-05-06 19:58:13,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 19:58:13,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963442220] [2024-05-06 19:58:13,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:13,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 19:58:15,186 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-06 19:58:15,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 19:58:15,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963442220] [2024-05-06 19:58:15,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963442220] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 19:58:15,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 19:58:15,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-05-06 19:58:15,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780232321] [2024-05-06 19:58:15,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 19:58:15,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-06 19:58:15,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 19:58:15,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-06 19:58:15,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-05-06 19:58:15,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 19:58:15,194 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 19:58:15,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 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-06 19:58:15,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 19:58:15,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 19:58:17,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1586602466, now seen corresponding path program 1 times [2024-05-06 19:58:17,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:17,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 19:58:17,984 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-06 19:58:17,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:17,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 19:58:18,199 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-06 19:58:18,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 19:58:18,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-06 19:58:18,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1574359366, now seen corresponding path program 1 times [2024-05-06 19:58:18,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:18,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:18,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:18,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 19:58:18,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 19:58:18,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-06 19:58:18,498 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-06 19:58:18,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 19:58:18,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1993555754, now seen corresponding path program 1 times [2024-05-06 19:58:18,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 19:58:18,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478966029] [2024-05-06 19:58:18,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:18,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 19:58:19,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-06 19:58:19,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 19:58:19,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478966029] [2024-05-06 19:58:19,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478966029] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 19:58:19,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 19:58:19,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 19:58:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031412105] [2024-05-06 19:58:19,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 19:58:19,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 19:58:19,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 19:58:19,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 19:58:19,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-06 19:58:19,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 19:58:19,049 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 19:58:19,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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-06 19:58:19,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 19:58:19,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-06 19:58:19,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 19:58:19,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1574359366, now seen corresponding path program 2 times [2024-05-06 19:58:19,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:19,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:19,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:19,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1304929774, now seen corresponding path program 1 times [2024-05-06 19:58:19,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:19,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:19,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:19,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1621602087, now seen corresponding path program 1 times [2024-05-06 19:58:19,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:19,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:19,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:20,572 INFO L85 PathProgramCache]: Analyzing trace with hash 144874347, now seen corresponding path program 1 times [2024-05-06 19:58:20,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:20,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:20,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:24,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1785305548, now seen corresponding path program 1 times [2024-05-06 19:58:24,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:24,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:24,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:25,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1519347277, now seen corresponding path program 1 times [2024-05-06 19:58:25,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:25,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:25,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:28,474 INFO L85 PathProgramCache]: Analyzing trace with hash 196158996, now seen corresponding path program 1 times [2024-05-06 19:58:28,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:28,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:28,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:29,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1018842449, now seen corresponding path program 1 times [2024-05-06 19:58:29,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:29,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:29,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:32,234 INFO L85 PathProgramCache]: Analyzing trace with hash 144961552, now seen corresponding path program 1 times [2024-05-06 19:58:32,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:32,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:32,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:33,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2111075846, now seen corresponding path program 1 times [2024-05-06 19:58:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:33,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:33,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:35,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1519312741, now seen corresponding path program 1 times [2024-05-06 19:58:35,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:35,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:35,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:36,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1730667129, now seen corresponding path program 1 times [2024-05-06 19:58:36,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:36,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:36,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:39,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1018755864, now seen corresponding path program 1 times [2024-05-06 19:58:39,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:39,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 19:58:40,235 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-06 19:58:40,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:40,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 19:58:40,613 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-06 19:58:40,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 19:58:40,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2024-05-06 19:58:40,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1574359366, now seen corresponding path program 3 times [2024-05-06 19:58:40,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:40,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:40,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:40,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1304929774, now seen corresponding path program 2 times [2024-05-06 19:58:40,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:40,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:40,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:41,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1621602087, now seen corresponding path program 2 times [2024-05-06 19:58:41,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:41,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:41,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:41,923 INFO L85 PathProgramCache]: Analyzing trace with hash 144874347, now seen corresponding path program 2 times [2024-05-06 19:58:41,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:41,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:41,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:44,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1519347277, now seen corresponding path program 2 times [2024-05-06 19:58:44,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:44,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:44,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1018842449, now seen corresponding path program 2 times [2024-05-06 19:58:47,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:47,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:47,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:49,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2111075846, now seen corresponding path program 2 times [2024-05-06 19:58:49,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:49,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:49,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:52,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1730667129, now seen corresponding path program 2 times [2024-05-06 19:58:52,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:52,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:52,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:56,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1185392607, now seen corresponding path program 1 times [2024-05-06 19:58:56,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:58:56,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:58:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:58:56,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:58:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:59:01,977 INFO L85 PathProgramCache]: Analyzing trace with hash 995973440, now seen corresponding path program 1 times [2024-05-06 19:59:01,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:59:01,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:59:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 19:59:02,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-06 19:59:02,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:59:02,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:59:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 19:59:02,094 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-06 19:59:02,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 19:59:02,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2024-05-06 19:59:04,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1185392607, now seen corresponding path program 2 times [2024-05-06 19:59:04,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:59:04,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:59:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:59:04,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:59:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:59:12,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1562259135, now seen corresponding path program 1 times [2024-05-06 19:59:12,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:59:12,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:59:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:59:12,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:59:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:59:20,002 INFO L85 PathProgramCache]: Analyzing trace with hash 743132195, now seen corresponding path program 1 times [2024-05-06 19:59:20,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:59:20,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:59:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:59:20,010 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:59:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:59:28,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1777143290, now seen corresponding path program 1 times [2024-05-06 19:59:28,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:59:28,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:59:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:59:28,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:59:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:59:35,615 INFO L85 PathProgramCache]: Analyzing trace with hash 496862203, now seen corresponding path program 1 times [2024-05-06 19:59:35,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:59:35,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:59:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:59:35,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:59:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:59:42,845 INFO L85 PathProgramCache]: Analyzing trace with hash -399614146, now seen corresponding path program 1 times [2024-05-06 19:59:42,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:59:42,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:59:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:59:42,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:59:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:59:49,322 INFO L85 PathProgramCache]: Analyzing trace with hash 541298586, now seen corresponding path program 1 times [2024-05-06 19:59:49,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:59:49,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:59:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:59:49,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:59:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:59:57,302 INFO L85 PathProgramCache]: Analyzing trace with hash 987292596, now seen corresponding path program 1 times [2024-05-06 19:59:57,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 19:59:57,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 19:59:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 19:59:57,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 19:59:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:00:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 20:00:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 20:00:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 20:00:45,482 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,SelfDestructingSolverStorable38,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-06 20:00:45,491 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-06 20:00:45,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 20:00:45,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1761104384, now seen corresponding path program 2 times [2024-05-06 20:00:45,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 20:00:45,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230559148] [2024-05-06 20:00:45,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:00:45,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:00:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 20:00:47,039 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-06 20:00:47,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 20:00:47,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230559148] [2024-05-06 20:00:47,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230559148] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 20:00:47,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 20:00:47,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-05-06 20:00:47,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138266730] [2024-05-06 20:00:47,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 20:00:47,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-05-06 20:00:47,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 20:00:47,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-05-06 20:00:47,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-05-06 20:00:47,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:00:47,042 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 20:00:47,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 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-06 20:00:47,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 20:00:47,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-06 20:00:47,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 20:00:47,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:00:49,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1185392607, now seen corresponding path program 3 times [2024-05-06 20:00:49,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:00:49,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:00:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:00:49,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:00:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:01:06,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 20:01:06,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 20:01:06,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 20:01:06,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-06 20:01:06,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable39 [2024-05-06 20:01:06,856 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-06 20:01:06,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 20:01:06,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2019474732, now seen corresponding path program 3 times [2024-05-06 20:01:06,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 20:01:06,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852808160] [2024-05-06 20:01:06,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:01:06,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:01:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 20:01:08,093 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-06 20:01:08,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 20:01:08,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852808160] [2024-05-06 20:01:08,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852808160] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 20:01:08,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 20:01:08,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-05-06 20:01:08,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839533030] [2024-05-06 20:01:08,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 20:01:08,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-05-06 20:01:08,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 20:01:08,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-05-06 20:01:08,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-05-06 20:01:08,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:01:08,095 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 20:01:08,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 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-06 20:01:08,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 20:01:08,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-06 20:01:08,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 20:01:08,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-06 20:01:08,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:01:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 20:01:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 20:01:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 20:01:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-06 20:01:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 20:01:08,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-06 20:01:08,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-05-06 20:01:08,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-06 20:01:08,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-06 20:01:08,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-05-06 20:01:08,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-06 20:01:08,508 INFO L448 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-06 20:01:08,511 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 20:01:08,512 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 20:01:08,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 08:01:08 BasicIcfg [2024-05-06 20:01:08,514 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 20:01:08,515 INFO L158 Benchmark]: Toolchain (without parser) took 177171.25ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 101.6MB in the beginning and 1.0GB in the end (delta: -900.7MB). Peak memory consumption was 205.8MB. Max. memory is 8.0GB. [2024-05-06 20:01:08,515 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 167.8MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 20:01:08,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.17ms. Allocated memory was 167.8MB in the beginning and 248.5MB in the end (delta: 80.7MB). Free memory was 101.5MB in the beginning and 211.0MB in the end (delta: -109.5MB). Peak memory consumption was 22.4MB. Max. memory is 8.0GB. [2024-05-06 20:01:08,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.36ms. Allocated memory is still 248.5MB. Free memory was 211.0MB in the beginning and 207.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-06 20:01:08,515 INFO L158 Benchmark]: Boogie Preprocessor took 55.80ms. Allocated memory is still 248.5MB. Free memory was 207.9MB in the beginning and 205.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 20:01:08,516 INFO L158 Benchmark]: RCFGBuilder took 629.99ms. Allocated memory is still 248.5MB. Free memory was 205.8MB in the beginning and 157.0MB in the end (delta: 48.8MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. [2024-05-06 20:01:08,516 INFO L158 Benchmark]: TraceAbstraction took 175895.38ms. Allocated memory was 248.5MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 155.9MB in the beginning and 1.0GB in the end (delta: -846.3MB). Peak memory consumption was 178.1MB. Max. memory is 8.0GB. [2024-05-06 20:01:08,520 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 167.8MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 529.17ms. Allocated memory was 167.8MB in the beginning and 248.5MB in the end (delta: 80.7MB). Free memory was 101.5MB in the beginning and 211.0MB in the end (delta: -109.5MB). Peak memory consumption was 22.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.36ms. Allocated memory is still 248.5MB. Free memory was 211.0MB in the beginning and 207.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.80ms. Allocated memory is still 248.5MB. Free memory was 207.9MB in the beginning and 205.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 629.99ms. Allocated memory is still 248.5MB. Free memory was 205.8MB in the beginning and 157.0MB in the end (delta: 48.8MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. * TraceAbstraction took 175895.38ms. Allocated memory was 248.5MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 155.9MB in the beginning and 1.0GB in the end (delta: -846.3MB). Peak memory consumption was 178.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 19789, independent: 18997, independent conditional: 18929, independent unconditional: 68, dependent: 792, dependent conditional: 792, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19682, independent: 18997, independent conditional: 18929, independent unconditional: 68, dependent: 685, dependent conditional: 685, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19682, independent: 18997, independent conditional: 18929, independent unconditional: 68, dependent: 685, dependent conditional: 685, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19682, independent: 18997, independent conditional: 18929, independent unconditional: 68, dependent: 685, dependent conditional: 685, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22208, independent: 18997, independent conditional: 8725, independent unconditional: 10272, dependent: 3211, dependent conditional: 2485, dependent unconditional: 726, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22208, independent: 18997, independent conditional: 5514, independent unconditional: 13483, dependent: 3211, dependent conditional: 1488, dependent unconditional: 1723, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22208, independent: 18997, independent conditional: 5514, independent unconditional: 13483, dependent: 3211, dependent conditional: 1488, dependent unconditional: 1723, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 657, independent: 606, independent conditional: 136, independent unconditional: 470, dependent: 51, dependent conditional: 37, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 657, independent: 596, independent conditional: 0, independent unconditional: 596, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 61, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 51, dependent conditional: 37, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 51, dependent conditional: 37, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 371, independent: 30, independent conditional: 29, independent unconditional: 1, dependent: 341, dependent conditional: 243, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 22208, independent: 18391, independent conditional: 5378, independent unconditional: 13013, dependent: 3160, dependent conditional: 1451, dependent unconditional: 1709, unknown: 657, unknown conditional: 173, unknown unconditional: 484] , Statistics on independence cache: Total cache size (in pairs): 657, Positive cache size: 606, Positive conditional cache size: 136, Positive unconditional cache size: 470, Negative cache size: 51, Negative conditional cache size: 37, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4208, Maximal queried relation: 7, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22208, independent: 18997, independent conditional: 8725, independent unconditional: 10272, dependent: 3211, dependent conditional: 2485, dependent unconditional: 726, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22208, independent: 18997, independent conditional: 5514, independent unconditional: 13483, dependent: 3211, dependent conditional: 1488, dependent unconditional: 1723, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22208, independent: 18997, independent conditional: 5514, independent unconditional: 13483, dependent: 3211, dependent conditional: 1488, dependent unconditional: 1723, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 657, independent: 606, independent conditional: 136, independent unconditional: 470, dependent: 51, dependent conditional: 37, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 657, independent: 596, independent conditional: 0, independent unconditional: 596, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 61, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 51, dependent conditional: 37, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 51, dependent conditional: 37, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 371, independent: 30, independent conditional: 29, independent unconditional: 1, dependent: 341, dependent conditional: 243, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 22208, independent: 18391, independent conditional: 5378, independent unconditional: 13013, dependent: 3160, dependent conditional: 1451, dependent unconditional: 1709, unknown: 657, unknown conditional: 173, unknown unconditional: 484] , Statistics on independence cache: Total cache size (in pairs): 657, Positive cache size: 606, Positive conditional cache size: 136, Positive unconditional cache size: 470, Negative cache size: 51, Negative conditional cache size: 37, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4208 ], Independence queries for same thread: 107 - 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 - 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 5 procedures, 113 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 175.8s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 170.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 54, 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, 5.2s InterpolantComputationTime, 333 NumberOfCodeBlocks, 333 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 3087 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: 168.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 3, ConditionalCommutativityConditionCalculations: 101, ConditionalCommutativityTraceChecks: 34, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-06 20:01:08,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-06 20:01:08,769 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...