/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-theta/unwind3-100.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:32:08,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:32:08,431 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 23:32:08,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:32:08,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:32:08,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:32:08,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:32:08,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:32:08,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:32:08,457 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:32:08,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:32:08,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:32:08,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:32:08,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:32:08,459 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:32:08,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:32:08,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:32:08,459 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:32:08,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:32:08,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:32:08,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:32:08,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:32:08,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:32:08,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:32:08,460 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:32:08,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:32:08,460 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:32:08,460 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:32:08,460 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:32:08,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:32:08,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:32:08,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:32:08,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:32:08,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:32:08,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:32:08,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:32:08,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:32:08,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:32:08,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:32:08,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:32:08,461 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:32:08,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:32:08,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:32:08,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:32:08,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:32:08,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:32:08,461 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:32:08,461 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 23:32:08,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:32:08,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:32:08,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:32:08,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:32:08,664 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:32:08,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/unwind3-100.i [2025-04-13 23:32:09,939 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b47c0abd/6f0cd64bd17e4a6793c56ccaa76e4a57/FLAG1a2d4ecc6 [2025-04-13 23:32:10,145 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:32:10,145 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind3-100.i [2025-04-13 23:32:10,161 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b47c0abd/6f0cd64bd17e4a6793c56ccaa76e4a57/FLAG1a2d4ecc6 [2025-04-13 23:32:10,990 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b47c0abd/6f0cd64bd17e4a6793c56ccaa76e4a57 [2025-04-13 23:32:10,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:32:10,993 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:32:10,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:32:10,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:32:10,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:32:10,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:32:10" (1/1) ... [2025-04-13 23:32:10,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7abc27a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:10, skipping insertion in model container [2025-04-13 23:32:10,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:32:10" (1/1) ... [2025-04-13 23:32:11,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:32:11,275 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-theta/unwind3-100.i[33026,33039] [2025-04-13 23:32:11,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:32:11,297 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:32:11,338 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-theta/unwind3-100.i[33026,33039] [2025-04-13 23:32:11,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:32:11,363 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:32:11,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:11 WrapperNode [2025-04-13 23:32:11,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:32:11,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:32:11,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:32:11,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:32:11,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:11" (1/1) ... [2025-04-13 23:32:11,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:11" (1/1) ... [2025-04-13 23:32:11,391 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-04-13 23:32:11,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:32:11,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:32:11,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:32:11,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:32:11,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:11" (1/1) ... [2025-04-13 23:32:11,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:11" (1/1) ... [2025-04-13 23:32:11,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:11" (1/1) ... [2025-04-13 23:32:11,406 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 23:32:11,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:11" (1/1) ... [2025-04-13 23:32:11,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:11" (1/1) ... [2025-04-13 23:32:11,409 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:11" (1/1) ... [2025-04-13 23:32:11,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:11" (1/1) ... [2025-04-13 23:32:11,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:11" (1/1) ... [2025-04-13 23:32:11,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:11" (1/1) ... [2025-04-13 23:32:11,415 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:32:11,415 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:32:11,415 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:32:11,415 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:32:11,420 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:11" (1/1) ... [2025-04-13 23:32:11,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:32:11,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:32:11,445 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 23:32:11,447 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 23:32:11,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:32:11,462 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-13 23:32:11,462 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-13 23:32:11,463 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-13 23:32:11,463 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-13 23:32:11,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:32:11,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:32:11,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:32:11,464 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 23:32:11,546 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:32:11,547 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:32:11,643 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:32:11,643 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:32:11,643 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:32:11,730 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:32:11,735 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:32:11,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:32:11 BoogieIcfgContainer [2025-04-13 23:32:11,735 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:32:11,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:32:11,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:32:11,741 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:32:11,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:32:10" (1/3) ... [2025-04-13 23:32:11,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642b5e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:32:11, skipping insertion in model container [2025-04-13 23:32:11,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:32:11" (2/3) ... [2025-04-13 23:32:11,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642b5e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:32:11, skipping insertion in model container [2025-04-13 23:32:11,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:32:11" (3/3) ... [2025-04-13 23:32:11,742 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-100.i [2025-04-13 23:32:11,751 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:32:11,752 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-100.i that has 3 procedures, 16 locations, 16 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 23:32:11,752 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:32:11,783 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:32:11,806 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 22 places, 18 transitions, 44 flow [2025-04-13 23:32:11,819 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 51 states, 48 states have (on average 2.0208333333333335) internal successors, (97), 50 states have internal predecessors, (97), 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 23:32:11,838 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:32:11,845 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;@51c72afd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:32:11,845 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:32:11,847 INFO L278 IsEmpty]: Start isEmpty. Operand has 51 states, 48 states have (on average 2.0208333333333335) internal successors, (97), 50 states have internal predecessors, (97), 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 23:32:11,850 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 23:32:11,850 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:11,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:32:11,851 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:32:11,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:11,854 INFO L85 PathProgramCache]: Analyzing trace with hash 828891615, now seen corresponding path program 1 times [2025-04-13 23:32:11,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:11,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379168251] [2025-04-13 23:32:11,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:11,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:11,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:32:11,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:32:11,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:11,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:32:11,933 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:32:11,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:32:11,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:32:11,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:11,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:32:11,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:32:11,962 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:32:11,962 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 23:32:11,964 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 23:32:11,964 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 23:32:11,964 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 23:32:11,964 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:32:11,967 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 23:32:11,968 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:32:11,968 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 23:32:11,986 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:32:11,987 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions, 74 flow [2025-04-13 23:32:12,010 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 207 states, 203 states have (on average 2.6699507389162562) internal successors, (542), 206 states have internal predecessors, (542), 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 23:32:12,013 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:32:12,014 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;@51c72afd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:32:12,014 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 23:32:12,015 INFO L278 IsEmpty]: Start isEmpty. Operand has 207 states, 203 states have (on average 2.6699507389162562) internal successors, (542), 206 states have internal predecessors, (542), 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 23:32:12,016 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 23:32:12,016 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:12,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:32:12,016 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 23:32:12,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:12,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1627684701, now seen corresponding path program 1 times [2025-04-13 23:32:12,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:12,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080252824] [2025-04-13 23:32:12,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:12,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:12,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:32:12,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:32:12,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:12,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:12,123 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 23:32:12,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:12,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080252824] [2025-04-13 23:32:12,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080252824] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:12,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:12,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:32:12,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852015814] [2025-04-13 23:32:12,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:12,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:32:12,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:12,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:32:12,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:12,140 INFO L87 Difference]: Start difference. First operand has 207 states, 203 states have (on average 2.6699507389162562) internal successors, (542), 206 states have internal predecessors, (542), 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, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 23:32:12,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:12,193 INFO L93 Difference]: Finished difference Result 207 states and 542 transitions. [2025-04-13 23:32:12,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:32:12,196 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-04-13 23:32:12,197 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:12,205 INFO L225 Difference]: With dead ends: 207 [2025-04-13 23:32:12,205 INFO L226 Difference]: Without dead ends: 200 [2025-04-13 23:32:12,206 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 23:32:12,208 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:12,208 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:32:12,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-04-13 23:32:12,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-04-13 23:32:12,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 197 states have (on average 2.6954314720812182) internal successors, (531), 199 states have internal predecessors, (531), 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 23:32:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 531 transitions. [2025-04-13 23:32:12,239 INFO L79 Accepts]: Start accepts. Automaton has 200 states and 531 transitions. Word has length 6 [2025-04-13 23:32:12,239 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:12,239 INFO L485 AbstractCegarLoop]: Abstraction has 200 states and 531 transitions. [2025-04-13 23:32:12,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 23:32:12,239 INFO L278 IsEmpty]: Start isEmpty. Operand 200 states and 531 transitions. [2025-04-13 23:32:12,240 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 23:32:12,240 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:12,240 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:12,240 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:32:12,240 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 23:32:12,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:12,241 INFO L85 PathProgramCache]: Analyzing trace with hash 805158147, now seen corresponding path program 1 times [2025-04-13 23:32:12,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:12,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265656845] [2025-04-13 23:32:12,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:12,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:12,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:32:12,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:32:12,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:12,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:32:12,262 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:32:12,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:32:12,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:32:12,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:12,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:32:12,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:32:12,276 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:32:12,276 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 23:32:12,276 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 23:32:12,276 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 23:32:12,276 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 23:32:12,276 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 23:32:12,276 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:32:12,277 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:32:12,277 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:32:12,277 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 23:32:12,300 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:32:12,303 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 36 transitions, 108 flow [2025-04-13 23:32:12,343 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 831 states, 826 states have (on average 3.37772397094431) internal successors, (2790), 830 states have internal predecessors, (2790), 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 23:32:12,344 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:32:12,346 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;@51c72afd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:32:12,346 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 23:32:12,347 INFO L278 IsEmpty]: Start isEmpty. Operand has 831 states, 826 states have (on average 3.37772397094431) internal successors, (2790), 830 states have internal predecessors, (2790), 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 23:32:12,347 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 23:32:12,348 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:12,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:32:12,348 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:12,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:12,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1602270139, now seen corresponding path program 1 times [2025-04-13 23:32:12,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:12,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229432005] [2025-04-13 23:32:12,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:12,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:12,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:32:12,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:32:12,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:12,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:12,374 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 23:32:12,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:12,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229432005] [2025-04-13 23:32:12,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229432005] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:12,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:12,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:32:12,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585665250] [2025-04-13 23:32:12,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:12,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:32:12,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:12,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:32:12,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:12,377 INFO L87 Difference]: Start difference. First operand has 831 states, 826 states have (on average 3.37772397094431) internal successors, (2790), 830 states have internal predecessors, (2790), 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, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 23:32:12,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:12,427 INFO L93 Difference]: Finished difference Result 831 states and 2790 transitions. [2025-04-13 23:32:12,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:32:12,429 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-04-13 23:32:12,429 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:12,438 INFO L225 Difference]: With dead ends: 831 [2025-04-13 23:32:12,438 INFO L226 Difference]: Without dead ends: 824 [2025-04-13 23:32:12,439 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 23:32:12,439 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:12,439 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:32:12,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-04-13 23:32:12,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2025-04-13 23:32:12,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 820 states have (on average 3.3890243902439026) internal successors, (2779), 823 states have internal predecessors, (2779), 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 23:32:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2779 transitions. [2025-04-13 23:32:12,492 INFO L79 Accepts]: Start accepts. Automaton has 824 states and 2779 transitions. Word has length 6 [2025-04-13 23:32:12,493 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:12,493 INFO L485 AbstractCegarLoop]: Abstraction has 824 states and 2779 transitions. [2025-04-13 23:32:12,493 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 23:32:12,493 INFO L278 IsEmpty]: Start isEmpty. Operand 824 states and 2779 transitions. [2025-04-13 23:32:12,494 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 23:32:12,494 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:12,494 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:12,494 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:32:12,494 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:12,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:12,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2078691393, now seen corresponding path program 1 times [2025-04-13 23:32:12,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:12,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334980053] [2025-04-13 23:32:12,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:12,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:12,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:32:12,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:32:12,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:12,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:12,550 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 23:32:12,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:12,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334980053] [2025-04-13 23:32:12,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334980053] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:12,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:12,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:32:12,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605344548] [2025-04-13 23:32:12,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:12,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:32:12,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:12,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:32:12,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:32:12,551 INFO L87 Difference]: Start difference. First operand 824 states and 2779 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:32:12,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:12,622 INFO L93 Difference]: Finished difference Result 824 states and 2779 transitions. [2025-04-13 23:32:12,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:32:12,622 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:32:12,622 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:12,655 INFO L225 Difference]: With dead ends: 824 [2025-04-13 23:32:12,656 INFO L226 Difference]: Without dead ends: 796 [2025-04-13 23:32:12,656 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 23:32:12,657 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:12,657 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:32:12,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-04-13 23:32:12,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 796. [2025-04-13 23:32:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 793 states have (on average 3.4224464060529636) internal successors, (2714), 795 states have internal predecessors, (2714), 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 23:32:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2714 transitions. [2025-04-13 23:32:12,683 INFO L79 Accepts]: Start accepts. Automaton has 796 states and 2714 transitions. Word has length 8 [2025-04-13 23:32:12,683 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:12,683 INFO L485 AbstractCegarLoop]: Abstraction has 796 states and 2714 transitions. [2025-04-13 23:32:12,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:32:12,683 INFO L278 IsEmpty]: Start isEmpty. Operand 796 states and 2714 transitions. [2025-04-13 23:32:12,684 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 23:32:12,684 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:12,684 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:12,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:32:12,684 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:32:12,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:12,685 INFO L85 PathProgramCache]: Analyzing trace with hash 430562838, now seen corresponding path program 1 times [2025-04-13 23:32:12,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:12,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527925737] [2025-04-13 23:32:12,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:12,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:12,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:32:12,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:32:12,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:12,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:32:12,702 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:32:12,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:32:12,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:32:12,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:12,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:32:12,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:32:12,716 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:32:12,716 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 23:32:12,717 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-13 23:32:12,717 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 23:32:12,717 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 23:32:12,717 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 23:32:12,717 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 23:32:12,717 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:32:12,717 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 23:32:12,717 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:32:12,717 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 23:32:12,742 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:32:12,743 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions, 146 flow [2025-04-13 23:32:12,840 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3327 states, 3321 states have (on average 4.111412225233363) internal successors, (13654), 3326 states have internal predecessors, (13654), 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 23:32:12,842 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:32:12,843 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;@51c72afd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:32:12,843 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 23:32:12,852 INFO L278 IsEmpty]: Start isEmpty. Operand has 3327 states, 3321 states have (on average 4.111412225233363) internal successors, (13654), 3326 states have internal predecessors, (13654), 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 23:32:12,852 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 23:32:12,852 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:12,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:32:12,853 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 23:32:12,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:12,853 INFO L85 PathProgramCache]: Analyzing trace with hash -271006707, now seen corresponding path program 1 times [2025-04-13 23:32:12,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:12,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992328100] [2025-04-13 23:32:12,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:12,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:12,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:32:12,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:32:12,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:12,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:12,894 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 23:32:12,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:12,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992328100] [2025-04-13 23:32:12,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992328100] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:12,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:12,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:32:12,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114904216] [2025-04-13 23:32:12,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:12,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:32:12,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:12,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:32:12,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:12,906 INFO L87 Difference]: Start difference. First operand has 3327 states, 3321 states have (on average 4.111412225233363) internal successors, (13654), 3326 states have internal predecessors, (13654), 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, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 23:32:12,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:12,982 INFO L93 Difference]: Finished difference Result 3327 states and 13654 transitions. [2025-04-13 23:32:12,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:32:12,983 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-04-13 23:32:12,983 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:13,006 INFO L225 Difference]: With dead ends: 3327 [2025-04-13 23:32:13,006 INFO L226 Difference]: Without dead ends: 3320 [2025-04-13 23:32:13,008 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 23:32:13,009 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:13,010 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:32:13,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3320 states. [2025-04-13 23:32:13,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3320 to 3320. [2025-04-13 23:32:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 3315 states have (on average 4.115535444947209) internal successors, (13643), 3319 states have internal predecessors, (13643), 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 23:32:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 13643 transitions. [2025-04-13 23:32:13,143 INFO L79 Accepts]: Start accepts. Automaton has 3320 states and 13643 transitions. Word has length 6 [2025-04-13 23:32:13,143 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:13,143 INFO L485 AbstractCegarLoop]: Abstraction has 3320 states and 13643 transitions. [2025-04-13 23:32:13,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 23:32:13,143 INFO L278 IsEmpty]: Start isEmpty. Operand 3320 states and 13643 transitions. [2025-04-13 23:32:13,144 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 23:32:13,144 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:13,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:13,144 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:32:13,144 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 23:32:13,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:13,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1521465904, now seen corresponding path program 1 times [2025-04-13 23:32:13,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:13,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645360203] [2025-04-13 23:32:13,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:13,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:13,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:32:13,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:32:13,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:13,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:13,188 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 23:32:13,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:13,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645360203] [2025-04-13 23:32:13,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645360203] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:13,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:13,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:32:13,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504739952] [2025-04-13 23:32:13,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:13,189 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:32:13,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:13,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:32:13,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:32:13,190 INFO L87 Difference]: Start difference. First operand 3320 states and 13643 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:32:13,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:13,318 INFO L93 Difference]: Finished difference Result 3320 states and 13643 transitions. [2025-04-13 23:32:13,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:32:13,318 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:32:13,318 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:13,341 INFO L225 Difference]: With dead ends: 3320 [2025-04-13 23:32:13,341 INFO L226 Difference]: Without dead ends: 3292 [2025-04-13 23:32:13,343 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 23:32:13,344 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:13,347 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 2 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:32:13,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2025-04-13 23:32:13,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 3292. [2025-04-13 23:32:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3292 states, 3288 states have (on average 4.12956204379562) internal successors, (13578), 3291 states have internal predecessors, (13578), 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 23:32:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 13578 transitions. [2025-04-13 23:32:13,468 INFO L79 Accepts]: Start accepts. Automaton has 3292 states and 13578 transitions. Word has length 8 [2025-04-13 23:32:13,469 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:13,469 INFO L485 AbstractCegarLoop]: Abstraction has 3292 states and 13578 transitions. [2025-04-13 23:32:13,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:32:13,469 INFO L278 IsEmpty]: Start isEmpty. Operand 3292 states and 13578 transitions. [2025-04-13 23:32:13,471 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 23:32:13,471 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:13,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:13,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:32:13,471 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 23:32:13,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:13,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1806682900, now seen corresponding path program 1 times [2025-04-13 23:32:13,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:13,472 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616622749] [2025-04-13 23:32:13,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:13,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:13,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:32:13,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:32:13,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:13,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:13,577 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 23:32:13,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:13,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616622749] [2025-04-13 23:32:13,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616622749] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:13,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:13,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:32:13,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913642404] [2025-04-13 23:32:13,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:13,578 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:32:13,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:13,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:32:13,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:32:13,578 INFO L87 Difference]: Start difference. First operand 3292 states and 13578 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 23:32:13,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:13,806 INFO L93 Difference]: Finished difference Result 4636 states and 19338 transitions. [2025-04-13 23:32:13,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:32:13,806 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2025-04-13 23:32:13,807 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:13,838 INFO L225 Difference]: With dead ends: 4636 [2025-04-13 23:32:13,838 INFO L226 Difference]: Without dead ends: 3964 [2025-04-13 23:32:13,842 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:32:13,843 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:13,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 2 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:13,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3964 states. [2025-04-13 23:32:14,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3964 to 3964. [2025-04-13 23:32:14,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3964 states, 3960 states have (on average 4.156060606060606) internal successors, (16458), 3963 states have internal predecessors, (16458), 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 23:32:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3964 states and 16458 transitions. [2025-04-13 23:32:14,063 INFO L79 Accepts]: Start accepts. Automaton has 3964 states and 16458 transitions. Word has length 10 [2025-04-13 23:32:14,063 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:14,064 INFO L485 AbstractCegarLoop]: Abstraction has 3964 states and 16458 transitions. [2025-04-13 23:32:14,064 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 23:32:14,064 INFO L278 IsEmpty]: Start isEmpty. Operand 3964 states and 16458 transitions. [2025-04-13 23:32:14,065 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 23:32:14,065 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:14,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:14,065 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:32:14,065 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 23:32:14,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:14,066 INFO L85 PathProgramCache]: Analyzing trace with hash 172595313, now seen corresponding path program 1 times [2025-04-13 23:32:14,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:14,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997840469] [2025-04-13 23:32:14,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:14,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:14,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:32:14,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:32:14,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:14,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:32:14,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:14,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997840469] [2025-04-13 23:32:14,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997840469] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:14,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:14,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:32:14,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035094199] [2025-04-13 23:32:14,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:14,109 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:32:14,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:14,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:32:14,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:32:14,109 INFO L87 Difference]: Start difference. First operand 3964 states and 16458 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 23:32:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:14,269 INFO L93 Difference]: Finished difference Result 3964 states and 16458 transitions. [2025-04-13 23:32:14,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:32:14,270 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-04-13 23:32:14,270 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:14,291 INFO L225 Difference]: With dead ends: 3964 [2025-04-13 23:32:14,292 INFO L226 Difference]: Without dead ends: 3820 [2025-04-13 23:32:14,293 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:32:14,294 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 45 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:14,294 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2025-04-13 23:32:14,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3820. [2025-04-13 23:32:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3820 states, 3817 states have (on average 4.196489389572963) internal successors, (16018), 3819 states have internal predecessors, (16018), 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 23:32:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3820 states to 3820 states and 16018 transitions. [2025-04-13 23:32:14,477 INFO L79 Accepts]: Start accepts. Automaton has 3820 states and 16018 transitions. Word has length 11 [2025-04-13 23:32:14,477 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:14,477 INFO L485 AbstractCegarLoop]: Abstraction has 3820 states and 16018 transitions. [2025-04-13 23:32:14,477 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 23:32:14,477 INFO L278 IsEmpty]: Start isEmpty. Operand 3820 states and 16018 transitions. [2025-04-13 23:32:14,479 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 23:32:14,479 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:14,480 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:14,480 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 23:32:14,480 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-13 23:32:14,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:14,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1023199992, now seen corresponding path program 1 times [2025-04-13 23:32:14,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:14,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981965446] [2025-04-13 23:32:14,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:14,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:14,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:32:14,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:32:14,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:14,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:32:14,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:32:14,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:32:14,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:32:14,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:14,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:32:14,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:32:14,499 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:32:14,499 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-13 23:32:14,499 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2025-04-13 23:32:14,499 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-04-13 23:32:14,499 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-13 23:32:14,499 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 23:32:14,499 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 23:32:14,499 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 23:32:14,499 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 23:32:14,499 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-13 23:32:14,500 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:32:14,500 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 23:32:14,528 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:32:14,529 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70 places, 54 transitions, 188 flow [2025-04-13 23:32:14,965 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 13311 states, 13304 states have (on average 4.855532170775707) internal successors, (64598), 13310 states have internal predecessors, (64598), 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 23:32:14,966 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:32:14,966 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;@51c72afd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:32:14,966 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 23:32:14,997 INFO L278 IsEmpty]: Start isEmpty. Operand has 13311 states, 13304 states have (on average 4.855532170775707) internal successors, (64598), 13310 states have internal predecessors, (64598), 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 23:32:14,998 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 23:32:14,998 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:14,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:32:14,998 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:32:14,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:14,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1326507445, now seen corresponding path program 1 times [2025-04-13 23:32:14,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:14,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385882542] [2025-04-13 23:32:14,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:14,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:15,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:32:15,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:32:15,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:15,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:15,022 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 23:32:15,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:15,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385882542] [2025-04-13 23:32:15,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385882542] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:15,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:15,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:32:15,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199364471] [2025-04-13 23:32:15,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:15,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:32:15,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:15,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:32:15,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:15,061 INFO L87 Difference]: Start difference. First operand has 13311 states, 13304 states have (on average 4.855532170775707) internal successors, (64598), 13310 states have internal predecessors, (64598), 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, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 23:32:15,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:15,319 INFO L93 Difference]: Finished difference Result 13311 states and 64598 transitions. [2025-04-13 23:32:15,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:32:15,319 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-04-13 23:32:15,319 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:15,414 INFO L225 Difference]: With dead ends: 13311 [2025-04-13 23:32:15,414 INFO L226 Difference]: Without dead ends: 13304 [2025-04-13 23:32:15,423 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 23:32:15,424 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:15,424 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:32:15,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13304 states. [2025-04-13 23:32:15,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13304 to 13304. [2025-04-13 23:32:15,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13304 states, 13298 states have (on average 4.856895773800572) internal successors, (64587), 13303 states have internal predecessors, (64587), 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 23:32:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13304 states to 13304 states and 64587 transitions. [2025-04-13 23:32:16,009 INFO L79 Accepts]: Start accepts. Automaton has 13304 states and 64587 transitions. Word has length 6 [2025-04-13 23:32:16,009 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:16,009 INFO L485 AbstractCegarLoop]: Abstraction has 13304 states and 64587 transitions. [2025-04-13 23:32:16,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 23:32:16,009 INFO L278 IsEmpty]: Start isEmpty. Operand 13304 states and 64587 transitions. [2025-04-13 23:32:16,009 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 23:32:16,009 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:16,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:16,010 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 23:32:16,010 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:32:16,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:16,010 INFO L85 PathProgramCache]: Analyzing trace with hash -866486497, now seen corresponding path program 1 times [2025-04-13 23:32:16,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:16,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224582293] [2025-04-13 23:32:16,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:16,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:16,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:32:16,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:32:16,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:16,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:16,043 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 23:32:16,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:16,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224582293] [2025-04-13 23:32:16,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224582293] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:16,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:16,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:32:16,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594107089] [2025-04-13 23:32:16,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:16,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:32:16,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:16,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:32:16,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:32:16,044 INFO L87 Difference]: Start difference. First operand 13304 states and 64587 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:32:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:16,335 INFO L93 Difference]: Finished difference Result 13304 states and 64587 transitions. [2025-04-13 23:32:16,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:32:16,336 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:32:16,336 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:16,410 INFO L225 Difference]: With dead ends: 13304 [2025-04-13 23:32:16,411 INFO L226 Difference]: Without dead ends: 13276 [2025-04-13 23:32:16,415 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 23:32:16,417 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 36 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:16,417 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 2 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:16,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13276 states. [2025-04-13 23:32:16,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13276 to 13276. [2025-04-13 23:32:16,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13276 states, 13271 states have (on average 4.8618792856604625) internal successors, (64522), 13275 states have internal predecessors, (64522), 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 23:32:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13276 states to 13276 states and 64522 transitions. [2025-04-13 23:32:16,855 INFO L79 Accepts]: Start accepts. Automaton has 13276 states and 64522 transitions. Word has length 8 [2025-04-13 23:32:16,855 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:16,855 INFO L485 AbstractCegarLoop]: Abstraction has 13276 states and 64522 transitions. [2025-04-13 23:32:16,855 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:32:16,855 INFO L278 IsEmpty]: Start isEmpty. Operand 13276 states and 64522 transitions. [2025-04-13 23:32:16,856 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 23:32:16,856 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:16,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:16,856 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 23:32:16,856 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:32:16,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:16,856 INFO L85 PathProgramCache]: Analyzing trace with hash 496201098, now seen corresponding path program 1 times [2025-04-13 23:32:16,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:16,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941664826] [2025-04-13 23:32:16,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:16,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:16,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:32:16,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:32:16,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:16,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:16,896 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 23:32:16,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:16,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941664826] [2025-04-13 23:32:16,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941664826] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:16,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:16,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:32:16,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668386279] [2025-04-13 23:32:16,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:16,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:32:16,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:16,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:32:16,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:32:16,897 INFO L87 Difference]: Start difference. First operand 13276 states and 64522 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 23:32:17,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:17,315 INFO L93 Difference]: Finished difference Result 18716 states and 91786 transitions. [2025-04-13 23:32:17,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:32:17,315 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2025-04-13 23:32:17,315 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:17,484 INFO L225 Difference]: With dead ends: 18716 [2025-04-13 23:32:17,484 INFO L226 Difference]: Without dead ends: 15996 [2025-04-13 23:32:17,494 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 23:32:17,494 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 40 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:17,495 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15996 states. [2025-04-13 23:32:18,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15996 to 15996. [2025-04-13 23:32:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15996 states, 15991 states have (on average 4.8873741479582264) internal successors, (78154), 15995 states have internal predecessors, (78154), 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 23:32:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15996 states to 15996 states and 78154 transitions. [2025-04-13 23:32:18,153 INFO L79 Accepts]: Start accepts. Automaton has 15996 states and 78154 transitions. Word has length 10 [2025-04-13 23:32:18,154 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:18,154 INFO L485 AbstractCegarLoop]: Abstraction has 15996 states and 78154 transitions. [2025-04-13 23:32:18,154 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 23:32:18,154 INFO L278 IsEmpty]: Start isEmpty. Operand 15996 states and 78154 transitions. [2025-04-13 23:32:18,155 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 23:32:18,155 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:18,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:18,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 23:32:18,155 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:32:18,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:18,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1797634836, now seen corresponding path program 1 times [2025-04-13 23:32:18,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:18,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031997789] [2025-04-13 23:32:18,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:18,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:18,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:32:18,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:32:18,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:18,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:32:18,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:18,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031997789] [2025-04-13 23:32:18,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031997789] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:18,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:18,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:32:18,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507369535] [2025-04-13 23:32:18,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:18,208 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:32:18,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:18,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:32:18,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:32:18,208 INFO L87 Difference]: Start difference. First operand 15996 states and 78154 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 23:32:18,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:18,683 INFO L93 Difference]: Finished difference Result 15996 states and 78154 transitions. [2025-04-13 23:32:18,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:32:18,684 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-04-13 23:32:18,684 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:18,766 INFO L225 Difference]: With dead ends: 15996 [2025-04-13 23:32:18,767 INFO L226 Difference]: Without dead ends: 15852 [2025-04-13 23:32:18,774 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:32:18,775 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 52 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:18,775 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 2 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15852 states. [2025-04-13 23:32:19,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15852 to 15852. [2025-04-13 23:32:19,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15852 states, 15848 states have (on average 4.9037102473498235) internal successors, (77714), 15851 states have internal predecessors, (77714), 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 23:32:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15852 states to 15852 states and 77714 transitions. [2025-04-13 23:32:19,287 INFO L79 Accepts]: Start accepts. Automaton has 15852 states and 77714 transitions. Word has length 11 [2025-04-13 23:32:19,288 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:19,288 INFO L485 AbstractCegarLoop]: Abstraction has 15852 states and 77714 transitions. [2025-04-13 23:32:19,288 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 23:32:19,288 INFO L278 IsEmpty]: Start isEmpty. Operand 15852 states and 77714 transitions. [2025-04-13 23:32:19,289 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 23:32:19,289 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:19,289 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:19,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 23:32:19,289 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:32:19,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:19,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1973744832, now seen corresponding path program 1 times [2025-04-13 23:32:19,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:19,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297429745] [2025-04-13 23:32:19,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:19,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:19,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 23:32:19,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 23:32:19,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:19,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:32:19,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:19,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297429745] [2025-04-13 23:32:19,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297429745] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:19,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:19,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:32:19,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888210923] [2025-04-13 23:32:19,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:19,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:32:19,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:19,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:32:19,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:32:19,349 INFO L87 Difference]: Start difference. First operand 15852 states and 77714 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 23:32:19,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:19,586 INFO L93 Difference]: Finished difference Result 15852 states and 77714 transitions. [2025-04-13 23:32:19,586 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:32:19,586 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2025-04-13 23:32:19,586 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:19,659 INFO L225 Difference]: With dead ends: 15852 [2025-04-13 23:32:19,660 INFO L226 Difference]: Without dead ends: 15276 [2025-04-13 23:32:19,668 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:32:19,669 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 74 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:19,669 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 3 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:19,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15276 states. [2025-04-13 23:32:20,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15276 to 15276. [2025-04-13 23:32:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15276 states, 15273 states have (on average 4.944804557061481) internal successors, (75522), 15275 states have internal predecessors, (75522), 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 23:32:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15276 states to 15276 states and 75522 transitions. [2025-04-13 23:32:20,398 INFO L79 Accepts]: Start accepts. Automaton has 15276 states and 75522 transitions. Word has length 13 [2025-04-13 23:32:20,398 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:20,398 INFO L485 AbstractCegarLoop]: Abstraction has 15276 states and 75522 transitions. [2025-04-13 23:32:20,398 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 23:32:20,398 INFO L278 IsEmpty]: Start isEmpty. Operand 15276 states and 75522 transitions. [2025-04-13 23:32:20,399 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 23:32:20,399 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:20,399 INFO L218 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:20,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 23:32:20,400 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 23:32:20,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:20,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1088673399, now seen corresponding path program 1 times [2025-04-13 23:32:20,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:20,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916817065] [2025-04-13 23:32:20,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:20,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:20,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:32:20,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:32:20,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:20,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:32:20,412 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:32:20,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:32:20,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:32:20,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:20,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:32:20,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:32:20,421 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:32:20,421 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-13 23:32:20,421 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 8 remaining) [2025-04-13 23:32:20,421 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-13 23:32:20,421 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-13 23:32:20,421 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-13 23:32:20,421 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-13 23:32:20,421 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-04-13 23:32:20,421 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-04-13 23:32:20,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 23:32:20,422 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-13 23:32:20,422 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:32:20,422 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-13 23:32:20,451 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:32:20,452 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 63 transitions, 234 flow [2025-04-13 23:32:22,483 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 53247 states, 53239 states have (on average 5.6035237326020395) internal successors, (298326), 53246 states have internal predecessors, (298326), 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 23:32:22,484 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:32:22,484 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;@51c72afd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:32:22,484 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-13 23:32:22,566 INFO L278 IsEmpty]: Start isEmpty. Operand has 53247 states, 53239 states have (on average 5.6035237326020395) internal successors, (298326), 53246 states have internal predecessors, (298326), 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 23:32:22,566 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 23:32:22,566 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:22,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:32:22,566 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-13 23:32:22,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:22,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1104694467, now seen corresponding path program 1 times [2025-04-13 23:32:22,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:22,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250374861] [2025-04-13 23:32:22,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:22,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:22,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:32:22,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:32:22,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:22,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:22,580 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 23:32:22,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:22,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250374861] [2025-04-13 23:32:22,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250374861] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:22,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:22,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:32:22,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908445660] [2025-04-13 23:32:22,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:22,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:32:22,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:22,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:32:22,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:22,667 INFO L87 Difference]: Start difference. First operand has 53247 states, 53239 states have (on average 5.6035237326020395) internal successors, (298326), 53246 states have internal predecessors, (298326), 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, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 23:32:23,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:23,178 INFO L93 Difference]: Finished difference Result 53247 states and 298326 transitions. [2025-04-13 23:32:23,179 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:32:23,179 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-04-13 23:32:23,179 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:23,904 INFO L225 Difference]: With dead ends: 53247 [2025-04-13 23:32:23,905 INFO L226 Difference]: Without dead ends: 53240 [2025-04-13 23:32:23,916 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 23:32:23,916 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:23,916 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:32:24,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53240 states. [2025-04-13 23:32:25,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53240 to 53240. [2025-04-13 23:32:25,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53240 states, 53233 states have (on average 5.603948678451337) internal successors, (298315), 53239 states have internal predecessors, (298315), 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 23:32:26,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53240 states to 53240 states and 298315 transitions. [2025-04-13 23:32:26,151 INFO L79 Accepts]: Start accepts. Automaton has 53240 states and 298315 transitions. Word has length 6 [2025-04-13 23:32:26,151 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:26,151 INFO L485 AbstractCegarLoop]: Abstraction has 53240 states and 298315 transitions. [2025-04-13 23:32:26,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 23:32:26,151 INFO L278 IsEmpty]: Start isEmpty. Operand 53240 states and 298315 transitions. [2025-04-13 23:32:26,152 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 23:32:26,152 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:26,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:26,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 23:32:26,152 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-13 23:32:26,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:26,152 INFO L85 PathProgramCache]: Analyzing trace with hash -790198002, now seen corresponding path program 1 times [2025-04-13 23:32:26,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:26,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702944862] [2025-04-13 23:32:26,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:26,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:26,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:32:26,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:32:26,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:26,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:26,175 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 23:32:26,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:26,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702944862] [2025-04-13 23:32:26,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702944862] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:26,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:26,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:32:26,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627866910] [2025-04-13 23:32:26,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:26,176 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:32:26,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:26,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:32:26,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:32:26,176 INFO L87 Difference]: Start difference. First operand 53240 states and 298315 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:32:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:27,094 INFO L93 Difference]: Finished difference Result 53240 states and 298315 transitions. [2025-04-13 23:32:27,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:32:27,100 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:32:27,100 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:27,536 INFO L225 Difference]: With dead ends: 53240 [2025-04-13 23:32:27,537 INFO L226 Difference]: Without dead ends: 53212 [2025-04-13 23:32:27,558 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 23:32:27,558 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 40 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:27,558 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:32:27,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53212 states. [2025-04-13 23:32:29,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53212 to 53212. [2025-04-13 23:32:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53212 states, 53206 states have (on average 5.605570800285682) internal successors, (298250), 53211 states have internal predecessors, (298250), 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 23:32:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53212 states to 53212 states and 298250 transitions. [2025-04-13 23:32:29,799 INFO L79 Accepts]: Start accepts. Automaton has 53212 states and 298250 transitions. Word has length 8 [2025-04-13 23:32:29,799 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:29,799 INFO L485 AbstractCegarLoop]: Abstraction has 53212 states and 298250 transitions. [2025-04-13 23:32:29,799 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:32:29,800 INFO L278 IsEmpty]: Start isEmpty. Operand 53212 states and 298250 transitions. [2025-04-13 23:32:29,800 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 23:32:29,800 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:29,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:29,800 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 23:32:29,800 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-13 23:32:29,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:29,801 INFO L85 PathProgramCache]: Analyzing trace with hash 794117664, now seen corresponding path program 1 times [2025-04-13 23:32:29,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:29,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68182735] [2025-04-13 23:32:29,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:29,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:29,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:32:29,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:32:29,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:29,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:29,876 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 23:32:29,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:29,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68182735] [2025-04-13 23:32:29,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68182735] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:29,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:29,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:32:29,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621824377] [2025-04-13 23:32:29,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:29,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:32:29,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:29,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:32:29,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:32:29,877 INFO L87 Difference]: Start difference. First operand 53212 states and 298250 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 23:32:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:31,430 INFO L93 Difference]: Finished difference Result 75036 states and 423818 transitions. [2025-04-13 23:32:31,431 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:32:31,431 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2025-04-13 23:32:31,431 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:31,888 INFO L225 Difference]: With dead ends: 75036 [2025-04-13 23:32:31,888 INFO L226 Difference]: Without dead ends: 64124 [2025-04-13 23:32:31,923 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:32:31,924 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 46 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:31,924 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 2 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:32,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64124 states. [2025-04-13 23:32:34,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64124 to 64124. [2025-04-13 23:32:34,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64124 states, 64118 states have (on average 5.630774509498113) internal successors, (361034), 64123 states have internal predecessors, (361034), 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 23:32:34,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64124 states to 64124 states and 361034 transitions. [2025-04-13 23:32:34,889 INFO L79 Accepts]: Start accepts. Automaton has 64124 states and 361034 transitions. Word has length 10 [2025-04-13 23:32:34,889 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:34,889 INFO L485 AbstractCegarLoop]: Abstraction has 64124 states and 361034 transitions. [2025-04-13 23:32:34,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 23:32:34,889 INFO L278 IsEmpty]: Start isEmpty. Operand 64124 states and 361034 transitions. [2025-04-13 23:32:34,890 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 23:32:34,890 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:34,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:34,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 23:32:34,890 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-13 23:32:34,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:34,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1152155820, now seen corresponding path program 1 times [2025-04-13 23:32:34,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:34,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827781896] [2025-04-13 23:32:34,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:34,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:34,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:32:34,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:32:34,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:34,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:34,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:32:34,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:34,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827781896] [2025-04-13 23:32:34,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827781896] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:34,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:34,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:32:34,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119250713] [2025-04-13 23:32:34,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:34,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:32:34,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:34,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:32:34,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:32:34,923 INFO L87 Difference]: Start difference. First operand 64124 states and 361034 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 23:32:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:36,191 INFO L93 Difference]: Finished difference Result 64124 states and 361034 transitions. [2025-04-13 23:32:36,192 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:32:36,192 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-04-13 23:32:36,192 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:36,852 INFO L225 Difference]: With dead ends: 64124 [2025-04-13 23:32:36,853 INFO L226 Difference]: Without dead ends: 63980 [2025-04-13 23:32:36,872 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:32:36,873 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 56 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:36,873 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 2 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:36,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63980 states. [2025-04-13 23:32:38,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63980 to 63980. [2025-04-13 23:32:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63980 states, 63975 states have (on average 5.636483001172333) internal successors, (360594), 63979 states have internal predecessors, (360594), 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 23:32:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63980 states to 63980 states and 360594 transitions. [2025-04-13 23:32:39,462 INFO L79 Accepts]: Start accepts. Automaton has 63980 states and 360594 transitions. Word has length 11 [2025-04-13 23:32:39,462 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:39,462 INFO L485 AbstractCegarLoop]: Abstraction has 63980 states and 360594 transitions. [2025-04-13 23:32:39,462 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 23:32:39,462 INFO L278 IsEmpty]: Start isEmpty. Operand 63980 states and 360594 transitions. [2025-04-13 23:32:39,463 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 23:32:39,463 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:39,463 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:39,464 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 23:32:39,464 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-13 23:32:39,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:39,464 INFO L85 PathProgramCache]: Analyzing trace with hash -171136607, now seen corresponding path program 1 times [2025-04-13 23:32:39,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:39,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061800399] [2025-04-13 23:32:39,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:39,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:39,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 23:32:39,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 23:32:39,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:39,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:32:39,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:39,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061800399] [2025-04-13 23:32:39,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061800399] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:39,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:39,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:32:39,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292007726] [2025-04-13 23:32:39,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:39,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:32:39,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:39,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:32:39,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:32:39,521 INFO L87 Difference]: Start difference. First operand 63980 states and 360594 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 23:32:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:40,986 INFO L93 Difference]: Finished difference Result 63980 states and 360594 transitions. [2025-04-13 23:32:40,986 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:32:40,987 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2025-04-13 23:32:40,987 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:41,514 INFO L225 Difference]: With dead ends: 63980 [2025-04-13 23:32:41,514 INFO L226 Difference]: Without dead ends: 63404 [2025-04-13 23:32:41,538 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:32:41,543 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 75 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:41,543 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 3 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63404 states. [2025-04-13 23:32:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63404 to 63404. [2025-04-13 23:32:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63404 states, 63400 states have (on average 5.653028391167193) internal successors, (358402), 63403 states have internal predecessors, (358402), 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 23:32:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63404 states to 63404 states and 358402 transitions. [2025-04-13 23:32:44,550 INFO L79 Accepts]: Start accepts. Automaton has 63404 states and 358402 transitions. Word has length 13 [2025-04-13 23:32:44,550 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:44,550 INFO L485 AbstractCegarLoop]: Abstraction has 63404 states and 358402 transitions. [2025-04-13 23:32:44,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 23:32:44,550 INFO L278 IsEmpty]: Start isEmpty. Operand 63404 states and 358402 transitions. [2025-04-13 23:32:44,553 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 23:32:44,553 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:44,553 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:44,553 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 23:32:44,553 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-13 23:32:44,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:44,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2019118413, now seen corresponding path program 1 times [2025-04-13 23:32:44,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:44,554 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967932041] [2025-04-13 23:32:44,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:44,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:44,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:32:44,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:32:44,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:44,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:32:44,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:44,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967932041] [2025-04-13 23:32:44,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967932041] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:44,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:44,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:32:44,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023678053] [2025-04-13 23:32:44,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:44,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:32:44,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:44,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:32:44,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:32:44,604 INFO L87 Difference]: Start difference. First operand 63404 states and 358402 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 23:32:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:45,834 INFO L93 Difference]: Finished difference Result 63404 states and 358402 transitions. [2025-04-13 23:32:45,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:32:45,834 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2025-04-13 23:32:45,834 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:46,349 INFO L225 Difference]: With dead ends: 63404 [2025-04-13 23:32:46,349 INFO L226 Difference]: Without dead ends: 61100 [2025-04-13 23:32:46,370 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:32:46,370 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 109 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:46,370 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 3 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:32:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61100 states. [2025-04-13 23:32:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61100 to 61100. [2025-04-13 23:32:48,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61100 states, 61097 states have (on average 5.694322143476766) internal successors, (347906), 61099 states have internal predecessors, (347906), 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 23:32:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61100 states to 61100 states and 347906 transitions. [2025-04-13 23:32:48,663 INFO L79 Accepts]: Start accepts. Automaton has 61100 states and 347906 transitions. Word has length 15 [2025-04-13 23:32:48,663 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:48,663 INFO L485 AbstractCegarLoop]: Abstraction has 61100 states and 347906 transitions. [2025-04-13 23:32:48,663 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 23:32:48,663 INFO L278 IsEmpty]: Start isEmpty. Operand 61100 states and 347906 transitions. [2025-04-13 23:32:48,667 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:32:48,667 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:48,667 INFO L218 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:48,667 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 23:32:48,667 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-13 23:32:48,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:48,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1863925847, now seen corresponding path program 1 times [2025-04-13 23:32:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:48,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523868118] [2025-04-13 23:32:48,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:48,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:32:48,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:32:48,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:48,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:32:48,683 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:32:48,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:32:48,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:32:48,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:48,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:32:48,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:32:48,698 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:32:48,698 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-04-13 23:32:48,698 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 9 remaining) [2025-04-13 23:32:48,698 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2025-04-13 23:32:48,698 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2025-04-13 23:32:48,698 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 9 remaining) [2025-04-13 23:32:48,698 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 9 remaining) [2025-04-13 23:32:48,698 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2025-04-13 23:32:48,698 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2025-04-13 23:32:48,698 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2025-04-13 23:32:48,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 23:32:48,699 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:48,699 WARN L247 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:32:48,699 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-04-13 23:32:48,730 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:32:48,733 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 72 transitions, 284 flow [2025-04-13 23:32:56,670 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 212991 states, 212982 states have (on average 6.352865500370924) internal successors, (1353046), 212990 states have internal predecessors, (1353046), 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 23:32:56,672 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:32:56,672 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;@51c72afd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:32:56,673 INFO L341 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-04-13 23:32:57,029 INFO L278 IsEmpty]: Start isEmpty. Operand has 212991 states, 212982 states have (on average 6.352865500370924) internal successors, (1353046), 212990 states have internal predecessors, (1353046), 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 23:32:57,029 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 23:32:57,029 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:57,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:32:57,030 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 23:32:57,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:57,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1025322405, now seen corresponding path program 1 times [2025-04-13 23:32:57,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:57,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045613582] [2025-04-13 23:32:57,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:32:57,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:57,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:32:57,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:32:57,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:57,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:57,041 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 23:32:57,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:57,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045613582] [2025-04-13 23:32:57,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045613582] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:57,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:57,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:32:57,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680604578] [2025-04-13 23:32:57,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:57,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:32:57,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:57,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:32:57,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:32:57,396 INFO L87 Difference]: Start difference. First operand has 212991 states, 212982 states have (on average 6.352865500370924) internal successors, (1353046), 212990 states have internal predecessors, (1353046), 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, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 23:33:00,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:00,957 INFO L93 Difference]: Finished difference Result 212991 states and 1353046 transitions. [2025-04-13 23:33:00,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:33:00,957 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-04-13 23:33:00,957 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:03,282 INFO L225 Difference]: With dead ends: 212991 [2025-04-13 23:33:03,282 INFO L226 Difference]: Without dead ends: 212984 [2025-04-13 23:33:03,351 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 23:33:03,351 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:03,351 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:33:04,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212984 states. [2025-04-13 23:33:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212984 to 212984. [2025-04-13 23:33:11,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212984 states, 212976 states have (on average 6.3529928254826835) internal successors, (1353035), 212983 states have internal predecessors, (1353035), 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 23:33:13,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212984 states to 212984 states and 1353035 transitions. [2025-04-13 23:33:13,753 INFO L79 Accepts]: Start accepts. Automaton has 212984 states and 1353035 transitions. Word has length 6 [2025-04-13 23:33:13,753 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:13,753 INFO L485 AbstractCegarLoop]: Abstraction has 212984 states and 1353035 transitions. [2025-04-13 23:33:13,754 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 23:33:13,754 INFO L278 IsEmpty]: Start isEmpty. Operand 212984 states and 1353035 transitions. [2025-04-13 23:33:13,754 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 23:33:13,754 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:13,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:13,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 23:33:13,754 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 23:33:13,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:13,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1750331645, now seen corresponding path program 1 times [2025-04-13 23:33:13,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:13,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881717486] [2025-04-13 23:33:13,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:33:13,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:13,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:33:13,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:33:13,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:33:13,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:13,781 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 23:33:13,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:13,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881717486] [2025-04-13 23:33:13,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881717486] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:13,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:13,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:33:13,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348171320] [2025-04-13 23:33:13,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:13,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:33:13,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:13,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:33:13,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:33:13,782 INFO L87 Difference]: Start difference. First operand 212984 states and 1353035 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:33:17,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:17,507 INFO L93 Difference]: Finished difference Result 212984 states and 1353035 transitions. [2025-04-13 23:33:17,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:33:17,512 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:33:17,512 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:20,478 INFO L225 Difference]: With dead ends: 212984 [2025-04-13 23:33:20,482 INFO L226 Difference]: Without dead ends: 212956 [2025-04-13 23:33:20,563 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 23:33:20,564 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 44 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:20,564 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 2 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:33:21,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212956 states. [2025-04-13 23:33:29,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212956 to 212956. [2025-04-13 23:33:29,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212956 states, 212949 states have (on average 6.353493089894764) internal successors, (1352970), 212955 states have internal predecessors, (1352970), 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 23:33:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212956 states to 212956 states and 1352970 transitions. [2025-04-13 23:33:32,154 INFO L79 Accepts]: Start accepts. Automaton has 212956 states and 1352970 transitions. Word has length 8 [2025-04-13 23:33:32,154 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:32,154 INFO L485 AbstractCegarLoop]: Abstraction has 212956 states and 1352970 transitions. [2025-04-13 23:33:32,155 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 23:33:32,155 INFO L278 IsEmpty]: Start isEmpty. Operand 212956 states and 1352970 transitions. [2025-04-13 23:33:32,156 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 23:33:32,156 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:32,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:32,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 23:33:32,156 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-13 23:33:32,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:32,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1594534442, now seen corresponding path program 1 times [2025-04-13 23:33:32,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:32,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078217980] [2025-04-13 23:33:32,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:33:32,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:32,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:33:32,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:33:32,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:33:32,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:32,187 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 23:33:32,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:32,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078217980] [2025-04-13 23:33:32,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078217980] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:32,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:32,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:33:32,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759935158] [2025-04-13 23:33:32,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:32,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:33:32,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:32,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:33:32,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:33:32,188 INFO L87 Difference]: Start difference. First operand 212956 states and 1352970 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 23:33:38,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:38,452 INFO L93 Difference]: Finished difference Result 300316 states and 1920906 transitions. [2025-04-13 23:33:38,456 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:33:38,456 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2025-04-13 23:33:38,457 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:42,266 INFO L225 Difference]: With dead ends: 300316 [2025-04-13 23:33:42,266 INFO L226 Difference]: Without dead ends: 256636 [2025-04-13 23:33:42,410 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 23:33:42,411 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 54 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:42,411 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:33:43,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256636 states.