/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/safe003_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-08 01:48:58,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-08 01:48:58,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-08 01:48:58,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-08 01:48:58,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-08 01:48:58,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-08 01:48:58,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-08 01:48:58,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-08 01:48:58,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-08 01:48:58,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-08 01:48:58,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-08 01:48:58,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-08 01:48:58,252 INFO L153 SettingsManager]: * Use SBE=true [2024-05-08 01:48:58,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-08 01:48:58,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-08 01:48:58,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-08 01:48:58,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-08 01:48:58,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-08 01:48:58,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-08 01:48:58,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-08 01:48:58,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-08 01:48:58,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-08 01:48:58,256 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-08 01:48:58,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-08 01:48:58,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-08 01:48:58,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-08 01:48:58,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-08 01:48:58,257 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-08 01:48:58,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-08 01:48:58,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 01:48:58,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-08 01:48:58,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-08 01:48:58,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-08 01:48:58,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-08 01:48:58,259 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-08 01:48:58,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-08 01:48:58,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-08 01:48:58,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-08 01:48:58,259 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-08 01:48:58,260 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 01:48:58,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-08 01:48:58,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-08 01:48:58,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-08 01:48:58,566 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-08 01:48:58,572 INFO L274 PluginConnector]: CDTParser initialized [2024-05-08 01:48:58,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_tso.i [2024-05-08 01:48:59,761 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-08 01:49:00,057 INFO L384 CDTParser]: Found 1 translation units. [2024-05-08 01:49:00,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_tso.i [2024-05-08 01:49:00,072 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8723c7e36/3a05dab2bf1f42b7899c4650a28dcf4e/FLAG213e4699e [2024-05-08 01:49:00,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8723c7e36/3a05dab2bf1f42b7899c4650a28dcf4e [2024-05-08 01:49:00,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-08 01:49:00,094 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-08 01:49:00,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-08 01:49:00,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-08 01:49:00,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-08 01:49:00,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 01:49:00" (1/1) ... [2024-05-08 01:49:00,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3368f01a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 01:49:00, skipping insertion in model container [2024-05-08 01:49:00,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 01:49:00" (1/1) ... [2024-05-08 01:49:00,146 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-08 01:49:00,294 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/safe003_tso.i[945,958] [2024-05-08 01:49:00,474 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 01:49:00,485 INFO L202 MainTranslator]: Completed pre-run [2024-05-08 01:49:00,498 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/safe003_tso.i[945,958] [2024-05-08 01:49:00,522 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 01:49:00,553 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-08 01:49:00,553 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-08 01:49:00,560 INFO L206 MainTranslator]: Completed translation [2024-05-08 01:49:00,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 01:49:00 WrapperNode [2024-05-08 01:49:00,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-08 01:49:00,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-08 01:49:00,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-08 01:49:00,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-08 01:49:00,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 01:49:00" (1/1) ... [2024-05-08 01:49:00,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 01:49:00" (1/1) ... [2024-05-08 01:49:00,629 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2024-05-08 01:49:00,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-08 01:49:00,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-08 01:49:00,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-08 01:49:00,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-08 01:49:00,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 01:49:00" (1/1) ... [2024-05-08 01:49:00,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 01:49:00" (1/1) ... [2024-05-08 01:49:00,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 01:49:00" (1/1) ... [2024-05-08 01:49:00,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 01:49:00" (1/1) ... [2024-05-08 01:49:00,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 01:49:00" (1/1) ... [2024-05-08 01:49:00,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 01:49:00" (1/1) ... [2024-05-08 01:49:00,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 01:49:00" (1/1) ... [2024-05-08 01:49:00,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 01:49:00" (1/1) ... [2024-05-08 01:49:00,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-08 01:49:00,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-08 01:49:00,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-08 01:49:00,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-08 01:49:00,679 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 01:49:00" (1/1) ... [2024-05-08 01:49:00,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 01:49:00,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 01:49:00,712 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 01:49:00,743 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 01:49:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-08 01:49:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-08 01:49:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-08 01:49:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-08 01:49:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-08 01:49:00,794 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-08 01:49:00,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-08 01:49:00,795 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-08 01:49:00,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-08 01:49:00,795 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-08 01:49:00,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-08 01:49:00,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-08 01:49:00,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-08 01:49:00,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-08 01:49:00,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-08 01:49:00,802 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 01:49:00,933 INFO L241 CfgBuilder]: Building ICFG [2024-05-08 01:49:00,935 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-08 01:49:01,053 INFO L282 CfgBuilder]: Performing block encoding [2024-05-08 01:49:01,063 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-08 01:49:01,063 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-08 01:49:01,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 01:49:01 BoogieIcfgContainer [2024-05-08 01:49:01,065 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-08 01:49:01,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-08 01:49:01,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-08 01:49:01,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-08 01:49:01,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.05 01:49:00" (1/3) ... [2024-05-08 01:49:01,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d86f215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 01:49:01, skipping insertion in model container [2024-05-08 01:49:01,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 01:49:00" (2/3) ... [2024-05-08 01:49:01,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d86f215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 01:49:01, skipping insertion in model container [2024-05-08 01:49:01,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 01:49:01" (3/3) ... [2024-05-08 01:49:01,072 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_tso.i [2024-05-08 01:49:01,078 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-08 01:49:01,085 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-08 01:49:01,085 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-08 01:49:01,085 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-08 01:49:01,154 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-08 01:49:01,188 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-08 01:49:01,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-08 01:49:01,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 01:49:01,191 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 01:49:01,192 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 01:49:01,222 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-08 01:49:01,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 01:49:01,236 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-08 01:49:01,243 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;@63c3a334, 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 01:49:01,243 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-08 01:49:01,298 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-08 01:49:01,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 01:49:01,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1765759485, now seen corresponding path program 1 times [2024-05-08 01:49:01,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 01:49:01,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746367116] [2024-05-08 01:49:01,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:01,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 01:49:01,594 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 01:49:01,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 01:49:01,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746367116] [2024-05-08 01:49:01,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746367116] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 01:49:01,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 01:49:01,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-08 01:49:01,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973418992] [2024-05-08 01:49:01,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 01:49:01,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-08 01:49:01,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 01:49:01,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-08 01:49:01,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-08 01:49:01,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 01:49:01,695 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 01:49:01,696 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-08 01:49:01,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 01:49:01,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 01:49:01,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-08 01:49:01,731 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-08 01:49:01,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 01:49:01,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1974142207, now seen corresponding path program 1 times [2024-05-08 01:49:01,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 01:49:01,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975525534] [2024-05-08 01:49:01,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:01,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 01:49:02,276 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 01:49:02,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 01:49:02,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975525534] [2024-05-08 01:49:02,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975525534] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 01:49:02,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 01:49:02,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-08 01:49:02,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102270280] [2024-05-08 01:49:02,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 01:49:02,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-08 01:49:02,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 01:49:02,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-08 01:49:02,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-08 01:49:02,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 01:49:02,289 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 01:49:02,289 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-08 01:49:02,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 01:49:02,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 01:49:02,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1379691819, now seen corresponding path program 1 times [2024-05-08 01:49:02,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:02,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 01:49:02,890 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 01:49:02,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:02,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 01:49:02,994 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 01:49:02,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-08 01:49:02,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-08 01:49:03,379 INFO L85 PathProgramCache]: Analyzing trace with hash -283309863, now seen corresponding path program 1 times [2024-05-08 01:49:03,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:03,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:03,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:03,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 01:49:03,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-08 01:49:03,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-08 01:49:03,475 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-08 01:49:03,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 01:49:03,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1987989425, now seen corresponding path program 1 times [2024-05-08 01:49:03,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 01:49:03,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219782283] [2024-05-08 01:49:03,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:03,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 01:49:03,780 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 01:49:03,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 01:49:03,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219782283] [2024-05-08 01:49:03,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219782283] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 01:49:03,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 01:49:03,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-08 01:49:03,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009698159] [2024-05-08 01:49:03,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 01:49:03,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-08 01:49:03,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 01:49:03,943 INFO L85 PathProgramCache]: Analyzing trace with hash -283309863, now seen corresponding path program 2 times [2024-05-08 01:49:03,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:03,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:03,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:03,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-08 01:49:03,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-05-08 01:49:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 01:49:03,994 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 01:49:03,994 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-08 01:49:03,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 01:49:03,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-08 01:49:03,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 01:49:04,349 INFO L85 PathProgramCache]: Analyzing trace with hash -283309863, now seen corresponding path program 3 times [2024-05-08 01:49:04,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:04,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:04,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash 361471003, now seen corresponding path program 1 times [2024-05-08 01:49:04,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:04,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:04,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:04,794 INFO L85 PathProgramCache]: Analyzing trace with hash -420384456, now seen corresponding path program 1 times [2024-05-08 01:49:04,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:04,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:04,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:04,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1438000536, now seen corresponding path program 1 times [2024-05-08 01:49:04,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:04,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 01:49:05,027 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 01:49:05,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:05,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 01:49:05,083 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 01:49:05,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-08 01:49:05,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-08 01:49:05,281 INFO L85 PathProgramCache]: Analyzing trace with hash -283309863, now seen corresponding path program 4 times [2024-05-08 01:49:05,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:05,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:05,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:05,464 INFO L85 PathProgramCache]: Analyzing trace with hash 361471003, now seen corresponding path program 2 times [2024-05-08 01:49:05,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:05,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:05,477 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:05,658 INFO L85 PathProgramCache]: Analyzing trace with hash -420384456, now seen corresponding path program 2 times [2024-05-08 01:49:05,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:05,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:05,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash 756759680, now seen corresponding path program 1 times [2024-05-08 01:49:09,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:09,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:09,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:10,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 01:49:10,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-08 01:49:10,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-08 01:49:10,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15 [2024-05-08 01:49:10,796 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-08 01:49:10,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 01:49:10,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1252099918, now seen corresponding path program 1 times [2024-05-08 01:49:10,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 01:49:10,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186776845] [2024-05-08 01:49:10,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:10,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 01:49:10,973 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 01:49:10,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 01:49:10,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186776845] [2024-05-08 01:49:10,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186776845] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 01:49:10,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 01:49:10,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-08 01:49:10,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136300708] [2024-05-08 01:49:10,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 01:49:10,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-08 01:49:10,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 01:49:11,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1314540793, now seen corresponding path program 1 times [2024-05-08 01:49:11,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:11,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 01:49:11,162 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 01:49:11,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:11,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 01:49:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 01:49:11,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-05-08 01:49:11,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-05-08 01:49:11,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 01:49:11,332 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 01:49:11,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.0) internal successors, (117), 14 states have internal predecessors, (117), 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 01:49:11,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 01:49:11,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-08 01:49:11,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-05-08 01:49:11,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 01:49:14,802 INFO L85 PathProgramCache]: Analyzing trace with hash -974713489, now seen corresponding path program 1 times [2024-05-08 01:49:14,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:14,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:14,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:14,928 INFO L85 PathProgramCache]: Analyzing trace with hash -31113678, now seen corresponding path program 1 times [2024-05-08 01:49:14,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:14,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:14,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:15,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1525669377, now seen corresponding path program 1 times [2024-05-08 01:49:15,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:15,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:15,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:15,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1889940070, now seen corresponding path program 1 times [2024-05-08 01:49:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:15,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:15,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:15,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1028978891, now seen corresponding path program 1 times [2024-05-08 01:49:15,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:15,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:15,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:15,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1279462463, now seen corresponding path program 1 times [2024-05-08 01:49:15,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:15,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:15,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:15,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2118588243, now seen corresponding path program 1 times [2024-05-08 01:49:15,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:15,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:15,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:15,556 INFO L85 PathProgramCache]: Analyzing trace with hash -482641966, now seen corresponding path program 1 times [2024-05-08 01:49:15,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:15,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:15,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:15,669 INFO L85 PathProgramCache]: Analyzing trace with hash -659617896, now seen corresponding path program 1 times [2024-05-08 01:49:15,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:15,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:15,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1087429353, now seen corresponding path program 1 times [2024-05-08 01:49:15,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:15,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:15,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:15,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1284656746, now seen corresponding path program 1 times [2024-05-08 01:49:15,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:15,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:15,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:16,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1897714671, now seen corresponding path program 1 times [2024-05-08 01:49:16,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:16,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:16,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:16,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1741716958, now seen corresponding path program 1 times [2024-05-08 01:49:16,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:16,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:16,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:16,221 INFO L85 PathProgramCache]: Analyzing trace with hash 472482808, now seen corresponding path program 1 times [2024-05-08 01:49:16,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:16,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:16,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:16,293 INFO L85 PathProgramCache]: Analyzing trace with hash -538053226, now seen corresponding path program 1 times [2024-05-08 01:49:16,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:16,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:16,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:16,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2094224951, now seen corresponding path program 1 times [2024-05-08 01:49:16,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 01:49:16,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 01:49:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:16,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 01:49:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 01:49:16,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 01:49:16,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-08 01:49:16,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-08 01:49:16,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-05-08 01:49:16,535 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-08 01:49:16,535 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-08 01:49:16,535 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-08 01:49:16,535 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-08 01:49:16,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable20,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable29,SelfDestructingSolverStorable19,SelfDestructingSolverStorable21,SelfDestructingSolverStorable32,SelfDestructingSolverStorable22,SelfDestructingSolverStorable33,SelfDestructingSolverStorable23,SelfDestructingSolverStorable34,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable16,SelfDestructingSolverStorable27,SelfDestructingSolverStorable17,SelfDestructingSolverStorable28 [2024-05-08 01:49:16,540 INFO L448 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-08 01:49:16,542 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-08 01:49:16,542 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-08 01:49:16,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.05 01:49:16 BasicIcfg [2024-05-08 01:49:16,552 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-08 01:49:16,554 INFO L158 Benchmark]: Toolchain (without parser) took 16458.30ms. Allocated memory was 254.8MB in the beginning and 633.3MB in the end (delta: 378.5MB). Free memory was 182.4MB in the beginning and 390.1MB in the end (delta: -207.7MB). Peak memory consumption was 171.1MB. Max. memory is 8.0GB. [2024-05-08 01:49:16,554 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 163.6MB. Free memory was 134.0MB in the beginning and 133.8MB in the end (delta: 185.4kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-08 01:49:16,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.80ms. Allocated memory is still 254.8MB. Free memory was 182.1MB in the beginning and 161.4MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-05-08 01:49:16,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.60ms. Allocated memory is still 254.8MB. Free memory was 161.4MB in the beginning and 159.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-08 01:49:16,555 INFO L158 Benchmark]: Boogie Preprocessor took 46.20ms. Allocated memory is still 254.8MB. Free memory was 159.3MB in the beginning and 157.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-08 01:49:16,555 INFO L158 Benchmark]: RCFGBuilder took 387.91ms. Allocated memory is still 254.8MB. Free memory was 157.8MB in the beginning and 211.1MB in the end (delta: -53.3MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. [2024-05-08 01:49:16,555 INFO L158 Benchmark]: TraceAbstraction took 15485.09ms. Allocated memory was 254.8MB in the beginning and 633.3MB in the end (delta: 378.5MB). Free memory was 209.7MB in the beginning and 390.1MB in the end (delta: -180.4MB). Peak memory consumption was 198.2MB. Max. memory is 8.0GB. [2024-05-08 01:49:16,556 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 163.6MB. Free memory was 134.0MB in the beginning and 133.8MB in the end (delta: 185.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 466.80ms. Allocated memory is still 254.8MB. Free memory was 182.1MB in the beginning and 161.4MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.60ms. Allocated memory is still 254.8MB. Free memory was 161.4MB in the beginning and 159.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.20ms. Allocated memory is still 254.8MB. Free memory was 159.3MB in the beginning and 157.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 387.91ms. Allocated memory is still 254.8MB. Free memory was 157.8MB in the beginning and 211.1MB in the end (delta: -53.3MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. * TraceAbstraction took 15485.09ms. Allocated memory was 254.8MB in the beginning and 633.3MB in the end (delta: 378.5MB). Free memory was 209.7MB in the beginning and 390.1MB in the end (delta: -180.4MB). Peak memory consumption was 198.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 179394, independent: 177086, independent conditional: 176853, independent unconditional: 233, dependent: 2308, dependent conditional: 2308, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 179226, independent: 177086, independent conditional: 176853, independent unconditional: 233, dependent: 2140, dependent conditional: 2140, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179226, independent: 177086, independent conditional: 176853, independent unconditional: 233, dependent: 2140, dependent conditional: 2140, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 179226, independent: 177086, independent conditional: 176853, independent unconditional: 233, dependent: 2140, dependent conditional: 2140, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 185404, independent: 177086, independent conditional: 85791, independent unconditional: 91295, dependent: 8318, dependent conditional: 6092, dependent unconditional: 2226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 185404, independent: 177086, independent conditional: 31556, independent unconditional: 145530, dependent: 8318, dependent conditional: 2465, dependent unconditional: 5853, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 185404, independent: 177086, independent conditional: 31556, independent unconditional: 145530, dependent: 8318, dependent conditional: 2465, dependent unconditional: 5853, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1296, independent: 1235, independent conditional: 236, independent unconditional: 999, dependent: 61, dependent conditional: 37, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1296, independent: 1176, independent conditional: 0, independent unconditional: 1176, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 120, independent: 59, independent conditional: 55, independent unconditional: 4, dependent: 61, dependent conditional: 37, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 120, independent: 59, independent conditional: 55, independent unconditional: 4, dependent: 61, dependent conditional: 37, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 241, independent: 100, independent conditional: 96, independent unconditional: 3, dependent: 141, dependent conditional: 103, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 185404, independent: 175851, independent conditional: 31320, independent unconditional: 144531, dependent: 8257, dependent conditional: 2428, dependent unconditional: 5829, unknown: 1296, unknown conditional: 273, unknown unconditional: 1023] , Statistics on independence cache: Total cache size (in pairs): 1296, Positive cache size: 1235, Positive conditional cache size: 236, Positive unconditional cache size: 999, Negative cache size: 61, Negative conditional cache size: 37, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 57862, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 185404, independent: 177086, independent conditional: 85791, independent unconditional: 91295, dependent: 8318, dependent conditional: 6092, dependent unconditional: 2226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 185404, independent: 177086, independent conditional: 31556, independent unconditional: 145530, dependent: 8318, dependent conditional: 2465, dependent unconditional: 5853, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 185404, independent: 177086, independent conditional: 31556, independent unconditional: 145530, dependent: 8318, dependent conditional: 2465, dependent unconditional: 5853, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1296, independent: 1235, independent conditional: 236, independent unconditional: 999, dependent: 61, dependent conditional: 37, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1296, independent: 1176, independent conditional: 0, independent unconditional: 1176, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 120, independent: 59, independent conditional: 55, independent unconditional: 4, dependent: 61, dependent conditional: 37, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 120, independent: 59, independent conditional: 55, independent unconditional: 4, dependent: 61, dependent conditional: 37, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 241, independent: 100, independent conditional: 96, independent unconditional: 3, dependent: 141, dependent conditional: 103, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 185404, independent: 175851, independent conditional: 31320, independent unconditional: 144531, dependent: 8257, dependent conditional: 2428, dependent unconditional: 5829, unknown: 1296, unknown conditional: 273, unknown unconditional: 1023] , Statistics on independence cache: Total cache size (in pairs): 1296, Positive cache size: 1235, Positive conditional cache size: 236, Positive unconditional cache size: 999, Negative cache size: 61, Negative conditional cache size: 37, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 57862 ], Independence queries for same thread: 168 - 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: 15.3s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 13.3s, 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: 126, 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.0s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 265 ConstructedInterpolants, 0 QuantifiedInterpolants, 1043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 7.9s, ConditionalCommutativityIAIntegrations: 1, ConditionalCommutativityDFSRestarts: 2, ConditionalCommutativityConditionCalculations: 97, ConditionalCommutativityTraceChecks: 28, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-08 01:49:16,576 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-08 01:49:16,780 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...