/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/mix040_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:44:29,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:44:29,449 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:44:29,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:44:29,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:44:29,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:44:29,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:44:29,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:44:29,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:44:29,469 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:44:29,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:44:29,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:44:29,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:44:29,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:44:29,470 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:44:29,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:44:29,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:44:29,470 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:44:29,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:44:29,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:44:29,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:44:29,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:44:29,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:44:29,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:44:29,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:44:29,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:44:29,470 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:44:29,470 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:44:29,470 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:44:29,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:44:29,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:44:29,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:44:29,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:44:29,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:44:29,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:44:29,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:44:29,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:44:29,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:44:29,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:44:29,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:44:29,471 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:44:29,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:44:29,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:44:29,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:44:29,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:44:29,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:44:29,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:44:29,472 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:44:29,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:44:29,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:44:29,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:44:29,684 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:44:29,684 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:44:29,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2025-04-13 21:44:30,987 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec94bceb/3ac97648ace94370b78de82dc6958b77/FLAG369e978a2 [2025-04-13 21:44:31,212 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:44:31,212 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2025-04-13 21:44:31,220 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec94bceb/3ac97648ace94370b78de82dc6958b77/FLAG369e978a2 [2025-04-13 21:44:31,988 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec94bceb/3ac97648ace94370b78de82dc6958b77 [2025-04-13 21:44:31,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:44:31,991 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:44:31,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:44:31,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:44:31,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:44:31,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:44:31" (1/1) ... [2025-04-13 21:44:31,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e1559b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:44:31, skipping insertion in model container [2025-04-13 21:44:31,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:44:31" (1/1) ... [2025-04-13 21:44:32,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:44:32,183 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/mix040_tso.oepc.i[949,962] [2025-04-13 21:44:32,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:44:32,381 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:44:32,396 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/mix040_tso.oepc.i[949,962] [2025-04-13 21:44:32,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:44:32,472 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:44:32,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:44:32 WrapperNode [2025-04-13 21:44:32,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:44:32,473 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:44:32,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:44:32,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:44:32,478 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:44:32" (1/1) ... [2025-04-13 21:44:32,490 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:44:32" (1/1) ... [2025-04-13 21:44:32,510 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2025-04-13 21:44:32,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:44:32,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:44:32,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:44:32,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:44:32,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:44:32" (1/1) ... [2025-04-13 21:44:32,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:44:32" (1/1) ... [2025-04-13 21:44:32,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:44:32" (1/1) ... [2025-04-13 21:44:32,538 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:44:32,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:44:32" (1/1) ... [2025-04-13 21:44:32,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:44:32" (1/1) ... [2025-04-13 21:44:32,545 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:44:32" (1/1) ... [2025-04-13 21:44:32,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:44:32" (1/1) ... [2025-04-13 21:44:32,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:44:32" (1/1) ... [2025-04-13 21:44:32,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:44:32" (1/1) ... [2025-04-13 21:44:32,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:44:32,556 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:44:32,556 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:44:32,556 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:44:32,558 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:44:32" (1/1) ... [2025-04-13 21:44:32,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:44:32,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:44:32,585 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:44:32,586 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:44:32,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:44:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:44:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 21:44:32,603 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 21:44:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 21:44:32,603 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 21:44:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 21:44:32,603 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 21:44:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-04-13 21:44:32,603 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-04-13 21:44:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:44:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:44:32,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:44:32,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:44:32,604 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:44:32,703 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:44:32,704 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:44:32,945 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:44:32,946 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:44:32,946 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:44:33,160 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:44:33,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:44:33 BoogieIcfgContainer [2025-04-13 21:44:33,160 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:44:33,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:44:33,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:44:33,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:44:33,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:44:31" (1/3) ... [2025-04-13 21:44:33,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197b0a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:44:33, skipping insertion in model container [2025-04-13 21:44:33,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:44:32" (2/3) ... [2025-04-13 21:44:33,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197b0a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:44:33, skipping insertion in model container [2025-04-13 21:44:33,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:44:33" (3/3) ... [2025-04-13 21:44:33,168 INFO L128 eAbstractionObserver]: Analyzing ICFG mix040_tso.oepc.i [2025-04-13 21:44:33,179 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:44:33,180 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix040_tso.oepc.i that has 5 procedures, 47 locations, 42 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-13 21:44:33,180 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:44:33,223 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:44:33,244 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 46 transitions, 108 flow [2025-04-13 21:44:34,119 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 26917 states, 26914 states have (on average 4.303410864234228) internal successors, (115822), 26916 states have internal predecessors, (115822), 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:44:34,139 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:44:34,150 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;@689de41b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:44:34,150 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 21:44:34,227 INFO L278 IsEmpty]: Start isEmpty. Operand has 26917 states, 26914 states have (on average 4.303410864234228) internal successors, (115822), 26916 states have internal predecessors, (115822), 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:44:34,232 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 21:44:34,232 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:34,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:44:34,233 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:44:34,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:34,237 INFO L85 PathProgramCache]: Analyzing trace with hash -162651851, now seen corresponding path program 1 times [2025-04-13 21:44:34,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:34,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218095414] [2025-04-13 21:44:34,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:44:34,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:34,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:44:34,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:44:34,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:44:34,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:44:34,625 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:44:34,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:44:34,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218095414] [2025-04-13 21:44:34,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218095414] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:44:34,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:44:34,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:44:34,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542712722] [2025-04-13 21:44:34,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:44:34,629 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:44:34,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:44:34,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:44:34,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:44:34,703 INFO L87 Difference]: Start difference. First operand has 26917 states, 26914 states have (on average 4.303410864234228) internal successors, (115822), 26916 states have internal predecessors, (115822), 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:44:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:44:35,241 INFO L93 Difference]: Finished difference Result 26917 states and 115822 transitions. [2025-04-13 21:44:35,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:44:35,242 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:44:35,243 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:44:35,588 INFO L225 Difference]: With dead ends: 26917 [2025-04-13 21:44:35,589 INFO L226 Difference]: Without dead ends: 22409 [2025-04-13 21:44:35,606 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:44:35,608 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:44:35,609 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:44:35,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22409 states. [2025-04-13 21:44:36,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22409 to 22409. [2025-04-13 21:44:36,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22409 states, 22408 states have (on average 4.285969296679757) internal successors, (96040), 22408 states have internal predecessors, (96040), 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:44:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22409 states to 22409 states and 96040 transitions. [2025-04-13 21:44:36,588 INFO L79 Accepts]: Start accepts. Automaton has 22409 states and 96040 transitions. Word has length 8 [2025-04-13 21:44:36,589 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:44:36,590 INFO L485 AbstractCegarLoop]: Abstraction has 22409 states and 96040 transitions. [2025-04-13 21:44:36,590 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:44:36,591 INFO L278 IsEmpty]: Start isEmpty. Operand 22409 states and 96040 transitions. [2025-04-13 21:44:36,600 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 21:44:36,600 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:36,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:44:36,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:44:36,600 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:44:36,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:36,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1692141039, now seen corresponding path program 1 times [2025-04-13 21:44:36,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:36,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496990151] [2025-04-13 21:44:36,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:44:36,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:36,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:44:36,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:44:36,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:44:36,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:44:37,118 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:44:37,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:44:37,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496990151] [2025-04-13 21:44:37,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496990151] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:44:37,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:44:37,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:44:37,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298062692] [2025-04-13 21:44:37,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:44:37,119 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:44:37,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:44:37,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:44:37,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:44:37,120 INFO L87 Difference]: Start difference. First operand 22409 states and 96040 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) 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:44:37,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:44:37,567 INFO L93 Difference]: Finished difference Result 25839 states and 109319 transitions. [2025-04-13 21:44:37,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:44:37,567 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) 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:44:37,567 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:44:37,662 INFO L225 Difference]: With dead ends: 25839 [2025-04-13 21:44:37,662 INFO L226 Difference]: Without dead ends: 19665 [2025-04-13 21:44:37,683 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:44:37,684 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 66 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:44:37,684 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 18 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:44:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19665 states. [2025-04-13 21:44:38,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19665 to 19665. [2025-04-13 21:44:38,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19665 states, 19664 states have (on average 4.24613506916192) internal successors, (83496), 19664 states have internal predecessors, (83496), 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:44:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19665 states to 19665 states and 83496 transitions. [2025-04-13 21:44:38,264 INFO L79 Accepts]: Start accepts. Automaton has 19665 states and 83496 transitions. Word has length 14 [2025-04-13 21:44:38,264 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:44:38,264 INFO L485 AbstractCegarLoop]: Abstraction has 19665 states and 83496 transitions. [2025-04-13 21:44:38,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) 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:44:38,265 INFO L278 IsEmpty]: Start isEmpty. Operand 19665 states and 83496 transitions. [2025-04-13 21:44:38,276 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 21:44:38,277 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:38,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:44:38,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:44:38,277 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:44:38,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:38,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1479822287, now seen corresponding path program 1 times [2025-04-13 21:44:38,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:38,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663063325] [2025-04-13 21:44:38,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:44:38,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:38,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:44:38,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:44:38,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:44:38,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:44:38,586 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:44:38,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:44:38,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663063325] [2025-04-13 21:44:38,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663063325] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:44:38,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:44:38,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:44:38,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572922340] [2025-04-13 21:44:38,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:44:38,589 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:44:38,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:44:38,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:44:38,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:44:38,589 INFO L87 Difference]: Start difference. First operand 19665 states and 83496 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:44:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:44:38,887 INFO L93 Difference]: Finished difference Result 22675 states and 95029 transitions. [2025-04-13 21:44:38,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:44:38,888 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2025-04-13 21:44:38,888 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:44:38,990 INFO L225 Difference]: With dead ends: 22675 [2025-04-13 21:44:38,991 INFO L226 Difference]: Without dead ends: 19245 [2025-04-13 21:44:39,004 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:44:39,005 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 51 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:44:39,005 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 18 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:44:39,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19245 states. [2025-04-13 21:44:39,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19245 to 19245. [2025-04-13 21:44:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19245 states, 19244 states have (on average 4.23716483059655) internal successors, (81540), 19244 states have internal predecessors, (81540), 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:44:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19245 states to 19245 states and 81540 transitions. [2025-04-13 21:44:39,866 INFO L79 Accepts]: Start accepts. Automaton has 19245 states and 81540 transitions. Word has length 18 [2025-04-13 21:44:39,867 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:44:39,867 INFO L485 AbstractCegarLoop]: Abstraction has 19245 states and 81540 transitions. [2025-04-13 21:44:39,867 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:44:39,867 INFO L278 IsEmpty]: Start isEmpty. Operand 19245 states and 81540 transitions. [2025-04-13 21:44:39,884 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 21:44:39,884 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:39,884 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] [2025-04-13 21:44:39,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:44:39,885 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:44:39,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:39,885 INFO L85 PathProgramCache]: Analyzing trace with hash 441734416, now seen corresponding path program 1 times [2025-04-13 21:44:39,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:39,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433934135] [2025-04-13 21:44:39,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:44:39,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:39,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 21:44:39,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:44:39,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:44:39,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:44:40,466 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:44:40,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:44:40,467 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433934135] [2025-04-13 21:44:40,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433934135] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:44:40,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:44:40,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:44:40,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050797937] [2025-04-13 21:44:40,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:44:40,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:44:40,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:44:40,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:44:40,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:44:40,468 INFO L87 Difference]: Start difference. First operand 19245 states and 81540 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:44:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:44:40,884 INFO L93 Difference]: Finished difference Result 22135 states and 92557 transitions. [2025-04-13 21:44:40,884 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:44:40,884 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2025-04-13 21:44:40,884 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:44:40,964 INFO L225 Difference]: With dead ends: 22135 [2025-04-13 21:44:40,964 INFO L226 Difference]: Without dead ends: 19125 [2025-04-13 21:44:40,976 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:44:40,977 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 49 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:44:40,977 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 29 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:44:41,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19125 states. [2025-04-13 21:44:41,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19125 to 19125. [2025-04-13 21:44:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19125 states, 19124 states have (on average 4.233633131144112) internal successors, (80964), 19124 states have internal predecessors, (80964), 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:44:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19125 states to 19125 states and 80964 transitions. [2025-04-13 21:44:41,555 INFO L79 Accepts]: Start accepts. Automaton has 19125 states and 80964 transitions. Word has length 20 [2025-04-13 21:44:41,555 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:44:41,555 INFO L485 AbstractCegarLoop]: Abstraction has 19125 states and 80964 transitions. [2025-04-13 21:44:41,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:44:41,555 INFO L278 IsEmpty]: Start isEmpty. Operand 19125 states and 80964 transitions. [2025-04-13 21:44:41,572 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 21:44:41,572 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:41,572 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] [2025-04-13 21:44:41,572 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:44:41,572 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:44:41,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:41,573 INFO L85 PathProgramCache]: Analyzing trace with hash 275880454, now seen corresponding path program 1 times [2025-04-13 21:44:41,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:41,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618510766] [2025-04-13 21:44:41,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:44:41,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:41,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 21:44:41,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:44:41,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:44:41,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:44:42,076 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:44:42,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:44:42,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618510766] [2025-04-13 21:44:42,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618510766] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:44:42,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:44:42,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:44:42,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322184735] [2025-04-13 21:44:42,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:44:42,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:44:42,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:44:42,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:44:42,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:44:42,077 INFO L87 Difference]: Start difference. First operand 19125 states and 80964 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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:44:42,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:44:42,470 INFO L93 Difference]: Finished difference Result 21365 states and 89576 transitions. [2025-04-13 21:44:42,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:44:42,470 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2025-04-13 21:44:42,470 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:44:42,546 INFO L225 Difference]: With dead ends: 21365 [2025-04-13 21:44:42,547 INFO L226 Difference]: Without dead ends: 19363 [2025-04-13 21:44:42,557 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:44:42,558 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 80 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:44:42,558 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 32 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:44:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19363 states. [2025-04-13 21:44:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19363 to 19279. [2025-04-13 21:44:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19279 states, 19278 states have (on average 4.232804232804233) internal successors, (81600), 19278 states have internal predecessors, (81600), 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:44:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19279 states to 19279 states and 81600 transitions. [2025-04-13 21:44:43,215 INFO L79 Accepts]: Start accepts. Automaton has 19279 states and 81600 transitions. Word has length 21 [2025-04-13 21:44:43,215 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:44:43,215 INFO L485 AbstractCegarLoop]: Abstraction has 19279 states and 81600 transitions. [2025-04-13 21:44:43,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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:44:43,215 INFO L278 IsEmpty]: Start isEmpty. Operand 19279 states and 81600 transitions. [2025-04-13 21:44:43,237 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 21:44:43,237 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:43,237 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] [2025-04-13 21:44:43,237 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:44:43,239 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:44:43,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:43,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1276241425, now seen corresponding path program 1 times [2025-04-13 21:44:43,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:43,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481279491] [2025-04-13 21:44:43,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:44:43,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:43,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 21:44:43,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:44:43,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:44:43,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:44:44,097 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:44:44,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:44:44,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481279491] [2025-04-13 21:44:44,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481279491] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:44:44,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:44:44,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:44:44,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104207885] [2025-04-13 21:44:44,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:44:44,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:44:44,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:44:44,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:44:44,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:44:44,098 INFO L87 Difference]: Start difference. First operand 19279 states and 81600 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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:44:44,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:44:44,540 INFO L93 Difference]: Finished difference Result 21673 states and 90771 transitions. [2025-04-13 21:44:44,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:44:44,540 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2025-04-13 21:44:44,541 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:44:44,627 INFO L225 Difference]: With dead ends: 21673 [2025-04-13 21:44:44,627 INFO L226 Difference]: Without dead ends: 20077 [2025-04-13 21:44:44,638 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:44:44,638 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 95 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:44:44,639 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 34 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:44:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20077 states. [2025-04-13 21:44:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20077 to 19741. [2025-04-13 21:44:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19741 states, 19740 states have (on average 4.222593718338399) internal successors, (83354), 19740 states have internal predecessors, (83354), 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:44:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19741 states to 19741 states and 83354 transitions. [2025-04-13 21:44:45,214 INFO L79 Accepts]: Start accepts. Automaton has 19741 states and 83354 transitions. Word has length 22 [2025-04-13 21:44:45,214 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:44:45,214 INFO L485 AbstractCegarLoop]: Abstraction has 19741 states and 83354 transitions. [2025-04-13 21:44:45,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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:44:45,215 INFO L278 IsEmpty]: Start isEmpty. Operand 19741 states and 83354 transitions. [2025-04-13 21:44:45,232 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 21:44:45,233 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:45,233 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] [2025-04-13 21:44:45,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:44:45,233 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:44:45,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:45,233 INFO L85 PathProgramCache]: Analyzing trace with hash -120143038, now seen corresponding path program 1 times [2025-04-13 21:44:45,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:45,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156089313] [2025-04-13 21:44:45,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:44:45,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:45,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 21:44:45,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:44:45,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:44:45,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:44:45,322 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:44:45,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:44:45,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156089313] [2025-04-13 21:44:45,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156089313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:44:45,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:44:45,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:44:45,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781243635] [2025-04-13 21:44:45,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:44:45,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:44:45,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:44:45,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:44:45,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:44:45,325 INFO L87 Difference]: Start difference. First operand 19741 states and 83354 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:44:45,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:44:45,690 INFO L93 Difference]: Finished difference Result 29069 states and 120370 transitions. [2025-04-13 21:44:45,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:44:45,691 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2025-04-13 21:44:45,691 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:44:45,768 INFO L225 Difference]: With dead ends: 29069 [2025-04-13 21:44:45,768 INFO L226 Difference]: Without dead ends: 16638 [2025-04-13 21:44:45,792 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:44:45,794 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 73 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:44:45,794 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 12 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:44:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16638 states. [2025-04-13 21:44:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16638 to 16638. [2025-04-13 21:44:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16638 states, 16637 states have (on average 4.077598124661898) internal successors, (67839), 16637 states have internal predecessors, (67839), 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:44:46,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16638 states to 16638 states and 67839 transitions. [2025-04-13 21:44:46,309 INFO L79 Accepts]: Start accepts. Automaton has 16638 states and 67839 transitions. Word has length 22 [2025-04-13 21:44:46,310 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:44:46,310 INFO L485 AbstractCegarLoop]: Abstraction has 16638 states and 67839 transitions. [2025-04-13 21:44:46,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:44:46,310 INFO L278 IsEmpty]: Start isEmpty. Operand 16638 states and 67839 transitions. [2025-04-13 21:44:46,328 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 21:44:46,329 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:46,329 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] [2025-04-13 21:44:46,329 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 21:44:46,329 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:44:46,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:46,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1468273866, now seen corresponding path program 1 times [2025-04-13 21:44:46,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:46,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132271816] [2025-04-13 21:44:46,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:44:46,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:46,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 21:44:46,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 21:44:46,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:44:46,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:44:46,930 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:44:46,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:44:46,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132271816] [2025-04-13 21:44:46,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132271816] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:44:46,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:44:46,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:44:46,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042042896] [2025-04-13 21:44:46,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:44:46,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:44:46,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:44:46,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:44:46,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:44:46,931 INFO L87 Difference]: Start difference. First operand 16638 states and 67839 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:44:47,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:44:47,210 INFO L93 Difference]: Finished difference Result 17894 states and 72267 transitions. [2025-04-13 21:44:47,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:44:47,211 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2025-04-13 21:44:47,211 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:44:47,286 INFO L225 Difference]: With dead ends: 17894 [2025-04-13 21:44:47,287 INFO L226 Difference]: Without dead ends: 16494 [2025-04-13 21:44:47,298 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:44:47,299 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 60 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:44:47,299 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 31 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:44:47,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16494 states. [2025-04-13 21:44:47,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16494 to 16494. [2025-04-13 21:44:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16494 states, 16493 states have (on average 4.075365306493664) internal successors, (67215), 16493 states have internal predecessors, (67215), 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:44:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16494 states to 16494 states and 67215 transitions. [2025-04-13 21:44:47,820 INFO L79 Accepts]: Start accepts. Automaton has 16494 states and 67215 transitions. Word has length 23 [2025-04-13 21:44:47,820 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:44:47,820 INFO L485 AbstractCegarLoop]: Abstraction has 16494 states and 67215 transitions. [2025-04-13 21:44:47,820 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:44:47,820 INFO L278 IsEmpty]: Start isEmpty. Operand 16494 states and 67215 transitions. [2025-04-13 21:44:47,838 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 21:44:47,838 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:47,838 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:44:47,838 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:44:47,838 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:44:47,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:47,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1083701888, now seen corresponding path program 1 times [2025-04-13 21:44:47,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:47,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811959372] [2025-04-13 21:44:47,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:44:47,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:47,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 21:44:47,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 21:44:47,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:44:47,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:44:48,349 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:44:48,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:44:48,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811959372] [2025-04-13 21:44:48,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811959372] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:44:48,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:44:48,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:44:48,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978759453] [2025-04-13 21:44:48,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:44:48,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:44:48,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:44:48,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:44:48,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:44:48,351 INFO L87 Difference]: Start difference. First operand 16494 states and 67215 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 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:44:48,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:44:48,746 INFO L93 Difference]: Finished difference Result 17326 states and 70087 transitions. [2025-04-13 21:44:48,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:44:48,747 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 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:44:48,747 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:44:48,815 INFO L225 Difference]: With dead ends: 17326 [2025-04-13 21:44:48,815 INFO L226 Difference]: Without dead ends: 16430 [2025-04-13 21:44:48,822 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:44:48,823 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 119 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:44:48,823 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 35 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:44:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16430 states. [2025-04-13 21:44:49,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16430 to 16430. [2025-04-13 21:44:49,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16430 states, 16429 states have (on average 4.07419806439832) internal successors, (66935), 16429 states have internal predecessors, (66935), 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:44:49,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16430 states to 16430 states and 66935 transitions. [2025-04-13 21:44:49,151 INFO L79 Accepts]: Start accepts. Automaton has 16430 states and 66935 transitions. Word has length 24 [2025-04-13 21:44:49,151 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:44:49,151 INFO L485 AbstractCegarLoop]: Abstraction has 16430 states and 66935 transitions. [2025-04-13 21:44:49,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 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:44:49,152 INFO L278 IsEmpty]: Start isEmpty. Operand 16430 states and 66935 transitions. [2025-04-13 21:44:49,174 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:44:49,175 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:49,175 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] [2025-04-13 21:44:49,175 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 21:44:49,175 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:44:49,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:49,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1294976869, now seen corresponding path program 1 times [2025-04-13 21:44:49,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:49,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108694183] [2025-04-13 21:44:49,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:44:49,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:49,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 21:44:49,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:44:49,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:44:49,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:44:49,841 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:44:49,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:44:49,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108694183] [2025-04-13 21:44:49,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108694183] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:44:49,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:44:49,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:44:49,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173229511] [2025-04-13 21:44:49,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:44:49,842 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 21:44:49,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:44:49,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 21:44:49,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:44:49,842 INFO L87 Difference]: Start difference. First operand 16430 states and 66935 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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:44:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:44:50,422 INFO L93 Difference]: Finished difference Result 20618 states and 83645 transitions. [2025-04-13 21:44:50,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:44:50,423 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 25 [2025-04-13 21:44:50,423 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:44:50,506 INFO L225 Difference]: With dead ends: 20618 [2025-04-13 21:44:50,506 INFO L226 Difference]: Without dead ends: 18618 [2025-04-13 21:44:50,518 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:44:50,519 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 144 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:44:50,519 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 46 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:44:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18618 states. [2025-04-13 21:44:50,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18618 to 17838. [2025-04-13 21:44:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17838 states, 17837 states have (on average 4.081908392666929) internal successors, (72809), 17837 states have internal predecessors, (72809), 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:44:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17838 states to 17838 states and 72809 transitions. [2025-04-13 21:44:50,876 INFO L79 Accepts]: Start accepts. Automaton has 17838 states and 72809 transitions. Word has length 25 [2025-04-13 21:44:50,876 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:44:50,876 INFO L485 AbstractCegarLoop]: Abstraction has 17838 states and 72809 transitions. [2025-04-13 21:44:50,876 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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:44:50,876 INFO L278 IsEmpty]: Start isEmpty. Operand 17838 states and 72809 transitions. [2025-04-13 21:44:50,898 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:44:50,899 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:50,899 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] [2025-04-13 21:44:50,899 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 21:44:50,899 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:44:50,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:50,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1569709871, now seen corresponding path program 2 times [2025-04-13 21:44:50,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:50,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110523159] [2025-04-13 21:44:50,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:44:50,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:50,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-04-13 21:44:50,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:44:50,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:44:50,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:44:51,551 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:44:51,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:44:51,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110523159] [2025-04-13 21:44:51,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110523159] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:44:51,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:44:51,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:44:51,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440800607] [2025-04-13 21:44:51,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:44:51,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 21:44:51,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:44:51,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 21:44:51,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:44:51,552 INFO L87 Difference]: Start difference. First operand 17838 states and 72809 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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:44:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:44:51,953 INFO L93 Difference]: Finished difference Result 19510 states and 79183 transitions. [2025-04-13 21:44:51,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:44:51,953 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 25 [2025-04-13 21:44:51,953 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:44:52,025 INFO L225 Difference]: With dead ends: 19510 [2025-04-13 21:44:52,025 INFO L226 Difference]: Without dead ends: 18514 [2025-04-13 21:44:52,033 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:44:52,033 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 136 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:44:52,034 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 41 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:44:52,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18514 states. [2025-04-13 21:44:52,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18514 to 16546. [2025-04-13 21:44:52,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16546 states, 16545 states have (on average 4.074040495618012) internal successors, (67405), 16545 states have internal predecessors, (67405), 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:44:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16546 states to 16546 states and 67405 transitions. [2025-04-13 21:44:52,381 INFO L79 Accepts]: Start accepts. Automaton has 16546 states and 67405 transitions. Word has length 25 [2025-04-13 21:44:52,381 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:44:52,381 INFO L485 AbstractCegarLoop]: Abstraction has 16546 states and 67405 transitions. [2025-04-13 21:44:52,381 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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:44:52,381 INFO L278 IsEmpty]: Start isEmpty. Operand 16546 states and 67405 transitions. [2025-04-13 21:44:52,400 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:44:52,400 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:52,400 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] [2025-04-13 21:44:52,400 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 21:44:52,400 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:44:52,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:52,400 INFO L85 PathProgramCache]: Analyzing trace with hash 886694712, now seen corresponding path program 1 times [2025-04-13 21:44:52,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:52,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408536662] [2025-04-13 21:44:52,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:44:52,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:52,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 21:44:52,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:44:52,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:44:52,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:44:53,103 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:44:53,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:44:53,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408536662] [2025-04-13 21:44:53,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408536662] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:44:53,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:44:53,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:44:53,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119039653] [2025-04-13 21:44:53,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:44:53,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:44:53,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:44:53,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:44:53,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:44:53,105 INFO L87 Difference]: Start difference. First operand 16546 states and 67405 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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:44:53,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:44:53,697 INFO L93 Difference]: Finished difference Result 25810 states and 103675 transitions. [2025-04-13 21:44:53,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:44:53,698 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2025-04-13 21:44:53,698 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:44:53,801 INFO L225 Difference]: With dead ends: 25810 [2025-04-13 21:44:53,802 INFO L226 Difference]: Without dead ends: 23958 [2025-04-13 21:44:53,814 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:44:53,815 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 123 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:44:53,815 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 37 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 21:44:53,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23958 states. [2025-04-13 21:44:54,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23958 to 16722. [2025-04-13 21:44:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16722 states, 16721 states have (on average 4.051372525566653) internal successors, (67743), 16721 states have internal predecessors, (67743), 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:44:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16722 states to 16722 states and 67743 transitions. [2025-04-13 21:44:54,213 INFO L79 Accepts]: Start accepts. Automaton has 16722 states and 67743 transitions. Word has length 25 [2025-04-13 21:44:54,213 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:44:54,213 INFO L485 AbstractCegarLoop]: Abstraction has 16722 states and 67743 transitions. [2025-04-13 21:44:54,214 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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:44:54,214 INFO L278 IsEmpty]: Start isEmpty. Operand 16722 states and 67743 transitions. [2025-04-13 21:44:54,233 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:44:54,234 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:54,234 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] [2025-04-13 21:44:54,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 21:44:54,234 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:44:54,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:54,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1921088626, now seen corresponding path program 1 times [2025-04-13 21:44:54,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:54,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815088606] [2025-04-13 21:44:54,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:44:54,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:54,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 21:44:54,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:44:54,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:44:54,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:44:54,493 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:44:54,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:44:54,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815088606] [2025-04-13 21:44:54,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815088606] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:44:54,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:44:54,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:44:54,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22737623] [2025-04-13 21:44:54,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:44:54,494 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:44:54,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:44:54,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:44:54,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:44:54,494 INFO L87 Difference]: Start difference. First operand 16722 states and 67743 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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:44:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:44:54,969 INFO L93 Difference]: Finished difference Result 33324 states and 133864 transitions. [2025-04-13 21:44:54,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:44:54,969 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2025-04-13 21:44:54,969 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:44:55,070 INFO L225 Difference]: With dead ends: 33324 [2025-04-13 21:44:55,070 INFO L226 Difference]: Without dead ends: 21806 [2025-04-13 21:44:55,096 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:44:55,097 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 117 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:44:55,097 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 38 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:44:55,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21806 states. [2025-04-13 21:44:55,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21806 to 14082. [2025-04-13 21:44:55,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14082 states, 14081 states have (on average 3.923513954974789) internal successors, (55247), 14081 states have internal predecessors, (55247), 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:44:55,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14082 states to 14082 states and 55247 transitions. [2025-04-13 21:44:55,455 INFO L79 Accepts]: Start accepts. Automaton has 14082 states and 55247 transitions. Word has length 25 [2025-04-13 21:44:55,455 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:44:55,455 INFO L485 AbstractCegarLoop]: Abstraction has 14082 states and 55247 transitions. [2025-04-13 21:44:55,455 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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:44:55,455 INFO L278 IsEmpty]: Start isEmpty. Operand 14082 states and 55247 transitions. [2025-04-13 21:44:55,470 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:44:55,470 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:55,470 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] [2025-04-13 21:44:55,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 21:44:55,471 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:44:55,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:55,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1068935086, now seen corresponding path program 2 times [2025-04-13 21:44:55,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:55,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777751175] [2025-04-13 21:44:55,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:44:55,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:55,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-04-13 21:44:55,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:44:55,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:44:55,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:44:55,634 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:44:55,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:44:55,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777751175] [2025-04-13 21:44:55,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777751175] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:44:55,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:44:55,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:44:55,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814419587] [2025-04-13 21:44:55,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:44:55,634 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:44:55,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:44:55,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:44:55,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:44:55,635 INFO L87 Difference]: Start difference. First operand 14082 states and 55247 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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:44:55,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:44:55,843 INFO L93 Difference]: Finished difference Result 17538 states and 67411 transitions. [2025-04-13 21:44:55,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:44:55,844 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2025-04-13 21:44:55,844 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:44:55,893 INFO L225 Difference]: With dead ends: 17538 [2025-04-13 21:44:55,893 INFO L226 Difference]: Without dead ends: 9842 [2025-04-13 21:44:55,909 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:44:55,910 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 140 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:44:55,910 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 16 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:44:55,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9842 states. [2025-04-13 21:44:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9842 to 9842. [2025-04-13 21:44:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9842 states, 9841 states have (on average 3.7600853571791486) internal successors, (37003), 9841 states have internal predecessors, (37003), 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:44:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9842 states to 9842 states and 37003 transitions. [2025-04-13 21:44:56,095 INFO L79 Accepts]: Start accepts. Automaton has 9842 states and 37003 transitions. Word has length 25 [2025-04-13 21:44:56,096 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:44:56,096 INFO L485 AbstractCegarLoop]: Abstraction has 9842 states and 37003 transitions. [2025-04-13 21:44:56,096 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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:44:56,096 INFO L278 IsEmpty]: Start isEmpty. Operand 9842 states and 37003 transitions. [2025-04-13 21:44:56,108 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 21:44:56,108 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:56,108 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] [2025-04-13 21:44:56,108 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 21:44:56,108 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:44:56,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:56,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1195323611, now seen corresponding path program 1 times [2025-04-13 21:44:56,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:56,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703673387] [2025-04-13 21:44:56,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:44:56,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:56,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 21:44:56,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 21:44:56,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:44:56,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:44:56,597 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:44:56,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:44:56,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703673387] [2025-04-13 21:44:56,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703673387] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:44:56,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:44:56,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:44:56,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645529905] [2025-04-13 21:44:56,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:44:56,598 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 21:44:56,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:44:56,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 21:44:56,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:44:56,598 INFO L87 Difference]: Start difference. First operand 9842 states and 37003 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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:44:57,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:44:57,004 INFO L93 Difference]: Finished difference Result 11786 states and 43875 transitions. [2025-04-13 21:44:57,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:44:57,004 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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 28 [2025-04-13 21:44:57,004 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:44:57,067 INFO L225 Difference]: With dead ends: 11786 [2025-04-13 21:44:57,067 INFO L226 Difference]: Without dead ends: 11128 [2025-04-13 21:44:57,071 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:44:57,071 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 153 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:44:57,072 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 48 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:44:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11128 states. [2025-04-13 21:44:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11128 to 11040. [2025-04-13 21:44:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11040 states, 11039 states have (on average 3.758854968747169) internal successors, (41494), 11039 states have internal predecessors, (41494), 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:44:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11040 states to 11040 states and 41494 transitions. [2025-04-13 21:44:57,273 INFO L79 Accepts]: Start accepts. Automaton has 11040 states and 41494 transitions. Word has length 28 [2025-04-13 21:44:57,273 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:44:57,273 INFO L485 AbstractCegarLoop]: Abstraction has 11040 states and 41494 transitions. [2025-04-13 21:44:57,274 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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:44:57,274 INFO L278 IsEmpty]: Start isEmpty. Operand 11040 states and 41494 transitions. [2025-04-13 21:44:57,287 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 21:44:57,287 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:57,288 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] [2025-04-13 21:44:57,288 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 21:44:57,288 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:44:57,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:57,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2094444069, now seen corresponding path program 1 times [2025-04-13 21:44:57,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:57,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615813490] [2025-04-13 21:44:57,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:44:57,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:57,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 21:44:57,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 21:44:57,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:44:57,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:44:57,390 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:44:57,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:44:57,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615813490] [2025-04-13 21:44:57,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615813490] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:44:57,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:44:57,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:44:57,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948861274] [2025-04-13 21:44:57,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:44:57,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:44:57,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:44:57,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:44:57,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:44:57,391 INFO L87 Difference]: Start difference. First operand 11040 states and 41494 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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:44:57,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:44:57,682 INFO L93 Difference]: Finished difference Result 11880 states and 44178 transitions. [2025-04-13 21:44:57,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:44:57,683 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2025-04-13 21:44:57,683 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:44:57,740 INFO L225 Difference]: With dead ends: 11880 [2025-04-13 21:44:57,741 INFO L226 Difference]: Without dead ends: 7716 [2025-04-13 21:44:57,749 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:44:57,749 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 183 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:44:57,750 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 18 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:44:57,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7716 states. [2025-04-13 21:44:57,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7716 to 7436. [2025-04-13 21:44:57,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7436 states, 7435 states have (on average 3.6995292535305984) internal successors, (27506), 7435 states have internal predecessors, (27506), 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:44:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7436 states to 7436 states and 27506 transitions. [2025-04-13 21:44:57,896 INFO L79 Accepts]: Start accepts. Automaton has 7436 states and 27506 transitions. Word has length 28 [2025-04-13 21:44:57,896 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:44:57,896 INFO L485 AbstractCegarLoop]: Abstraction has 7436 states and 27506 transitions. [2025-04-13 21:44:57,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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:44:57,896 INFO L278 IsEmpty]: Start isEmpty. Operand 7436 states and 27506 transitions. [2025-04-13 21:44:57,913 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 21:44:57,914 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:57,914 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] [2025-04-13 21:44:57,914 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 21:44:57,914 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:44:57,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:57,914 INFO L85 PathProgramCache]: Analyzing trace with hash 302221893, now seen corresponding path program 1 times [2025-04-13 21:44:57,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:57,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423626147] [2025-04-13 21:44:57,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:44:57,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:57,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 21:44:57,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 21:44:57,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:44:57,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:44:58,094 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:44:58,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:44:58,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423626147] [2025-04-13 21:44:58,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423626147] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:44:58,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:44:58,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:44:58,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256744853] [2025-04-13 21:44:58,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:44:58,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:44:58,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:44:58,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:44:58,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:44:58,096 INFO L87 Difference]: Start difference. First operand 7436 states and 27506 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 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:44:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:44:58,266 INFO L93 Difference]: Finished difference Result 7516 states and 27730 transitions. [2025-04-13 21:44:58,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:44:58,266 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 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 31 [2025-04-13 21:44:58,266 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:44:58,318 INFO L225 Difference]: With dead ends: 7516 [2025-04-13 21:44:58,318 INFO L226 Difference]: Without dead ends: 5542 [2025-04-13 21:44:58,325 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:44:58,325 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 231 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:44:58,325 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 15 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:44:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5542 states. [2025-04-13 21:44:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5542 to 4996. [2025-04-13 21:44:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4996 states, 4995 states have (on average 3.7561561561561563) internal successors, (18762), 4995 states have internal predecessors, (18762), 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:44:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4996 states to 4996 states and 18762 transitions. [2025-04-13 21:44:58,433 INFO L79 Accepts]: Start accepts. Automaton has 4996 states and 18762 transitions. Word has length 31 [2025-04-13 21:44:58,433 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:44:58,433 INFO L485 AbstractCegarLoop]: Abstraction has 4996 states and 18762 transitions. [2025-04-13 21:44:58,433 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 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:44:58,433 INFO L278 IsEmpty]: Start isEmpty. Operand 4996 states and 18762 transitions. [2025-04-13 21:44:58,442 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 21:44:58,442 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:58,442 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, 1] [2025-04-13 21:44:58,443 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 21:44:58,443 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:44:58,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:58,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1295294763, now seen corresponding path program 1 times [2025-04-13 21:44:58,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:58,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927285221] [2025-04-13 21:44:58,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:44:58,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:58,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 21:44:58,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 21:44:58,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:44:58,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:44:58,705 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:44:58,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:44:58,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927285221] [2025-04-13 21:44:58,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927285221] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:44:58,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:44:58,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:44:58,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900014319] [2025-04-13 21:44:58,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:44:58,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:44:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:44:58,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:44:58,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:44:58,706 INFO L87 Difference]: Start difference. First operand 4996 states and 18762 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 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:44:58,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:44:58,865 INFO L93 Difference]: Finished difference Result 7076 states and 26222 transitions. [2025-04-13 21:44:58,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:44:58,865 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 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 36 [2025-04-13 21:44:58,865 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:44:58,909 INFO L225 Difference]: With dead ends: 7076 [2025-04-13 21:44:58,909 INFO L226 Difference]: Without dead ends: 3496 [2025-04-13 21:44:58,914 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:44:58,914 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 45 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:44:58,914 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 22 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:44:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3496 states. [2025-04-13 21:44:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3496 to 3496. [2025-04-13 21:44:58,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3496 states, 3495 states have (on average 3.6257510729613736) internal successors, (12672), 3495 states have internal predecessors, (12672), 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:44:58,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 12672 transitions. [2025-04-13 21:44:58,988 INFO L79 Accepts]: Start accepts. Automaton has 3496 states and 12672 transitions. Word has length 36 [2025-04-13 21:44:58,988 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:44:58,988 INFO L485 AbstractCegarLoop]: Abstraction has 3496 states and 12672 transitions. [2025-04-13 21:44:58,988 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 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:44:58,988 INFO L278 IsEmpty]: Start isEmpty. Operand 3496 states and 12672 transitions. [2025-04-13 21:44:58,993 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 21:44:58,993 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:44:58,994 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, 1] [2025-04-13 21:44:58,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 21:44:58,994 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:44:58,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:44:58,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1531205273, now seen corresponding path program 2 times [2025-04-13 21:44:58,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:44:58,994 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249257094] [2025-04-13 21:44:58,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:44:58,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:44:59,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 1 equivalence classes. [2025-04-13 21:44:59,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 21:44:59,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:44:59,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:45:00,216 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:45:00,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:45:00,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249257094] [2025-04-13 21:45:00,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249257094] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:45:00,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:45:00,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 21:45:00,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207569917] [2025-04-13 21:45:00,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:45:00,217 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:45:00,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:45:00,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:45:00,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:45:00,217 INFO L87 Difference]: Start difference. First operand 3496 states and 12672 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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:45:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:45:00,734 INFO L93 Difference]: Finished difference Result 5592 states and 20320 transitions. [2025-04-13 21:45:00,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:45:00,734 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 36 [2025-04-13 21:45:00,734 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:45:00,783 INFO L225 Difference]: With dead ends: 5592 [2025-04-13 21:45:00,784 INFO L226 Difference]: Without dead ends: 4756 [2025-04-13 21:45:00,786 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:45:00,786 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 218 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:45:00,786 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 53 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:45:00,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2025-04-13 21:45:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 3172. [2025-04-13 21:45:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3172 states, 3171 states have (on average 3.5704824976348157) internal successors, (11322), 3171 states have internal predecessors, (11322), 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:45:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 11322 transitions. [2025-04-13 21:45:00,885 INFO L79 Accepts]: Start accepts. Automaton has 3172 states and 11322 transitions. Word has length 36 [2025-04-13 21:45:00,886 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:45:00,886 INFO L485 AbstractCegarLoop]: Abstraction has 3172 states and 11322 transitions. [2025-04-13 21:45:00,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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:45:00,886 INFO L278 IsEmpty]: Start isEmpty. Operand 3172 states and 11322 transitions. [2025-04-13 21:45:00,891 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 21:45:00,891 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:45:00,891 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, 1] [2025-04-13 21:45:00,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 21:45:00,891 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 21:45:00,892 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:45:00,892 INFO L85 PathProgramCache]: Analyzing trace with hash -3192683, now seen corresponding path program 3 times [2025-04-13 21:45:00,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:45:00,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143519477] [2025-04-13 21:45:00,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:45:00,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:45:00,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 1 equivalence classes. [2025-04-13 21:45:00,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 21:45:00,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:45:00,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:45:00,936 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:45:00,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 21:45:00,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 21:45:00,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:45:00,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:45:00,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:45:00,998 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:45:00,999 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 21:45:01,000 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 21:45:01,000 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 21:45:01,000 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 21:45:01,000 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-13 21:45:01,000 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-13 21:45:01,000 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 21:45:01,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 21:45:01,002 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:45:01,104 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:45:01,105 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:45:01,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:45:01 BasicIcfg [2025-04-13 21:45:01,109 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:45:01,109 INFO L158 Benchmark]: Toolchain (without parser) took 29118.68ms. Allocated memory was 155.2MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 106.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2025-04-13 21:45:01,109 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:45:01,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.24ms. Allocated memory is still 155.2MB. Free memory was 106.0MB in the beginning and 78.9MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 21:45:01,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.89ms. Allocated memory is still 155.2MB. Free memory was 78.9MB in the beginning and 76.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:45:01,110 INFO L158 Benchmark]: Boogie Preprocessor took 44.68ms. Allocated memory is still 155.2MB. Free memory was 76.3MB in the beginning and 72.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:45:01,110 INFO L158 Benchmark]: IcfgBuilder took 604.64ms. Allocated memory is still 155.2MB. Free memory was 72.8MB in the beginning and 75.5MB in the end (delta: -2.8MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. [2025-04-13 21:45:01,110 INFO L158 Benchmark]: TraceAbstraction took 27946.98ms. Allocated memory was 155.2MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 74.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2025-04-13 21:45:01,111 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 481.24ms. Allocated memory is still 155.2MB. Free memory was 106.0MB in the beginning and 78.9MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.89ms. Allocated memory is still 155.2MB. Free memory was 78.9MB in the beginning and 76.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 44.68ms. Allocated memory is still 155.2MB. Free memory was 76.3MB in the beginning and 72.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 604.64ms. Allocated memory is still 155.2MB. Free memory was 72.8MB in the beginning and 75.5MB in the end (delta: -2.8MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. * TraceAbstraction took 27946.98ms. Allocated memory was 155.2MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 74.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 4.0GB. 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_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L851] 0 pthread_t t1081; [L852] FCALL, FORK 0 pthread_create(&t1081, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081=-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] [L853] 0 pthread_t t1082; [L854] FCALL, FORK 0 pthread_create(&t1082, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081=-1, t1082=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] [L855] 0 pthread_t t1083; [L856] FCALL, FORK 0 pthread_create(&t1083, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081=-1, t1082=0, t1083=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] [L857] 0 pthread_t t1084; [L858] FCALL, FORK 0 pthread_create(&t1084, ((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_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081=-1, t1082=0, t1083=1, t1084=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=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] [L787] 3 y$w_buff1 = y$w_buff0 [L788] 3 y$w_buff0 = 2 [L789] 3 y$w_buff1_used = y$w_buff0_used [L790] 3 y$w_buff0_used = (_Bool)1 [L791] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L791] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L792] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L793] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L794] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L795] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L796] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L800] 3 __unbuffered_p2_EAX = z VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 4 z = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L820] 4 a = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L826] 4 __unbuffered_p3_EBX = b VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L829] 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) [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 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 [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L836] 4 __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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L752] 1 b = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L755] 1 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L760] 1 __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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L767] 2 x = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L770] 2 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L773] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L803] 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) [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] 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 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] 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=3, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L810] 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=4, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L860] 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1081=-1, t1082=0, t1083=1, t1084=2, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 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 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1081=-1, t1082=0, t1083=1, t1084=2, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] 0 y$mem_tmp = y [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L883] 0 y = y$flush_delayed ? y$mem_tmp : y [L884] 0 y$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1081=-1, t1082=0, t1083=1, t1084=2, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L886] 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, 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: 852]: 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: 854]: 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: 856]: 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: 858]: 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, 82 locations, 77 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 27.8s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.4s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2108 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2108 mSDsluCounter, 550 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 407 mSDsCounter, 172 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4755 IncrementalHoareTripleChecker+Invalid, 4927 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 172 mSolverCounterUnsat, 143 mSDtfsCounter, 4755 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26917occurred in iteration=0, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 20626 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 492 NumberOfCodeBlocks, 492 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 437 ConstructedInterpolants, 0 QuantifiedInterpolants, 5433 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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:45:01,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...