/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking FORWARD --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 00:39:24,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 00:39:24,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 00:39:24,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 00:39:24,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 00:39:25,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 00:39:25,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 00:39:25,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 00:39:25,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 00:39:25,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 00:39:25,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 00:39:25,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 00:39:25,034 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 00:39:25,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 00:39:25,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 00:39:25,035 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 00:39:25,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 00:39:25,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 00:39:25,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 00:39:25,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 00:39:25,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 00:39:25,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 00:39:25,043 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 00:39:25,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 00:39:25,047 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 00:39:25,047 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 00:39:25,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 00:39:25,047 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 00:39:25,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 00:39:25,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 00:39:25,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 00:39:25,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 00:39:25,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 00:39:25,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 00:39:25,049 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 00:39:25,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 00:39:25,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 00:39:25,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 00:39:25,050 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 00:39:25,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> FORWARD Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 00:39:25,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 00:39:25,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 00:39:25,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 00:39:25,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 00:39:25,280 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 00:39:25,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-05-07 00:39:26,340 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 00:39:26,532 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 00:39:26,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-05-07 00:39:26,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/904a9f155/e9a83050d10e4c7ab8986f559ff0fc82/FLAGd6c5b88f4 [2024-05-07 00:39:26,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/904a9f155/e9a83050d10e4c7ab8986f559ff0fc82 [2024-05-07 00:39:26,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 00:39:26,570 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 00:39:26,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 00:39:26,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 00:39:26,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 00:39:26,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:39:26" (1/1) ... [2024-05-07 00:39:26,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c97bb99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:39:26, skipping insertion in model container [2024-05-07 00:39:26,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:39:26" (1/1) ... [2024-05-07 00:39:26,617 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 00:39:26,747 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/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2024-05-07 00:39:26,889 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 00:39:26,898 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 00:39:26,909 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/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2024-05-07 00:39:26,942 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 00:39:26,970 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 00:39:26,970 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 00:39:26,976 INFO L206 MainTranslator]: Completed translation [2024-05-07 00:39:26,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:39:26 WrapperNode [2024-05-07 00:39:26,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 00:39:26,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 00:39:26,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 00:39:26,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 00:39:26,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:39:26" (1/1) ... [2024-05-07 00:39:27,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:39:26" (1/1) ... [2024-05-07 00:39:27,026 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2024-05-07 00:39:27,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 00:39:27,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 00:39:27,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 00:39:27,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 00:39:27,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:39:26" (1/1) ... [2024-05-07 00:39:27,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:39:26" (1/1) ... [2024-05-07 00:39:27,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:39:26" (1/1) ... [2024-05-07 00:39:27,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:39:26" (1/1) ... [2024-05-07 00:39:27,052 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:39:26" (1/1) ... [2024-05-07 00:39:27,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:39:26" (1/1) ... [2024-05-07 00:39:27,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:39:26" (1/1) ... [2024-05-07 00:39:27,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:39:26" (1/1) ... [2024-05-07 00:39:27,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 00:39:27,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 00:39:27,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 00:39:27,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 00:39:27,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:39:26" (1/1) ... [2024-05-07 00:39:27,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 00:39:27,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 00:39:27,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-07 00:39:27,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-07 00:39:27,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 00:39:27,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 00:39:27,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 00:39:27,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 00:39:27,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 00:39:27,181 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-07 00:39:27,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-07 00:39:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-07 00:39:27,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-07 00:39:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-07 00:39:27,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-07 00:39:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 00:39:27,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 00:39:27,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 00:39:27,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 00:39:27,189 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 00:39:27,382 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 00:39:27,395 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 00:39:27,570 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 00:39:27,577 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 00:39:27,578 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-07 00:39:27,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:39:27 BoogieIcfgContainer [2024-05-07 00:39:27,579 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 00:39:27,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 00:39:27,581 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 00:39:27,583 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 00:39:27,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 12:39:26" (1/3) ... [2024-05-07 00:39:27,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7006fe78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:39:27, skipping insertion in model container [2024-05-07 00:39:27,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:39:26" (2/3) ... [2024-05-07 00:39:27,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7006fe78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:39:27, skipping insertion in model container [2024-05-07 00:39:27,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:39:27" (3/3) ... [2024-05-07 00:39:27,585 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2024-05-07 00:39:27,591 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 00:39:27,599 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 00:39:27,599 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 00:39:27,600 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 00:39:27,641 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-07 00:39:27,671 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 00:39:27,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 00:39:27,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 00:39:27,678 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 00:39:27,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-07 00:39:27,718 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 00:39:27,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:39:27,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 00:39:27,738 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;@70dd3893, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 00:39:27,738 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-07 00:39:27,799 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 1 more)] === [2024-05-07 00:39:27,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:39:27,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1765759485, now seen corresponding path program 1 times [2024-05-07 00:39:27,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:39:27,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126603965] [2024-05-07 00:39:27,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:27,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:39:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:39:28,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:39:28,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126603965] [2024-05-07 00:39:28,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126603965] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:39:28,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:39:28,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 00:39:28,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609366465] [2024-05-07 00:39:28,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:39:28,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 00:39:28,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:39:28,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 00:39:28,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 00:39:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:28,092 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:39:28,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 00:39:28,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:28,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:28,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 00:39:28,140 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 1 more)] === [2024-05-07 00:39:28,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:39:28,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1974142207, now seen corresponding path program 1 times [2024-05-07 00:39:28,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:39:28,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273275948] [2024-05-07 00:39:28,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:28,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:39:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:39:28,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:39:28,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273275948] [2024-05-07 00:39:28,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273275948] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:39:28,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:39:28,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 00:39:28,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398818839] [2024-05-07 00:39:28,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:39:28,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 00:39:28,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:39:28,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 00:39:28,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-07 00:39:28,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:28,618 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:39:28,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 00:39:28,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:28,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:29,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1379691819, now seen corresponding path program 1 times [2024-05-07 00:39:29,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:29,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:39:29,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:39:29,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:29,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:39:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:39:29,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 00:39:29,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-07 00:39:29,713 INFO L85 PathProgramCache]: Analyzing trace with hash -283309863, now seen corresponding path program 1 times [2024-05-07 00:39:29,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:29,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:29,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:29,907 INFO L85 PathProgramCache]: Analyzing trace with hash 361471003, now seen corresponding path program 1 times [2024-05-07 00:39:29,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:29,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:29,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:30,033 INFO L85 PathProgramCache]: Analyzing trace with hash -420384456, now seen corresponding path program 1 times [2024-05-07 00:39:30,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:30,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:30,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:30,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1265097459, now seen corresponding path program 1 times [2024-05-07 00:39:30,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:30,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:30,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:30,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1841924918, now seen corresponding path program 1 times [2024-05-07 00:39:30,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:30,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:30,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:30,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1444890337, now seen corresponding path program 1 times [2024-05-07 00:39:30,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:30,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:30,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:30,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1570630030, now seen corresponding path program 1 times [2024-05-07 00:39:30,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:30,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:30,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:30,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1436138861, now seen corresponding path program 1 times [2024-05-07 00:39:30,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:30,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:30,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:30,682 INFO L85 PathProgramCache]: Analyzing trace with hash -923504249, now seen corresponding path program 1 times [2024-05-07 00:39:30,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:30,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:30,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:30,822 INFO L85 PathProgramCache]: Analyzing trace with hash 801493557, now seen corresponding path program 1 times [2024-05-07 00:39:30,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:30,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:30,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:30,872 INFO L85 PathProgramCache]: Analyzing trace with hash 302949334, now seen corresponding path program 1 times [2024-05-07 00:39:30,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:30,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:30,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:31,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1358292246, now seen corresponding path program 1 times [2024-05-07 00:39:31,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:31,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:31,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:31,251 INFO L85 PathProgramCache]: Analyzing trace with hash 691520574, now seen corresponding path program 1 times [2024-05-07 00:39:31,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:31,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:31,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:31,403 INFO L85 PathProgramCache]: Analyzing trace with hash 456503254, now seen corresponding path program 1 times [2024-05-07 00:39:31,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:31,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:31,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:31,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1370747405, now seen corresponding path program 1 times [2024-05-07 00:39:31,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:31,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:31,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash 756759680, now seen corresponding path program 1 times [2024-05-07 00:39:32,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:32,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:32,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:32,375 INFO L85 PathProgramCache]: Analyzing trace with hash -615818479, now seen corresponding path program 1 times [2024-05-07 00:39:32,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:32,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:32,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:32,495 INFO L85 PathProgramCache]: Analyzing trace with hash 395777220, now seen corresponding path program 1 times [2024-05-07 00:39:32,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:32,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:32,504 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:32,549 INFO L85 PathProgramCache]: Analyzing trace with hash -2065440221, now seen corresponding path program 1 times [2024-05-07 00:39:32,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:32,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:32,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2144836564, now seen corresponding path program 1 times [2024-05-07 00:39:32,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:32,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:32,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:32,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1454834263, now seen corresponding path program 1 times [2024-05-07 00:39:32,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:32,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:32,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:32,685 INFO L85 PathProgramCache]: Analyzing trace with hash 739667475, now seen corresponding path program 1 times [2024-05-07 00:39:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:32,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:32,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:32,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:32,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-07 00:39:32,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25 [2024-05-07 00:39:32,736 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 1 more)] === [2024-05-07 00:39:32,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:39:32,736 INFO L85 PathProgramCache]: Analyzing trace with hash -906602203, now seen corresponding path program 1 times [2024-05-07 00:39:32,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:39:32,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169997035] [2024-05-07 00:39:32,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:32,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:39:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:39:32,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:39:32,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169997035] [2024-05-07 00:39:32,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169997035] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:39:32,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:39:32,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-07 00:39:32,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437593558] [2024-05-07 00:39:32,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:39:32,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-07 00:39:32,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:39:32,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 00:39:32,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-07 00:39:32,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:32,864 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:39:32,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 00:39:32,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:32,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-07 00:39:32,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:33,799 INFO L85 PathProgramCache]: Analyzing trace with hash -2089494718, now seen corresponding path program 1 times [2024-05-07 00:39:33,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:33,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:33,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:33,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1747672049, now seen corresponding path program 1 times [2024-05-07 00:39:33,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:33,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:33,867 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:33,947 INFO L85 PathProgramCache]: Analyzing trace with hash -194923514, now seen corresponding path program 1 times [2024-05-07 00:39:33,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:33,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:33,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:34,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1668853087, now seen corresponding path program 1 times [2024-05-07 00:39:34,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:34,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:34,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:34,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1439306770, now seen corresponding path program 1 times [2024-05-07 00:39:34,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:34,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:34,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:34,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1893235285, now seen corresponding path program 1 times [2024-05-07 00:39:34,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:34,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:34,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:34,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1878589867, now seen corresponding path program 1 times [2024-05-07 00:39:34,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:34,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:34,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:39:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:39:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-07 00:39:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-07 00:39:34,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 00:39:34,241 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 1 more)] === [2024-05-07 00:39:34,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:39:34,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1856835031, now seen corresponding path program 2 times [2024-05-07 00:39:34,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:39:34,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739052418] [2024-05-07 00:39:34,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:34,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:39:34,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-07 00:39:34,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:39:34,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739052418] [2024-05-07 00:39:34,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739052418] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:39:34,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:39:34,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 00:39:34,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232856352] [2024-05-07 00:39:34,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:39:34,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 00:39:34,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:39:34,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 00:39:34,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-07 00:39:34,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:34,342 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:39:34,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 00:39:34,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:34,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-07 00:39:34,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-07 00:39:34,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:35,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:35,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-07 00:39:35,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-07 00:39:35,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:39:35,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-07 00:39:35,453 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 1 more)] === [2024-05-07 00:39:35,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:39:35,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1555204803, now seen corresponding path program 3 times [2024-05-07 00:39:35,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:39:35,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449540606] [2024-05-07 00:39:35,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:39:35,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:39:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:39:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:39:35,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:39:35,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449540606] [2024-05-07 00:39:35,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449540606] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:39:35,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:39:35,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 00:39:35,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531787240] [2024-05-07 00:39:35,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:39:35,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 00:39:35,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:39:35,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 00:39:35,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-07 00:39:35,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:35,563 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:39:35,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 00:39:35,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:35,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-07 00:39:35,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-07 00:39:35,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:39:35,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:36,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:39:36,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-07 00:39:36,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-07 00:39:36,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:39:36,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:39:36,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-07 00:39:36,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-07 00:39:36,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-07 00:39:36,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-07 00:39:36,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-07 00:39:36,826 INFO L448 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-07 00:39:36,828 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 00:39:36,828 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 00:39:36,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 12:39:36 BasicIcfg [2024-05-07 00:39:36,831 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 00:39:36,831 INFO L158 Benchmark]: Toolchain (without parser) took 10261.16ms. Allocated memory was 245.4MB in the beginning and 498.1MB in the end (delta: 252.7MB). Free memory was 175.1MB in the beginning and 438.0MB in the end (delta: -262.9MB). Peak memory consumption was 268.6MB. Max. memory is 8.0GB. [2024-05-07 00:39:36,831 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 245.4MB. Free memory is still 214.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 00:39:36,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.03ms. Allocated memory is still 245.4MB. Free memory was 174.9MB in the beginning and 154.2MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-05-07 00:39:36,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.93ms. Allocated memory is still 245.4MB. Free memory was 154.2MB in the beginning and 152.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 00:39:36,832 INFO L158 Benchmark]: Boogie Preprocessor took 29.63ms. Allocated memory is still 245.4MB. Free memory was 152.1MB in the beginning and 150.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-07 00:39:36,832 INFO L158 Benchmark]: RCFGBuilder took 521.42ms. Allocated memory is still 245.4MB. Free memory was 150.6MB in the beginning and 202.4MB in the end (delta: -51.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-05-07 00:39:36,832 INFO L158 Benchmark]: TraceAbstraction took 9250.04ms. Allocated memory was 245.4MB in the beginning and 498.1MB in the end (delta: 252.7MB). Free memory was 200.8MB in the beginning and 438.0MB in the end (delta: -237.2MB). Peak memory consumption was 294.5MB. Max. memory is 8.0GB. [2024-05-07 00:39:36,833 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.10ms. Allocated memory is still 245.4MB. Free memory is still 214.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 406.03ms. Allocated memory is still 245.4MB. Free memory was 174.9MB in the beginning and 154.2MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.93ms. Allocated memory is still 245.4MB. Free memory was 154.2MB in the beginning and 152.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.63ms. Allocated memory is still 245.4MB. Free memory was 152.1MB in the beginning and 150.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 521.42ms. Allocated memory is still 245.4MB. Free memory was 150.6MB in the beginning and 202.4MB in the end (delta: -51.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9250.04ms. Allocated memory was 245.4MB in the beginning and 498.1MB in the end (delta: 252.7MB). Free memory was 200.8MB in the beginning and 438.0MB in the end (delta: -237.2MB). Peak memory consumption was 294.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 242963, independent: 239549, independent conditional: 239360, independent unconditional: 189, dependent: 3414, dependent conditional: 3414, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 242780, independent: 239549, independent conditional: 239360, independent unconditional: 189, dependent: 3231, dependent conditional: 3231, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 242780, independent: 239549, independent conditional: 239360, independent unconditional: 189, dependent: 3231, dependent conditional: 3231, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 242780, independent: 239549, independent conditional: 239360, independent unconditional: 189, dependent: 3231, dependent conditional: 3231, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 251653, independent: 239549, independent conditional: 113754, independent unconditional: 125795, dependent: 12104, dependent conditional: 8763, dependent unconditional: 3341, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 251653, independent: 239549, independent conditional: 49349, independent unconditional: 190200, dependent: 12104, dependent conditional: 4684, dependent unconditional: 7420, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 251653, independent: 239549, independent conditional: 49349, independent unconditional: 190200, dependent: 12104, dependent conditional: 4684, dependent unconditional: 7420, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1052, independent: 1017, independent conditional: 195, independent unconditional: 822, dependent: 35, dependent conditional: 22, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1052, independent: 1000, independent conditional: 0, independent unconditional: 1000, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 52, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 35, dependent conditional: 22, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 35, dependent conditional: 22, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 77, independent: 22, independent conditional: 13, independent unconditional: 8, dependent: 56, dependent conditional: 45, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 251653, independent: 238532, independent conditional: 49154, independent unconditional: 189378, dependent: 12069, dependent conditional: 4662, dependent unconditional: 7407, unknown: 1052, unknown conditional: 217, unknown unconditional: 835] , Statistics on independence cache: Total cache size (in pairs): 1052, Positive cache size: 1017, Positive conditional cache size: 195, Positive unconditional cache size: 822, Negative cache size: 35, Negative conditional cache size: 22, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 68484, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 251653, independent: 239549, independent conditional: 113754, independent unconditional: 125795, dependent: 12104, dependent conditional: 8763, dependent unconditional: 3341, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 251653, independent: 239549, independent conditional: 49349, independent unconditional: 190200, dependent: 12104, dependent conditional: 4684, dependent unconditional: 7420, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 251653, independent: 239549, independent conditional: 49349, independent unconditional: 190200, dependent: 12104, dependent conditional: 4684, dependent unconditional: 7420, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1052, independent: 1017, independent conditional: 195, independent unconditional: 822, dependent: 35, dependent conditional: 22, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1052, independent: 1000, independent conditional: 0, independent unconditional: 1000, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 52, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 35, dependent conditional: 22, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 35, dependent conditional: 22, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 77, independent: 22, independent conditional: 13, independent unconditional: 8, dependent: 56, dependent conditional: 45, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 251653, independent: 238532, independent conditional: 49154, independent unconditional: 189378, dependent: 12069, dependent conditional: 4662, dependent unconditional: 7407, unknown: 1052, unknown conditional: 217, unknown unconditional: 835] , Statistics on independence cache: Total cache size (in pairs): 1052, Positive cache size: 1017, Positive conditional cache size: 195, Positive unconditional cache size: 822, Negative cache size: 35, Negative conditional cache size: 22, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 68484 ], Independence queries for same thread: 183 - 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 7 procedures, 118 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 8.0s, 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: 41, 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, 0.8s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 1278 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: 4.9s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 81, ConditionalCommutativityTraceChecks: 30, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-07 00:39:36,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-07 00:39:37,065 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...