/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:41:37,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:41:38,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:41:38,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:41:38,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:41:38,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:41:38,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:41:38,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:41:38,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:41:38,072 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:41:38,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:41:38,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:41:38,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:41:38,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:41:38,073 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:41:38,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:41:38,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:41:38,073 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:41:38,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:41:38,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:41:38,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:41:38,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:41:38,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:41:38,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:41:38,073 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:41:38,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:41:38,073 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:41:38,073 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:41:38,074 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:41:38,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:41:38,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:41:38,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:41:38,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:41:38,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:41:38,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:41:38,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:41:38,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:41:38,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:41:38,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:41:38,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:41:38,074 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:41:38,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:41:38,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:41:38,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:41:38,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:41:38,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:41:38,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:41:38,075 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:41:38,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:41:38,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:41:38,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:41:38,287 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:41:38,288 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:41:38,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2025-04-13 21:41:39,497 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2815d4478/757d42c7b05a48898d23884b539fa1e1/FLAG9d9666d67 [2025-04-13 21:41:39,726 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:41:39,727 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2025-04-13 21:41:39,740 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2815d4478/757d42c7b05a48898d23884b539fa1e1/FLAG9d9666d67 [2025-04-13 21:41:40,547 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2815d4478/757d42c7b05a48898d23884b539fa1e1 [2025-04-13 21:41:40,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:41:40,550 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:41:40,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:41:40,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:41:40,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:41:40,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:41:40" (1/1) ... [2025-04-13 21:41:40,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@748ae6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:40, skipping insertion in model container [2025-04-13 21:41:40,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:41:40" (1/1) ... [2025-04-13 21:41:40,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:41:40,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i[958,971] [2025-04-13 21:41:40,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:41:40,911 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:41:40,931 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i[958,971] [2025-04-13 21:41:40,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:41:41,003 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:41:41,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:41 WrapperNode [2025-04-13 21:41:41,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:41:41,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:41:41,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:41:41,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:41:41,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:41" (1/1) ... [2025-04-13 21:41:41,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:41" (1/1) ... [2025-04-13 21:41:41,056 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-04-13 21:41:41,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:41:41,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:41:41,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:41:41,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:41:41,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:41" (1/1) ... [2025-04-13 21:41:41,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:41" (1/1) ... [2025-04-13 21:41:41,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:41" (1/1) ... [2025-04-13 21:41:41,095 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 21:41:41,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:41" (1/1) ... [2025-04-13 21:41:41,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:41" (1/1) ... [2025-04-13 21:41:41,104 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:41" (1/1) ... [2025-04-13 21:41:41,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:41" (1/1) ... [2025-04-13 21:41:41,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:41" (1/1) ... [2025-04-13 21:41:41,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:41" (1/1) ... [2025-04-13 21:41:41,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:41:41,119 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:41:41,119 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:41:41,119 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:41:41,119 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:41" (1/1) ... [2025-04-13 21:41:41,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:41:41,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:41:41,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:41:41,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:41:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:41:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:41:41,164 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 21:41:41,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 21:41:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 21:41:41,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 21:41:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 21:41:41,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 21:41:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-04-13 21:41:41,165 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-04-13 21:41:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:41:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:41:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:41:41,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:41:41,166 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:41:41,276 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:41:41,278 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:41:41,519 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:41:41,520 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:41:41,520 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:41:41,751 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:41:41,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:41:41 BoogieIcfgContainer [2025-04-13 21:41:41,751 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:41:41,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:41:41,754 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:41:41,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:41:41,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:41:40" (1/3) ... [2025-04-13 21:41:41,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e8dd1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:41:41, skipping insertion in model container [2025-04-13 21:41:41,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:41:41" (2/3) ... [2025-04-13 21:41:41,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e8dd1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:41:41, skipping insertion in model container [2025-04-13 21:41:41,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:41:41" (3/3) ... [2025-04-13 21:41:41,759 INFO L128 eAbstractionObserver]: Analyzing ICFG mix017_power.opt_rmo.opt.i [2025-04-13 21:41:41,769 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:41:41,770 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix017_power.opt_rmo.opt.i that has 5 procedures, 46 locations, 41 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-13 21:41:41,770 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:41:41,813 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:41:41,836 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions, 106 flow [2025-04-13 21:41:42,595 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 24026 states, 24023 states have (on average 4.2866003413395495) internal successors, (102977), 24025 states have internal predecessors, (102977), 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) [2025-04-13 21:41:42,614 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:41:42,624 INFO L340 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@f07e963, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:41:42,624 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 21:41:42,692 INFO L278 IsEmpty]: Start isEmpty. Operand has 24026 states, 24023 states have (on average 4.2866003413395495) internal successors, (102977), 24025 states have internal predecessors, (102977), 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) [2025-04-13 21:41:42,695 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 21:41:42,696 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:42,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:41:42,696 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:41:42,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:42,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2111568121, now seen corresponding path program 1 times [2025-04-13 21:41:42,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:42,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670465421] [2025-04-13 21:41:42,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:41:42,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:42,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:41:42,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:41:42,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:41:42,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:43,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:43,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670465421] [2025-04-13 21:41:43,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670465421] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:43,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:43,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:41:43,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375099121] [2025-04-13 21:41:43,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:43,105 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:41:43,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:43,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:41:43,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:41:43,167 INFO L87 Difference]: Start difference. First operand has 24026 states, 24023 states have (on average 4.2866003413395495) internal successors, (102977), 24025 states have internal predecessors, (102977), 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) Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2025-04-13 21:41:43,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:43,636 INFO L93 Difference]: Finished difference Result 24026 states and 102977 transitions. [2025-04-13 21:41:43,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:41:43,638 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2025-04-13 21:41:43,638 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:43,854 INFO L225 Difference]: With dead ends: 24026 [2025-04-13 21:41:43,854 INFO L226 Difference]: Without dead ends: 20008 [2025-04-13 21:41:43,878 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:41:43,880 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:43,881 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:41:43,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20008 states. [2025-04-13 21:41:44,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20008 to 20008. [2025-04-13 21:41:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20008 states, 20007 states have (on average 4.268855900434848) internal successors, (85407), 20007 states have internal predecessors, (85407), 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) [2025-04-13 21:41:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20008 states to 20008 states and 85407 transitions. [2025-04-13 21:41:44,963 INFO L79 Accepts]: Start accepts. Automaton has 20008 states and 85407 transitions. Word has length 8 [2025-04-13 21:41:44,964 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:44,964 INFO L485 AbstractCegarLoop]: Abstraction has 20008 states and 85407 transitions. [2025-04-13 21:41:44,964 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2025-04-13 21:41:44,965 INFO L278 IsEmpty]: Start isEmpty. Operand 20008 states and 85407 transitions. [2025-04-13 21:41:44,970 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 21:41:44,970 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:44,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:41:44,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:41:44,971 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:41:44,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:44,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1692005271, now seen corresponding path program 1 times [2025-04-13 21:41:44,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:44,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394304616] [2025-04-13 21:41:44,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:41:44,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:44,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:41:45,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:41:45,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:41:45,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:45,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:45,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394304616] [2025-04-13 21:41:45,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394304616] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:45,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:45,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:41:45,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853707600] [2025-04-13 21:41:45,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:45,196 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:41:45,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:45,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:41:45,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:41:45,197 INFO L87 Difference]: Start difference. First operand 20008 states and 85407 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2025-04-13 21:41:45,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:45,835 INFO L93 Difference]: Finished difference Result 29978 states and 125668 transitions. [2025-04-13 21:41:45,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:41:45,836 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 14 [2025-04-13 21:41:45,836 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:45,942 INFO L225 Difference]: With dead ends: 29978 [2025-04-13 21:41:45,943 INFO L226 Difference]: Without dead ends: 16258 [2025-04-13 21:41:45,971 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:41:45,972 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 79 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:45,972 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 12 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:41:46,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16258 states. [2025-04-13 21:41:46,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16258 to 16258. [2025-04-13 21:41:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16258 states, 16257 states have (on average 4.1002029894814545) internal successors, (66657), 16257 states have internal predecessors, (66657), 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) [2025-04-13 21:41:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16258 states to 16258 states and 66657 transitions. [2025-04-13 21:41:46,521 INFO L79 Accepts]: Start accepts. Automaton has 16258 states and 66657 transitions. Word has length 14 [2025-04-13 21:41:46,522 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:46,522 INFO L485 AbstractCegarLoop]: Abstraction has 16258 states and 66657 transitions. [2025-04-13 21:41:46,522 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2025-04-13 21:41:46,522 INFO L278 IsEmpty]: Start isEmpty. Operand 16258 states and 66657 transitions. [2025-04-13 21:41:46,534 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:41:46,534 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:46,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:41:46,534 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:41:46,535 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:41:46,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:46,539 INFO L85 PathProgramCache]: Analyzing trace with hash 116414791, now seen corresponding path program 1 times [2025-04-13 21:41:46,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:46,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448560607] [2025-04-13 21:41:46,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:41:46,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:46,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:41:46,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:41:46,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:41:46,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:46,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:46,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:46,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448560607] [2025-04-13 21:41:46,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448560607] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:46,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:46,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:41:46,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832433543] [2025-04-13 21:41:46,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:46,672 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:41:46,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:46,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:41:46,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:41:46,673 INFO L87 Difference]: Start difference. First operand 16258 states and 66657 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2025-04-13 21:41:47,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:47,081 INFO L93 Difference]: Finished difference Result 20478 states and 82193 transitions. [2025-04-13 21:41:47,081 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:41:47,082 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) Word has length 19 [2025-04-13 21:41:47,082 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:47,157 INFO L225 Difference]: With dead ends: 20478 [2025-04-13 21:41:47,157 INFO L226 Difference]: Without dead ends: 10508 [2025-04-13 21:41:47,183 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:41:47,184 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 146 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:47,184 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 16 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:41:47,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10508 states. [2025-04-13 21:41:47,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10508 to 10508. [2025-04-13 21:41:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10508 states, 10507 states have (on average 3.8814123917388406) internal successors, (40782), 10507 states have internal predecessors, (40782), 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) [2025-04-13 21:41:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10508 states to 10508 states and 40782 transitions. [2025-04-13 21:41:47,611 INFO L79 Accepts]: Start accepts. Automaton has 10508 states and 40782 transitions. Word has length 19 [2025-04-13 21:41:47,611 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:47,611 INFO L485 AbstractCegarLoop]: Abstraction has 10508 states and 40782 transitions. [2025-04-13 21:41:47,611 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2025-04-13 21:41:47,611 INFO L278 IsEmpty]: Start isEmpty. Operand 10508 states and 40782 transitions. [2025-04-13 21:41:47,625 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 21:41:47,626 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:47,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:41:47,626 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:41:47,626 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:41:47,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1031329327, now seen corresponding path program 1 times [2025-04-13 21:41:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:47,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743546338] [2025-04-13 21:41:47,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:41:47,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:47,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 21:41:47,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 21:41:47,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:41:47,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:47,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:47,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743546338] [2025-04-13 21:41:47,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743546338] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:47,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:47,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:41:47,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928393959] [2025-04-13 21:41:47,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:47,849 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:41:47,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:47,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:41:47,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:41:47,849 INFO L87 Difference]: Start difference. First operand 10508 states and 40782 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2025-04-13 21:41:48,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:48,110 INFO L93 Difference]: Finished difference Result 11428 states and 43778 transitions. [2025-04-13 21:41:48,110 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:41:48,110 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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) Word has length 24 [2025-04-13 21:41:48,110 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:48,159 INFO L225 Difference]: With dead ends: 11428 [2025-04-13 21:41:48,159 INFO L226 Difference]: Without dead ends: 7208 [2025-04-13 21:41:48,169 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:41:48,170 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 197 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:48,170 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 20 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:41:48,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7208 states. [2025-04-13 21:41:48,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7208 to 7208. [2025-04-13 21:41:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7208 states, 7207 states have (on average 3.827112529485223) internal successors, (27582), 7207 states have internal predecessors, (27582), 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) [2025-04-13 21:41:48,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7208 states to 7208 states and 27582 transitions. [2025-04-13 21:41:48,431 INFO L79 Accepts]: Start accepts. Automaton has 7208 states and 27582 transitions. Word has length 24 [2025-04-13 21:41:48,431 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:48,432 INFO L485 AbstractCegarLoop]: Abstraction has 7208 states and 27582 transitions. [2025-04-13 21:41:48,432 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2025-04-13 21:41:48,432 INFO L278 IsEmpty]: Start isEmpty. Operand 7208 states and 27582 transitions. [2025-04-13 21:41:48,445 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 21:41:48,446 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:48,446 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-04-13 21:41:48,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:41:48,446 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:41:48,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:48,447 INFO L85 PathProgramCache]: Analyzing trace with hash 336675113, now seen corresponding path program 1 times [2025-04-13 21:41:48,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:48,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613923491] [2025-04-13 21:41:48,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:41:48,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:48,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 21:41:48,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 21:41:48,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:41:48,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:48,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:48,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613923491] [2025-04-13 21:41:48,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613923491] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:48,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:48,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:41:48,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938957999] [2025-04-13 21:41:48,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:48,655 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:41:48,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:48,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:41:48,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:41:48,655 INFO L87 Difference]: Start difference. First operand 7208 states and 27582 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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) [2025-04-13 21:41:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:48,891 INFO L93 Difference]: Finished difference Result 7288 states and 27806 transitions. [2025-04-13 21:41:48,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:41:48,891 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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) Word has length 29 [2025-04-13 21:41:48,891 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:48,938 INFO L225 Difference]: With dead ends: 7288 [2025-04-13 21:41:48,938 INFO L226 Difference]: Without dead ends: 6368 [2025-04-13 21:41:48,943 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:41:48,943 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 239 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:48,944 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 16 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:41:48,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6368 states. [2025-04-13 21:41:49,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6368 to 6368. [2025-04-13 21:41:49,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6368 states, 6367 states have (on average 3.870268572326056) internal successors, (24642), 6367 states have internal predecessors, (24642), 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) [2025-04-13 21:41:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6368 states to 6368 states and 24642 transitions. [2025-04-13 21:41:49,165 INFO L79 Accepts]: Start accepts. Automaton has 6368 states and 24642 transitions. Word has length 29 [2025-04-13 21:41:49,166 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:49,166 INFO L485 AbstractCegarLoop]: Abstraction has 6368 states and 24642 transitions. [2025-04-13 21:41:49,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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) [2025-04-13 21:41:49,166 INFO L278 IsEmpty]: Start isEmpty. Operand 6368 states and 24642 transitions. [2025-04-13 21:41:49,179 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 21:41:49,180 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:49,180 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-04-13 21:41:49,180 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:41:49,180 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:41:49,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:49,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2121908886, now seen corresponding path program 1 times [2025-04-13 21:41:49,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:49,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56294367] [2025-04-13 21:41:49,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:41:49,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:49,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 21:41:49,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 21:41:49,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:41:49,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:49,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:49,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56294367] [2025-04-13 21:41:49,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56294367] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:49,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:49,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:41:49,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295171412] [2025-04-13 21:41:49,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:49,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:41:49,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:49,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:41:49,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:41:49,455 INFO L87 Difference]: Start difference. First operand 6368 states and 24642 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2025-04-13 21:41:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:49,666 INFO L93 Difference]: Finished difference Result 8408 states and 32260 transitions. [2025-04-13 21:41:49,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:41:49,667 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) Word has length 35 [2025-04-13 21:41:49,667 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:49,700 INFO L225 Difference]: With dead ends: 8408 [2025-04-13 21:41:49,700 INFO L226 Difference]: Without dead ends: 3838 [2025-04-13 21:41:49,709 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:41:49,709 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 44 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:49,709 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 29 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:41:49,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3838 states. [2025-04-13 21:41:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3838 to 3838. [2025-04-13 21:41:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3838 states, 3837 states have (on average 3.737816002084962) internal successors, (14342), 3837 states have internal predecessors, (14342), 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) [2025-04-13 21:41:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 3838 states and 14342 transitions. [2025-04-13 21:41:49,789 INFO L79 Accepts]: Start accepts. Automaton has 3838 states and 14342 transitions. Word has length 35 [2025-04-13 21:41:49,790 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:49,790 INFO L485 AbstractCegarLoop]: Abstraction has 3838 states and 14342 transitions. [2025-04-13 21:41:49,790 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2025-04-13 21:41:49,790 INFO L278 IsEmpty]: Start isEmpty. Operand 3838 states and 14342 transitions. [2025-04-13 21:41:49,797 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 21:41:49,797 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:49,798 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-04-13 21:41:49,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:41:49,798 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:41:49,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:49,798 INFO L85 PathProgramCache]: Analyzing trace with hash 951646790, now seen corresponding path program 2 times [2025-04-13 21:41:49,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:49,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387145263] [2025-04-13 21:41:49,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:41:49,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:49,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 1 equivalence classes. [2025-04-13 21:41:49,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 21:41:49,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:41:49,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:50,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:50,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:50,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387145263] [2025-04-13 21:41:50,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387145263] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:50,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:50,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:41:50,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443784849] [2025-04-13 21:41:50,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:50,118 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:41:50,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:50,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:41:50,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:41:50,119 INFO L87 Difference]: Start difference. First operand 3838 states and 14342 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2025-04-13 21:41:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:50,329 INFO L93 Difference]: Finished difference Result 5038 states and 18678 transitions. [2025-04-13 21:41:50,329 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:41:50,329 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) Word has length 35 [2025-04-13 21:41:50,329 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:50,369 INFO L225 Difference]: With dead ends: 5038 [2025-04-13 21:41:50,369 INFO L226 Difference]: Without dead ends: 3742 [2025-04-13 21:41:50,374 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:41:50,374 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 51 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:50,374 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 22 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:41:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2025-04-13 21:41:50,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3134. [2025-04-13 21:41:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3134 states, 3133 states have (on average 3.6584743057772102) internal successors, (11462), 3133 states have internal predecessors, (11462), 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) [2025-04-13 21:41:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 11462 transitions. [2025-04-13 21:41:50,489 INFO L79 Accepts]: Start accepts. Automaton has 3134 states and 11462 transitions. Word has length 35 [2025-04-13 21:41:50,489 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:50,489 INFO L485 AbstractCegarLoop]: Abstraction has 3134 states and 11462 transitions. [2025-04-13 21:41:50,489 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2025-04-13 21:41:50,489 INFO L278 IsEmpty]: Start isEmpty. Operand 3134 states and 11462 transitions. [2025-04-13 21:41:50,497 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 21:41:50,497 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:50,497 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-04-13 21:41:50,497 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 21:41:50,498 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:41:50,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:50,498 INFO L85 PathProgramCache]: Analyzing trace with hash 488059166, now seen corresponding path program 3 times [2025-04-13 21:41:50,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:50,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157792578] [2025-04-13 21:41:50,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:41:50,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:50,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 1 equivalence classes. [2025-04-13 21:41:50,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 21:41:50,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:41:50,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:50,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:50,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157792578] [2025-04-13 21:41:50,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157792578] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:50,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:50,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:41:50,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621976198] [2025-04-13 21:41:50,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:50,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:41:50,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:50,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:41:50,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:41:50,775 INFO L87 Difference]: Start difference. First operand 3134 states and 11462 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2025-04-13 21:41:50,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:50,956 INFO L93 Difference]: Finished difference Result 4494 states and 16318 transitions. [2025-04-13 21:41:50,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:41:50,957 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) Word has length 35 [2025-04-13 21:41:50,957 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:50,988 INFO L225 Difference]: With dead ends: 4494 [2025-04-13 21:41:50,989 INFO L226 Difference]: Without dead ends: 1630 [2025-04-13 21:41:50,995 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:41:50,996 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 48 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:50,998 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 29 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:41:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2025-04-13 21:41:51,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1630. [2025-04-13 21:41:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1629 states have (on average 3.4990791896869244) internal successors, (5700), 1629 states have internal predecessors, (5700), 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) [2025-04-13 21:41:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 5700 transitions. [2025-04-13 21:41:51,058 INFO L79 Accepts]: Start accepts. Automaton has 1630 states and 5700 transitions. Word has length 35 [2025-04-13 21:41:51,058 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:51,058 INFO L485 AbstractCegarLoop]: Abstraction has 1630 states and 5700 transitions. [2025-04-13 21:41:51,058 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2025-04-13 21:41:51,059 INFO L278 IsEmpty]: Start isEmpty. Operand 1630 states and 5700 transitions. [2025-04-13 21:41:51,063 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 21:41:51,063 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:51,063 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-04-13 21:41:51,063 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:41:51,063 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:41:51,063 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:51,064 INFO L85 PathProgramCache]: Analyzing trace with hash -616546458, now seen corresponding path program 4 times [2025-04-13 21:41:51,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:51,064 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725687189] [2025-04-13 21:41:51,064 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:41:51,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:51,074 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 21:41:51,123 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 21:41:51,123 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:41:51,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:51,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:51,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:51,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725687189] [2025-04-13 21:41:51,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725687189] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:51,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:51,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:41:51,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745054184] [2025-04-13 21:41:51,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:51,285 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:41:51,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:51,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:41:51,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:41:51,285 INFO L87 Difference]: Start difference. First operand 1630 states and 5700 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2025-04-13 21:41:51,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:51,447 INFO L93 Difference]: Finished difference Result 2350 states and 8212 transitions. [2025-04-13 21:41:51,447 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:41:51,447 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) Word has length 35 [2025-04-13 21:41:51,447 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:51,478 INFO L225 Difference]: With dead ends: 2350 [2025-04-13 21:41:51,478 INFO L226 Difference]: Without dead ends: 1414 [2025-04-13 21:41:51,480 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:41:51,481 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 41 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:51,481 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 25 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:41:51,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-04-13 21:41:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2025-04-13 21:41:51,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1413 states have (on average 3.45930644019816) internal successors, (4888), 1413 states have internal predecessors, (4888), 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) [2025-04-13 21:41:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 4888 transitions. [2025-04-13 21:41:51,534 INFO L79 Accepts]: Start accepts. Automaton has 1414 states and 4888 transitions. Word has length 35 [2025-04-13 21:41:51,534 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:51,534 INFO L485 AbstractCegarLoop]: Abstraction has 1414 states and 4888 transitions. [2025-04-13 21:41:51,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2025-04-13 21:41:51,534 INFO L278 IsEmpty]: Start isEmpty. Operand 1414 states and 4888 transitions. [2025-04-13 21:41:51,538 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 21:41:51,538 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:51,538 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-04-13 21:41:51,538 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 21:41:51,538 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:41:51,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:51,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1878003672, now seen corresponding path program 5 times [2025-04-13 21:41:51,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:51,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000111860] [2025-04-13 21:41:51,539 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:41:51,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:51,551 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 1 equivalence classes. [2025-04-13 21:41:51,604 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 21:41:51,604 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:41:51,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:52,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:52,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000111860] [2025-04-13 21:41:52,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000111860] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:52,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:52,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:41:52,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10726686] [2025-04-13 21:41:52,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:52,548 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 21:41:52,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:52,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 21:41:52,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:41:52,549 INFO L87 Difference]: Start difference. First operand 1414 states and 4888 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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) [2025-04-13 21:41:52,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:52,785 INFO L93 Difference]: Finished difference Result 2570 states and 8774 transitions. [2025-04-13 21:41:52,785 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:41:52,786 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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) Word has length 35 [2025-04-13 21:41:52,786 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:52,817 INFO L225 Difference]: With dead ends: 2570 [2025-04-13 21:41:52,817 INFO L226 Difference]: Without dead ends: 1554 [2025-04-13 21:41:52,819 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:41:52,820 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 87 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:52,820 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 44 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:41:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-04-13 21:41:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1186. [2025-04-13 21:41:52,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 1185 states have (on average 3.4008438818565403) internal successors, (4030), 1185 states have internal predecessors, (4030), 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) [2025-04-13 21:41:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 4030 transitions. [2025-04-13 21:41:52,871 INFO L79 Accepts]: Start accepts. Automaton has 1186 states and 4030 transitions. Word has length 35 [2025-04-13 21:41:52,871 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:52,871 INFO L485 AbstractCegarLoop]: Abstraction has 1186 states and 4030 transitions. [2025-04-13 21:41:52,871 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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) [2025-04-13 21:41:52,871 INFO L278 IsEmpty]: Start isEmpty. Operand 1186 states and 4030 transitions. [2025-04-13 21:41:52,874 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 21:41:52,874 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:52,874 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-04-13 21:41:52,874 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 21:41:52,874 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:41:52,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:52,875 INFO L85 PathProgramCache]: Analyzing trace with hash 881576556, now seen corresponding path program 6 times [2025-04-13 21:41:52,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:52,875 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144961689] [2025-04-13 21:41:52,875 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:41:52,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:52,884 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 1 equivalence classes. [2025-04-13 21:41:52,919 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 21:41:52,919 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:41:52,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:41:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:41:53,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:41:53,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144961689] [2025-04-13 21:41:53,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144961689] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:41:53,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:41:53,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:41:53,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519782612] [2025-04-13 21:41:53,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:41:53,557 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 21:41:53,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:41:53,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 21:41:53,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:41:53,558 INFO L87 Difference]: Start difference. First operand 1186 states and 4030 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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) [2025-04-13 21:41:53,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:41:53,853 INFO L93 Difference]: Finished difference Result 1874 states and 6302 transitions. [2025-04-13 21:41:53,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:41:53,853 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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) Word has length 35 [2025-04-13 21:41:53,853 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:41:53,883 INFO L225 Difference]: With dead ends: 1874 [2025-04-13 21:41:53,883 INFO L226 Difference]: Without dead ends: 1182 [2025-04-13 21:41:53,885 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:41:53,886 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 68 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:41:53,886 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 53 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:41:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2025-04-13 21:41:53,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 862. [2025-04-13 21:41:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 861 states have (on average 3.238095238095238) internal successors, (2788), 861 states have internal predecessors, (2788), 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) [2025-04-13 21:41:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 2788 transitions. [2025-04-13 21:41:53,930 INFO L79 Accepts]: Start accepts. Automaton has 862 states and 2788 transitions. Word has length 35 [2025-04-13 21:41:53,930 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:41:53,930 INFO L485 AbstractCegarLoop]: Abstraction has 862 states and 2788 transitions. [2025-04-13 21:41:53,930 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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) [2025-04-13 21:41:53,930 INFO L278 IsEmpty]: Start isEmpty. Operand 862 states and 2788 transitions. [2025-04-13 21:41:53,932 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 21:41:53,932 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:41:53,932 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-04-13 21:41:53,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 21:41:53,932 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:41:53,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:41:53,933 INFO L85 PathProgramCache]: Analyzing trace with hash 158599942, now seen corresponding path program 7 times [2025-04-13 21:41:53,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:41:53,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021539424] [2025-04-13 21:41:53,933 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:41:53,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:41:53,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 21:41:53,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 21:41:53,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:41:53,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:41:53,975 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:41:53,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 21:41:54,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 21:41:54,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:41:54,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:41:54,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:41:54,041 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:41:54,041 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 21:41:54,044 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 21:41:54,044 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 21:41:54,044 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 21:41:54,044 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-13 21:41:54,044 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-13 21:41:54,044 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 21:41:54,045 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 21:41:54,047 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2025-04-13 21:41:54,158 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:41:54,158 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:41:54,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:41:54 BasicIcfg [2025-04-13 21:41:54,164 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:41:54,164 INFO L158 Benchmark]: Toolchain (without parser) took 13614.37ms. Allocated memory was 167.8MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 117.5MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2025-04-13 21:41:54,165 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:41:54,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.50ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 90.9MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 21:41:54,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.86ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 88.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:41:54,165 INFO L158 Benchmark]: Boogie Preprocessor took 57.42ms. Allocated memory is still 167.8MB. Free memory was 88.3MB in the beginning and 85.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:41:54,165 INFO L158 Benchmark]: IcfgBuilder took 632.76ms. Allocated memory is still 167.8MB. Free memory was 85.8MB in the beginning and 99.7MB in the end (delta: -13.9MB). Peak memory consumption was 66.7MB. Max. memory is 8.0GB. [2025-04-13 21:41:54,165 INFO L158 Benchmark]: TraceAbstraction took 12410.32ms. Allocated memory was 167.8MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 98.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2025-04-13 21:41:54,166 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.14ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 454.50ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 90.9MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.86ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 88.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.42ms. Allocated memory is still 167.8MB. Free memory was 88.3MB in the beginning and 85.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 632.76ms. Allocated memory is still 167.8MB. Free memory was 85.8MB in the beginning and 99.7MB in the end (delta: -13.9MB). Peak memory consumption was 66.7MB. Max. memory is 8.0GB. * TraceAbstraction took 12410.32ms. Allocated memory was 167.8MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 98.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L729] 0 _Bool y$flush_delayed; [L730] 0 int y$mem_tmp; [L731] 0 _Bool y$r_buff0_thd0; [L732] 0 _Bool y$r_buff0_thd1; [L733] 0 _Bool y$r_buff0_thd2; [L734] 0 _Bool y$r_buff0_thd3; [L735] 0 _Bool y$r_buff0_thd4; [L736] 0 _Bool y$r_buff1_thd0; [L737] 0 _Bool y$r_buff1_thd1; [L738] 0 _Bool y$r_buff1_thd2; [L739] 0 _Bool y$r_buff1_thd3; [L740] 0 _Bool y$r_buff1_thd4; [L741] 0 _Bool y$read_delayed; [L742] 0 int *y$read_delayed_var; [L743] 0 int y$w_buff0; [L744] 0 _Bool y$w_buff0_used; [L745] 0 int y$w_buff1; [L746] 0 _Bool y$w_buff1_used; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t437; [L859] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t437=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t438; [L861] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t437=-1, t438=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t439; [L863] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437=-1, t438=0, t439=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L801] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L801] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t440; [L865] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437=-1, t438=0, t439=1, t440=2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 4 z = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L754] 1 a = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L757] 1 __unbuffered_p0_EAX = x VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L769] 2 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t437=-1, t438=0, t439=1, t440=2, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t437=-1, t438=0, t439=1, t440=2, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t437=-1, t438=0, t439=1, t440=2, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 80 locations, 75 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.2s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1025 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1025 mSDsluCounter, 273 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 202 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2128 IncrementalHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 71 mSDtfsCounter, 2128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24026occurred in iteration=0, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 1296 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 293 ConstructedInterpolants, 0 QuantifiedInterpolants, 1853 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 21:41:54,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...