/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 BOTH --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/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-08 02:15:01,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-08 02:15:01,784 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-08 02:15:01,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-08 02:15:01,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-08 02:15:01,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-08 02:15:01,819 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-08 02:15:01,819 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-08 02:15:01,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-08 02:15:01,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-08 02:15:01,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-08 02:15:01,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-08 02:15:01,823 INFO L153 SettingsManager]: * Use SBE=true [2024-05-08 02:15:01,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-08 02:15:01,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-08 02:15:01,824 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-08 02:15:01,824 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-08 02:15:01,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-08 02:15:01,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-08 02:15:01,825 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-08 02:15:01,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-08 02:15:01,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-08 02:15:01,826 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-08 02:15:01,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-08 02:15:01,826 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-08 02:15:01,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-08 02:15:01,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-08 02:15:01,827 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-08 02:15:01,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-08 02:15:01,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 02:15:01,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-08 02:15:01,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-08 02:15:01,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-08 02:15:01,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-08 02:15:01,829 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-08 02:15:01,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-08 02:15:01,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-08 02:15:01,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-08 02:15:01,830 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-08 02:15:01,830 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 -> BOTH 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-08 02:15:02,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-08 02:15:02,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-08 02:15:02,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-08 02:15:02,117 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-08 02:15:02,117 INFO L274 PluginConnector]: CDTParser initialized [2024-05-08 02:15:02,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-05-08 02:15:03,418 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-08 02:15:03,655 INFO L384 CDTParser]: Found 1 translation units. [2024-05-08 02:15:03,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-05-08 02:15:03,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f25bf460f/7bdc398581f4404d935acf48c547396c/FLAG7745c7c11 [2024-05-08 02:15:03,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f25bf460f/7bdc398581f4404d935acf48c547396c [2024-05-08 02:15:03,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-08 02:15:03,697 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-08 02:15:03,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-08 02:15:03,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-08 02:15:03,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-08 02:15:03,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 02:15:03" (1/1) ... [2024-05-08 02:15:03,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ee305b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:15:03, skipping insertion in model container [2024-05-08 02:15:03,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 02:15:03" (1/1) ... [2024-05-08 02:15:03,763 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-08 02:15:03,896 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/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2024-05-08 02:15:04,065 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 02:15:04,077 INFO L202 MainTranslator]: Completed pre-run [2024-05-08 02:15:04,090 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/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2024-05-08 02:15:04,137 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 02:15:04,164 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-08 02:15:04,165 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-08 02:15:04,171 INFO L206 MainTranslator]: Completed translation [2024-05-08 02:15:04,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:15:04 WrapperNode [2024-05-08 02:15:04,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-08 02:15:04,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-08 02:15:04,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-08 02:15:04,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-08 02:15:04,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:15:04" (1/1) ... [2024-05-08 02:15:04,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:15:04" (1/1) ... [2024-05-08 02:15:04,218 INFO L138 Inliner]: procedures = 177, calls = 66, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 84 [2024-05-08 02:15:04,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-08 02:15:04,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-08 02:15:04,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-08 02:15:04,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-08 02:15:04,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:15:04" (1/1) ... [2024-05-08 02:15:04,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:15:04" (1/1) ... [2024-05-08 02:15:04,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:15:04" (1/1) ... [2024-05-08 02:15:04,235 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:15:04" (1/1) ... [2024-05-08 02:15:04,240 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:15:04" (1/1) ... [2024-05-08 02:15:04,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:15:04" (1/1) ... [2024-05-08 02:15:04,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:15:04" (1/1) ... [2024-05-08 02:15:04,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:15:04" (1/1) ... [2024-05-08 02:15:04,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-08 02:15:04,249 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-08 02:15:04,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-08 02:15:04,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-08 02:15:04,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:15:04" (1/1) ... [2024-05-08 02:15:04,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 02:15:04,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:15:04,298 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-08 02:15:04,328 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-08 02:15:04,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-08 02:15:04,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-08 02:15:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-08 02:15:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-08 02:15:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-08 02:15:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-08 02:15:04,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-08 02:15:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-08 02:15:04,354 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-08 02:15:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-08 02:15:04,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-08 02:15:04,355 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-05-08 02:15:04,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-05-08 02:15:04,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-08 02:15:04,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-08 02:15:04,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-08 02:15:04,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-08 02:15:04,357 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-08 02:15:04,515 INFO L241 CfgBuilder]: Building ICFG [2024-05-08 02:15:04,521 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-08 02:15:04,762 INFO L282 CfgBuilder]: Performing block encoding [2024-05-08 02:15:04,772 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-08 02:15:04,772 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-08 02:15:04,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 02:15:04 BoogieIcfgContainer [2024-05-08 02:15:04,778 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-08 02:15:04,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-08 02:15:04,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-08 02:15:04,785 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-08 02:15:04,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.05 02:15:03" (1/3) ... [2024-05-08 02:15:04,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fbe045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 02:15:04, skipping insertion in model container [2024-05-08 02:15:04,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:15:04" (2/3) ... [2024-05-08 02:15:04,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fbe045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 02:15:04, skipping insertion in model container [2024-05-08 02:15:04,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 02:15:04" (3/3) ... [2024-05-08 02:15:04,788 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-05-08 02:15:04,796 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-08 02:15:04,822 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-08 02:15:04,823 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-08 02:15:04,823 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-08 02:15:04,932 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-08 02:15:04,971 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-08 02:15:04,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-08 02:15:04,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:15:04,973 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-08 02:15:04,975 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-08 02:15:05,005 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-08 02:15:05,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:15:05,019 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-08 02:15:05,025 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;@54a2acf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-08 02:15:05,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-08 02:15:05,091 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-08 02:15:05,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:15:05,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1239798002, now seen corresponding path program 1 times [2024-05-08 02:15:05,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:15:05,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210736137] [2024-05-08 02:15:05,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:05,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:15:05,401 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-08 02:15:05,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:15:05,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210736137] [2024-05-08 02:15:05,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210736137] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 02:15:05,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 02:15:05,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-08 02:15:05,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924339228] [2024-05-08 02:15:05,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 02:15:05,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-08 02:15:05,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:15:05,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-08 02:15:05,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-08 02:15:05,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:05,450 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:15:05,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 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-08 02:15:05,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:05,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:05,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-08 02:15:05,491 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-08 02:15:05,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:15:05,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1337068274, now seen corresponding path program 1 times [2024-05-08 02:15:05,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:15:05,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137617176] [2024-05-08 02:15:05,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:05,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:15:06,146 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-08 02:15:06,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:15:06,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137617176] [2024-05-08 02:15:06,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137617176] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 02:15:06,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 02:15:06,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-08 02:15:06,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063758013] [2024-05-08 02:15:06,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 02:15:06,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-08 02:15:06,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:15:06,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-08 02:15:06,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-08 02:15:06,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:06,177 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:15:06,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:15:06,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:06,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash 968132213, now seen corresponding path program 1 times [2024-05-08 02:15:06,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:06,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:15:06,919 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-08 02:15:06,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:06,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:15:07,045 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-08 02:15:07,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-08 02:15:07,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-08 02:15:07,453 INFO L85 PathProgramCache]: Analyzing trace with hash 226004022, now seen corresponding path program 1 times [2024-05-08 02:15:07,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:07,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:07,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:07,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:15:07,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-08 02:15:07,556 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-08 02:15:07,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:15:07,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2079980852, now seen corresponding path program 1 times [2024-05-08 02:15:07,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:15:07,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324407474] [2024-05-08 02:15:07,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:07,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:15:07,863 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-08 02:15:07,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:15:07,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324407474] [2024-05-08 02:15:07,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324407474] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 02:15:07,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 02:15:07,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-08 02:15:07,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113002863] [2024-05-08 02:15:07,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 02:15:07,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-08 02:15:07,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:15:08,019 INFO L85 PathProgramCache]: Analyzing trace with hash 226004022, now seen corresponding path program 2 times [2024-05-08 02:15:08,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:08,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:08,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:08,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-08 02:15:08,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-05-08 02:15:08,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:08,073 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:15:08,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-08 02:15:08,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:08,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:15:08,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:08,459 INFO L85 PathProgramCache]: Analyzing trace with hash 226004022, now seen corresponding path program 3 times [2024-05-08 02:15:08,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:08,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:08,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:08,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1277783747, now seen corresponding path program 1 times [2024-05-08 02:15:08,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:08,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:08,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:08,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1436211211, now seen corresponding path program 1 times [2024-05-08 02:15:08,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:08,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:08,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:09,122 INFO L85 PathProgramCache]: Analyzing trace with hash 472879834, now seen corresponding path program 1 times [2024-05-08 02:15:09,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:09,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:15:09,255 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-08 02:15:09,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:09,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:15:09,340 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-08 02:15:09,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-08 02:15:09,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-08 02:15:09,539 INFO L85 PathProgramCache]: Analyzing trace with hash 226004022, now seen corresponding path program 4 times [2024-05-08 02:15:09,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:09,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:09,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:09,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1277783747, now seen corresponding path program 2 times [2024-05-08 02:15:09,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:09,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:09,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:09,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1436211211, now seen corresponding path program 2 times [2024-05-08 02:15:09,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:09,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:09,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash -895905415, now seen corresponding path program 1 times [2024-05-08 02:15:10,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:10,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:10,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:10,714 INFO L85 PathProgramCache]: Analyzing trace with hash -2078072178, now seen corresponding path program 1 times [2024-05-08 02:15:10,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:10,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:15:10,955 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-08 02:15:10,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:10,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:15:11,106 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-08 02:15:11,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-08 02:15:11,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-05-08 02:15:11,461 INFO L85 PathProgramCache]: Analyzing trace with hash -895905415, now seen corresponding path program 2 times [2024-05-08 02:15:11,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:11,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:11,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:11,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1079478541, now seen corresponding path program 1 times [2024-05-08 02:15:11,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:11,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:11,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:11,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2113031914, now seen corresponding path program 1 times [2024-05-08 02:15:11,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:11,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:11,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1730730340, now seen corresponding path program 1 times [2024-05-08 02:15:11,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:11,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:11,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:12,087 INFO L85 PathProgramCache]: Analyzing trace with hash 471472108, now seen corresponding path program 1 times [2024-05-08 02:15:12,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:12,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:12,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:12,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1816324107, now seen corresponding path program 1 times [2024-05-08 02:15:12,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:12,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:12,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:12,364 INFO L85 PathProgramCache]: Analyzing trace with hash 197138502, now seen corresponding path program 1 times [2024-05-08 02:15:12,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:12,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:12,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:12,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1240566669, now seen corresponding path program 1 times [2024-05-08 02:15:12,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:12,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:12,491 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:13,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1441487575, now seen corresponding path program 1 times [2024-05-08 02:15:13,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:13,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:13,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:15,169 INFO L85 PathProgramCache]: Analyzing trace with hash 468384286, now seen corresponding path program 1 times [2024-05-08 02:15:15,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:15,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:15,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:16,191 INFO L85 PathProgramCache]: Analyzing trace with hash -703548424, now seen corresponding path program 1 times [2024-05-08 02:15:16,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:16,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:16,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:17,719 INFO L85 PathProgramCache]: Analyzing trace with hash -496421665, now seen corresponding path program 1 times [2024-05-08 02:15:17,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:17,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:17,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:18,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1556306201, now seen corresponding path program 1 times [2024-05-08 02:15:18,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:18,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:18,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:18,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1620866760, now seen corresponding path program 1 times [2024-05-08 02:15:18,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:18,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:18,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:19,396 INFO L85 PathProgramCache]: Analyzing trace with hash 897622944, now seen corresponding path program 1 times [2024-05-08 02:15:19,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:19,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:19,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:19,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:19,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:15:19,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:15:19,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable32,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-08 02:15:19,965 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-08 02:15:19,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:15:19,966 INFO L85 PathProgramCache]: Analyzing trace with hash 334138802, now seen corresponding path program 2 times [2024-05-08 02:15:19,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:15:19,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978532179] [2024-05-08 02:15:19,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:19,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:15:20,256 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-08 02:15:20,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:15:20,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978532179] [2024-05-08 02:15:20,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978532179] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 02:15:20,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 02:15:20,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-08 02:15:20,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426978737] [2024-05-08 02:15:20,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 02:15:20,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-08 02:15:20,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:15:20,292 INFO L85 PathProgramCache]: Analyzing trace with hash 664389362, now seen corresponding path program 1 times [2024-05-08 02:15:20,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:20,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:20,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:20,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-08 02:15:20,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-05-08 02:15:20,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:20,319 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:15:20,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-08 02:15:20,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:20,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:15:20,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:15:20,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:20,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1441487575, now seen corresponding path program 2 times [2024-05-08 02:15:20,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:20,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:20,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:21,256 INFO L85 PathProgramCache]: Analyzing trace with hash 468384286, now seen corresponding path program 2 times [2024-05-08 02:15:21,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:21,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:21,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:21,886 INFO L85 PathProgramCache]: Analyzing trace with hash -703548424, now seen corresponding path program 2 times [2024-05-08 02:15:21,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:21,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:21,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:22,321 INFO L85 PathProgramCache]: Analyzing trace with hash -496421665, now seen corresponding path program 2 times [2024-05-08 02:15:22,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:22,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:22,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:26,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:26,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:15:26,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:15:26,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-08 02:15:26,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38 [2024-05-08 02:15:26,559 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-08 02:15:26,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:15:26,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1157872488, now seen corresponding path program 3 times [2024-05-08 02:15:26,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:15:26,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624409152] [2024-05-08 02:15:26,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:26,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:15:26,892 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-08 02:15:26,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:15:26,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624409152] [2024-05-08 02:15:26,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624409152] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 02:15:26,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 02:15:26,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-08 02:15:26,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631774966] [2024-05-08 02:15:26,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 02:15:26,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-08 02:15:26,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:15:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash -886642155, now seen corresponding path program 1 times [2024-05-08 02:15:26,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:26,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:26,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:15:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:15:26,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-08 02:15:26,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-05-08 02:15:26,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:26,961 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:15:26,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-08 02:15:26,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:26,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:15:26,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:15:26,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-08 02:15:26,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:35,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:35,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:15:35,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:15:35,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-08 02:15:35,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-08 02:15:35,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable39 [2024-05-08 02:15:35,683 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-08 02:15:35,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:15:35,683 INFO L85 PathProgramCache]: Analyzing trace with hash 266743678, now seen corresponding path program 4 times [2024-05-08 02:15:35,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:15:35,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294359512] [2024-05-08 02:15:35,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:15:35,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:15:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:15:35,854 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-08 02:15:35,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:15:35,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294359512] [2024-05-08 02:15:35,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294359512] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 02:15:35,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 02:15:35,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-08 02:15:35,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261261064] [2024-05-08 02:15:35,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 02:15:35,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-08 02:15:35,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:15:35,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-08 02:15:35,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-08 02:15:35,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:35,869 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:15:35,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-08 02:15:35,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:35,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:15:35,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:15:35,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-08 02:15:35,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-08 02:15:35,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:50,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:15:50,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:15:50,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:15:50,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-08 02:15:50,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-08 02:15:50,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-08 02:15:50,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-08 02:15:50,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-05-08 02:15:50,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-08 02:15:50,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-08 02:15:50,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-05-08 02:15:50,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-08 02:15:50,373 INFO L448 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-08 02:15:50,376 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-08 02:15:50,376 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-08 02:15:50,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.05 02:15:50 BasicIcfg [2024-05-08 02:15:50,380 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-08 02:15:50,380 INFO L158 Benchmark]: Toolchain (without parser) took 46682.86ms. Allocated memory was 263.2MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 189.8MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 387.3MB. Max. memory is 8.0GB. [2024-05-08 02:15:50,380 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 263.2MB. Free memory is still 230.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-08 02:15:50,381 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.11ms. Allocated memory is still 263.2MB. Free memory was 189.8MB in the beginning and 168.7MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-05-08 02:15:50,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.89ms. Allocated memory is still 263.2MB. Free memory was 168.7MB in the beginning and 166.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-08 02:15:50,381 INFO L158 Benchmark]: Boogie Preprocessor took 28.73ms. Allocated memory is still 263.2MB. Free memory was 166.6MB in the beginning and 165.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-08 02:15:50,381 INFO L158 Benchmark]: RCFGBuilder took 528.95ms. Allocated memory is still 263.2MB. Free memory was 165.0MB in the beginning and 149.2MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-05-08 02:15:50,382 INFO L158 Benchmark]: TraceAbstraction took 45599.34ms. Allocated memory was 263.2MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 148.2MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 345.4MB. Max. memory is 8.0GB. [2024-05-08 02:15:50,383 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.18ms. Allocated memory is still 263.2MB. Free memory is still 230.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 473.11ms. Allocated memory is still 263.2MB. Free memory was 189.8MB in the beginning and 168.7MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.89ms. Allocated memory is still 263.2MB. Free memory was 168.7MB in the beginning and 166.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.73ms. Allocated memory is still 263.2MB. Free memory was 166.6MB in the beginning and 165.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 528.95ms. Allocated memory is still 263.2MB. Free memory was 165.0MB in the beginning and 149.2MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 45599.34ms. Allocated memory was 263.2MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 148.2MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 345.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2881841, independent: 2857285, independent conditional: 2856947, independent unconditional: 338, dependent: 24556, dependent conditional: 24556, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2880819, independent: 2857285, independent conditional: 2856947, independent unconditional: 338, dependent: 23534, dependent conditional: 23534, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2880819, independent: 2857285, independent conditional: 2856947, independent unconditional: 338, dependent: 23534, dependent conditional: 23534, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2880819, independent: 2857285, independent conditional: 2856947, independent unconditional: 338, dependent: 23534, dependent conditional: 23534, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2968358, independent: 2857285, independent conditional: 1387401, independent unconditional: 1469884, dependent: 111073, dependent conditional: 87558, dependent unconditional: 23515, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2968358, independent: 2857285, independent conditional: 521408, independent unconditional: 2335877, dependent: 111073, dependent conditional: 33811, dependent unconditional: 77262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2968358, independent: 2857285, independent conditional: 521408, independent unconditional: 2335877, dependent: 111073, dependent conditional: 33811, dependent unconditional: 77262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1827, independent: 1795, independent conditional: 275, independent unconditional: 1520, dependent: 32, dependent conditional: 17, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1827, independent: 1753, independent conditional: 0, independent unconditional: 1753, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 74, independent: 42, independent conditional: 33, independent unconditional: 9, dependent: 32, dependent conditional: 17, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 42, independent conditional: 33, independent unconditional: 9, dependent: 32, dependent conditional: 17, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 135, independent: 63, independent conditional: 56, independent unconditional: 8, dependent: 72, dependent conditional: 50, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2968358, independent: 2855490, independent conditional: 521133, independent unconditional: 2334357, dependent: 111041, dependent conditional: 33794, dependent unconditional: 77247, unknown: 1827, unknown conditional: 292, unknown unconditional: 1535] , Statistics on independence cache: Total cache size (in pairs): 1827, Positive cache size: 1795, Positive conditional cache size: 275, Positive unconditional cache size: 1520, Negative cache size: 32, Negative conditional cache size: 17, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 919740, Maximal queried relation: 8, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2968358, independent: 2857285, independent conditional: 1387401, independent unconditional: 1469884, dependent: 111073, dependent conditional: 87558, dependent unconditional: 23515, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2968358, independent: 2857285, independent conditional: 521408, independent unconditional: 2335877, dependent: 111073, dependent conditional: 33811, dependent unconditional: 77262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2968358, independent: 2857285, independent conditional: 521408, independent unconditional: 2335877, dependent: 111073, dependent conditional: 33811, dependent unconditional: 77262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1827, independent: 1795, independent conditional: 275, independent unconditional: 1520, dependent: 32, dependent conditional: 17, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1827, independent: 1753, independent conditional: 0, independent unconditional: 1753, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 74, independent: 42, independent conditional: 33, independent unconditional: 9, dependent: 32, dependent conditional: 17, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 42, independent conditional: 33, independent unconditional: 9, dependent: 32, dependent conditional: 17, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 135, independent: 63, independent conditional: 56, independent unconditional: 8, dependent: 72, dependent conditional: 50, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2968358, independent: 2855490, independent conditional: 521133, independent unconditional: 2334357, dependent: 111041, dependent conditional: 33794, dependent unconditional: 77247, unknown: 1827, unknown conditional: 292, unknown unconditional: 1535] , Statistics on independence cache: Total cache size (in pairs): 1827, Positive cache size: 1795, Positive conditional cache size: 275, Positive unconditional cache size: 1520, Negative cache size: 32, Negative conditional cache size: 17, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 919740 ], Independence queries for same thread: 1022 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 147 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 45.4s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 42.8s, 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: 48, 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.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 513 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 507 ConstructedInterpolants, 0 QuantifiedInterpolants, 2405 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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: 12.2s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 3, ConditionalCommutativityConditionCalculations: 90, ConditionalCommutativityTraceChecks: 33, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-08 02:15:50,401 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-08 02:15:50,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...