/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:11:47,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:11:47,570 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 17:11:47,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:11:47,576 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:11:47,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:11:47,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:11:47,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:11:47,600 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:11:47,600 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:11:47,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:11:47,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:11:47,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:11:47,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:11:47,602 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:11:47,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:11:47,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:11:47,602 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:11:47,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:11:47,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:11:47,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:11:47,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:11:47,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:11:47,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:11:47,603 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:11:47,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:11:47,603 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:11:47,603 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:11:47,603 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:11:47,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:11:47,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:11:47,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:11:47,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:11:47,604 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:11:47,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:11:47,604 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:11:47,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:11:47,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:11:47,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:11:47,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:11:47,604 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:11:47,604 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:11:47,604 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:11:47,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:11:47,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:11:47,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:11:47,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:11:47,604 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 [2025-04-13 17:11:47,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:11:47,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:11:47,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:11:47,819 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:11:47,819 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:11:47,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2025-04-13 17:11:49,085 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7917905b2/6fc370c50cd044d5bcf0fc8548c33049/FLAGcd9b036e9 [2025-04-13 17:11:49,326 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:11:49,326 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2025-04-13 17:11:49,341 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7917905b2/6fc370c50cd044d5bcf0fc8548c33049/FLAGcd9b036e9 [2025-04-13 17:11:50,286 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7917905b2/6fc370c50cd044d5bcf0fc8548c33049 [2025-04-13 17:11:50,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:11:50,289 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:11:50,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:11:50,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:11:50,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:11:50,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:11:50" (1/1) ... [2025-04-13 17:11:50,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40444abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:11:50, skipping insertion in model container [2025-04-13 17:11:50,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:11:50" (1/1) ... [2025-04-13 17:11:50,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:11:50,577 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-ext/45_monabsex1_vs.i[30633,30646] [2025-04-13 17:11:50,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:11:50,593 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:11:50,638 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-ext/45_monabsex1_vs.i[30633,30646] [2025-04-13 17:11:50,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:11:50,659 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:11:50,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:11:50 WrapperNode [2025-04-13 17:11:50,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:11:50,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:11:50,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:11:50,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:11:50,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:11:50" (1/1) ... [2025-04-13 17:11:50,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:11:50" (1/1) ... [2025-04-13 17:11:50,687 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2025-04-13 17:11:50,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:11:50,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:11:50,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:11:50,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:11:50,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:11:50" (1/1) ... [2025-04-13 17:11:50,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:11:50" (1/1) ... [2025-04-13 17:11:50,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:11:50" (1/1) ... [2025-04-13 17:11:50,702 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 17:11:50,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:11:50" (1/1) ... [2025-04-13 17:11:50,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:11:50" (1/1) ... [2025-04-13 17:11:50,704 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:11:50" (1/1) ... [2025-04-13 17:11:50,704 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:11:50" (1/1) ... [2025-04-13 17:11:50,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:11:50" (1/1) ... [2025-04-13 17:11:50,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:11:50" (1/1) ... [2025-04-13 17:11:50,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:11:50" (1/1) ... [2025-04-13 17:11:50,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:11:50,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:11:50,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:11:50,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:11:50,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:11:50" (1/1) ... [2025-04-13 17:11:50,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:11:50,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:11:50,735 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 17:11:50,737 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 17:11:50,757 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 17:11:50,758 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 17:11:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 17:11:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:11:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:11:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 17:11:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:11:50,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:11:50,759 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 17:11:50,842 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:11:50,843 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:11:50,901 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:11:50,902 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:11:50,902 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:11:50,949 INFO L313 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-13 17:11:50,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:11:50 BoogieIcfgContainer [2025-04-13 17:11:50,950 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:11:50,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:11:50,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:11:50,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:11:50,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:11:50" (1/3) ... [2025-04-13 17:11:50,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ec65f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:11:50, skipping insertion in model container [2025-04-13 17:11:50,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:11:50" (2/3) ... [2025-04-13 17:11:50,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ec65f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:11:50, skipping insertion in model container [2025-04-13 17:11:50,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:11:50" (3/3) ... [2025-04-13 17:11:50,957 INFO L128 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2025-04-13 17:11:50,966 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:11:50,968 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 45_monabsex1_vs.i that has 2 procedures, 10 locations, 9 edges, 1 initial locations, 1 loop locations, and 1 error locations. [2025-04-13 17:11:50,968 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:11:50,991 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:11:51,018 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 13 places, 10 transitions, 24 flow [2025-04-13 17:11:51,028 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 25 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 24 states have internal predecessors, (37), 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 17:11:51,046 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:11:51,054 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;@3a8c6be9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:11:51,054 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 17:11:51,056 INFO L278 IsEmpty]: Start isEmpty. Operand has 25 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 24 states have internal predecessors, (37), 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 17:11:51,058 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 17:11:51,058 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:11:51,059 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1] [2025-04-13 17:11:51,059 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 17:11:51,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:11:51,062 INFO L85 PathProgramCache]: Analyzing trace with hash 110648394, now seen corresponding path program 1 times [2025-04-13 17:11:51,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:11:51,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077611623] [2025-04-13 17:11:51,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:11:51,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:11:51,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 17:11:51,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 17:11:51,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:11:51,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:11:51,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:11:51,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 17:11:51,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 17:11:51,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:11:51,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:11:51,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:11:51,150 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:11:51,150 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 17:11:51,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 17:11:51,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 17:11:51,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:11:51,157 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 17:11:51,159 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:11:51,159 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 17:11:51,175 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:11:51,177 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 21 places, 16 transitions, 42 flow [2025-04-13 17:11:51,190 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 159 states, 151 states have (on average 2.437086092715232) internal successors, (368), 158 states have internal predecessors, (368), 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 17:11:51,191 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:11:51,192 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;@3a8c6be9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:11:51,192 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 17:11:51,192 INFO L278 IsEmpty]: Start isEmpty. Operand has 159 states, 151 states have (on average 2.437086092715232) internal successors, (368), 158 states have internal predecessors, (368), 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 17:11:51,193 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 17:11:51,193 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:11:51,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 17:11:51,193 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 17:11:51,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:11:51,193 INFO L85 PathProgramCache]: Analyzing trace with hash -391373094, now seen corresponding path program 1 times [2025-04-13 17:11:51,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:11:51,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893367576] [2025-04-13 17:11:51,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:11:51,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:11:51,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 17:11:51,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 17:11:51,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:11:51,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:11:51,257 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 17:11:51,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:11:51,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893367576] [2025-04-13 17:11:51,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893367576] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:11:51,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:11:51,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:11:51,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638435856] [2025-04-13 17:11:51,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:11:51,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:11:51,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:11:51,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:11:51,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:11:51,273 INFO L87 Difference]: Start difference. First operand has 159 states, 151 states have (on average 2.437086092715232) internal successors, (368), 158 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 17:11:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:11:51,368 INFO L93 Difference]: Finished difference Result 207 states and 484 transitions. [2025-04-13 17:11:51,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:11:51,370 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 17:11:51,370 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:11:51,375 INFO L225 Difference]: With dead ends: 207 [2025-04-13 17:11:51,376 INFO L226 Difference]: Without dead ends: 151 [2025-04-13 17:11:51,377 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 17:11:51,378 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:11:51,379 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:11:51,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-04-13 17:11:51,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 127. [2025-04-13 17:11:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 123 states have (on average 2.3252032520325203) internal successors, (286), 126 states have internal predecessors, (286), 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 17:11:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 286 transitions. [2025-04-13 17:11:51,408 INFO L79 Accepts]: Start accepts. Automaton has 127 states and 286 transitions. Word has length 6 [2025-04-13 17:11:51,408 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:11:51,408 INFO L485 AbstractCegarLoop]: Abstraction has 127 states and 286 transitions. [2025-04-13 17:11:51,408 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 17:11:51,408 INFO L278 IsEmpty]: Start isEmpty. Operand 127 states and 286 transitions. [2025-04-13 17:11:51,408 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 17:11:51,408 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:11:51,408 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2025-04-13 17:11:51,409 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:11:51,409 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 17:11:51,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:11:51,409 INFO L85 PathProgramCache]: Analyzing trace with hash 752043573, now seen corresponding path program 1 times [2025-04-13 17:11:51,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:11:51,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965618105] [2025-04-13 17:11:51,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:11:51,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:11:51,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 17:11:51,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 17:11:51,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:11:51,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:11:51,421 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:11:51,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 17:11:51,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 17:11:51,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:11:51,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:11:51,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:11:51,430 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:11:51,430 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 17:11:51,430 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 17:11:51,430 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 17:11:51,430 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 17:11:51,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:11:51,431 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 17:11:51,431 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:11:51,431 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 17:11:51,442 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:11:51,443 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 22 transitions, 62 flow [2025-04-13 17:11:51,485 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 979 states, 960 states have (on average 3.2125) internal successors, (3084), 978 states have internal predecessors, (3084), 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 17:11:51,486 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:11:51,488 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;@3a8c6be9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:11:51,488 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 17:11:51,490 INFO L278 IsEmpty]: Start isEmpty. Operand has 979 states, 960 states have (on average 3.2125) internal successors, (3084), 978 states have internal predecessors, (3084), 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 17:11:51,490 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 17:11:51,490 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:11:51,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 17:11:51,490 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 17:11:51,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:11:51,491 INFO L85 PathProgramCache]: Analyzing trace with hash 259611893, now seen corresponding path program 1 times [2025-04-13 17:11:51,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:11:51,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119201634] [2025-04-13 17:11:51,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:11:51,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:11:51,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 17:11:51,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 17:11:51,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:11:51,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:11:51,540 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 17:11:51,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:11:51,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119201634] [2025-04-13 17:11:51,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119201634] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:11:51,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:11:51,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:11:51,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629962890] [2025-04-13 17:11:51,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:11:51,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:11:51,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:11:51,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:11:51,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:11:51,544 INFO L87 Difference]: Start difference. First operand has 979 states, 960 states have (on average 3.2125) internal successors, (3084), 978 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 17:11:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:11:51,623 INFO L93 Difference]: Finished difference Result 1395 states and 4464 transitions. [2025-04-13 17:11:51,623 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:11:51,623 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 17:11:51,624 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:11:51,637 INFO L225 Difference]: With dead ends: 1395 [2025-04-13 17:11:51,637 INFO L226 Difference]: Without dead ends: 1029 [2025-04-13 17:11:51,639 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 17:11:51,639 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:11:51,639 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:11:51,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-04-13 17:11:51,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 821. [2025-04-13 17:11:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 813 states have (on average 3.132841328413284) internal successors, (2547), 820 states have internal predecessors, (2547), 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 17:11:51,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2547 transitions. [2025-04-13 17:11:51,695 INFO L79 Accepts]: Start accepts. Automaton has 821 states and 2547 transitions. Word has length 6 [2025-04-13 17:11:51,695 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:11:51,695 INFO L485 AbstractCegarLoop]: Abstraction has 821 states and 2547 transitions. [2025-04-13 17:11:51,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 17:11:51,696 INFO L278 IsEmpty]: Start isEmpty. Operand 821 states and 2547 transitions. [2025-04-13 17:11:51,696 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 17:11:51,696 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:11:51,696 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 17:11:51,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:11:51,697 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 17:11:51,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:11:51,697 INFO L85 PathProgramCache]: Analyzing trace with hash 370025796, now seen corresponding path program 1 times [2025-04-13 17:11:51,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:11:51,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442035106] [2025-04-13 17:11:51,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:11:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:11:51,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 17:11:51,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 17:11:51,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:11:51,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:11:51,727 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 17:11:51,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:11:51,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442035106] [2025-04-13 17:11:51,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442035106] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:11:51,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:11:51,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:11:51,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496145887] [2025-04-13 17:11:51,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:11:51,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:11:51,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:11:51,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:11:51,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:11:51,729 INFO L87 Difference]: Start difference. First operand 821 states and 2547 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 17:11:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:11:51,819 INFO L93 Difference]: Finished difference Result 1233 states and 3754 transitions. [2025-04-13 17:11:51,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:11:51,820 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 17:11:51,820 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:11:51,826 INFO L225 Difference]: With dead ends: 1233 [2025-04-13 17:11:51,826 INFO L226 Difference]: Without dead ends: 1093 [2025-04-13 17:11:51,828 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 17:11:51,828 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:11:51,829 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:11:51,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2025-04-13 17:11:51,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 877. [2025-04-13 17:11:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 869 states have (on average 3.1265822784810124) internal successors, (2717), 876 states have internal predecessors, (2717), 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 17:11:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 2717 transitions. [2025-04-13 17:11:51,867 INFO L79 Accepts]: Start accepts. Automaton has 877 states and 2717 transitions. Word has length 8 [2025-04-13 17:11:51,867 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:11:51,867 INFO L485 AbstractCegarLoop]: Abstraction has 877 states and 2717 transitions. [2025-04-13 17:11:51,867 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 17:11:51,867 INFO L278 IsEmpty]: Start isEmpty. Operand 877 states and 2717 transitions. [2025-04-13 17:11:51,868 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 17:11:51,868 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:11:51,868 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2025-04-13 17:11:51,868 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:11:51,868 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 17:11:51,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:11:51,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1414542735, now seen corresponding path program 1 times [2025-04-13 17:11:51,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:11:51,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127151330] [2025-04-13 17:11:51,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:11:51,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:11:51,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 17:11:51,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 17:11:51,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:11:51,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:11:51,887 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:11:51,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 17:11:51,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 17:11:51,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:11:51,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:11:51,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:11:51,899 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:11:51,899 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 17:11:51,900 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 17:11:51,900 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 17:11:51,900 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 17:11:51,900 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 17:11:51,900 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 17:11:51,900 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 17:11:51,900 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:11:51,900 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 17:11:51,916 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:11:51,920 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 84 flow [2025-04-13 17:11:52,085 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5931 states, 5889 states have (on average 4.012905416878927) internal successors, (23632), 5930 states have internal predecessors, (23632), 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 17:11:52,088 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:11:52,088 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;@3a8c6be9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:11:52,088 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 17:11:52,108 INFO L278 IsEmpty]: Start isEmpty. Operand has 5931 states, 5889 states have (on average 4.012905416878927) internal successors, (23632), 5930 states have internal predecessors, (23632), 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 17:11:52,109 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 17:11:52,109 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:11:52,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 17:11:52,109 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:11:52,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:11:52,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1088102581, now seen corresponding path program 1 times [2025-04-13 17:11:52,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:11:52,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403352947] [2025-04-13 17:11:52,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:11:52,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:11:52,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 17:11:52,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 17:11:52,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:11:52,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:11:52,133 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 17:11:52,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:11:52,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403352947] [2025-04-13 17:11:52,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403352947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:11:52,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:11:52,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:11:52,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177577248] [2025-04-13 17:11:52,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:11:52,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:11:52,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:11:52,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:11:52,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:11:52,152 INFO L87 Difference]: Start difference. First operand has 5931 states, 5889 states have (on average 4.012905416878927) internal successors, (23632), 5930 states have internal predecessors, (23632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 17:11:52,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:11:52,388 INFO L93 Difference]: Finished difference Result 8715 states and 35252 transitions. [2025-04-13 17:11:52,388 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:11:52,389 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 17:11:52,389 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:11:52,442 INFO L225 Difference]: With dead ends: 8715 [2025-04-13 17:11:52,442 INFO L226 Difference]: Without dead ends: 6457 [2025-04-13 17:11:52,447 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 17:11:52,449 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:11:52,449 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 10 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:11:52,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6457 states. [2025-04-13 17:11:52,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6457 to 5065. [2025-04-13 17:11:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5065 states, 5049 states have (on average 3.953852247969895) internal successors, (19963), 5064 states have internal predecessors, (19963), 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 17:11:52,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5065 states to 5065 states and 19963 transitions. [2025-04-13 17:11:52,691 INFO L79 Accepts]: Start accepts. Automaton has 5065 states and 19963 transitions. Word has length 6 [2025-04-13 17:11:52,692 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:11:52,692 INFO L485 AbstractCegarLoop]: Abstraction has 5065 states and 19963 transitions. [2025-04-13 17:11:52,692 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 17:11:52,693 INFO L278 IsEmpty]: Start isEmpty. Operand 5065 states and 19963 transitions. [2025-04-13 17:11:52,694 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 17:11:52,694 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:11:52,694 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 17:11:52,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 17:11:52,694 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:11:52,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:11:52,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1976010655, now seen corresponding path program 1 times [2025-04-13 17:11:52,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:11:52,694 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587792280] [2025-04-13 17:11:52,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:11:52,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:11:52,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 17:11:52,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 17:11:52,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:11:52,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:11:52,730 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 17:11:52,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:11:52,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587792280] [2025-04-13 17:11:52,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587792280] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:11:52,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:11:52,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:11:52,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760212566] [2025-04-13 17:11:52,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:11:52,731 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:11:52,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:11:52,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:11:52,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:11:52,732 INFO L87 Difference]: Start difference. First operand 5065 states and 19963 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 17:11:52,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:11:52,921 INFO L93 Difference]: Finished difference Result 8071 states and 31363 transitions. [2025-04-13 17:11:52,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:11:52,921 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 17:11:52,921 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:11:52,982 INFO L225 Difference]: With dead ends: 8071 [2025-04-13 17:11:52,982 INFO L226 Difference]: Without dead ends: 7217 [2025-04-13 17:11:52,987 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 17:11:52,988 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:11:52,988 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 10 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:11:53,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7217 states. [2025-04-13 17:11:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7217 to 5653. [2025-04-13 17:11:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5653 states, 5637 states have (on average 3.9625687422387794) internal successors, (22337), 5652 states have internal predecessors, (22337), 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 17:11:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5653 states to 5653 states and 22337 transitions. [2025-04-13 17:11:53,276 INFO L79 Accepts]: Start accepts. Automaton has 5653 states and 22337 transitions. Word has length 8 [2025-04-13 17:11:53,276 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:11:53,276 INFO L485 AbstractCegarLoop]: Abstraction has 5653 states and 22337 transitions. [2025-04-13 17:11:53,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 17:11:53,277 INFO L278 IsEmpty]: Start isEmpty. Operand 5653 states and 22337 transitions. [2025-04-13 17:11:53,277 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 17:11:53,277 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:11:53,277 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:11:53,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 17:11:53,277 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:11:53,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:11:53,279 INFO L85 PathProgramCache]: Analyzing trace with hash 231680111, now seen corresponding path program 1 times [2025-04-13 17:11:53,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:11:53,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631635338] [2025-04-13 17:11:53,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:11:53,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:11:53,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 17:11:53,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 17:11:53,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:11:53,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:11:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:11:53,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:11:53,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631635338] [2025-04-13 17:11:53,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631635338] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:11:53,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:11:53,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:11:53,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570084818] [2025-04-13 17:11:53,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:11:53,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:11:53,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:11:53,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:11:53,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:11:53,353 INFO L87 Difference]: Start difference. First operand 5653 states and 22337 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 17:11:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:11:53,859 INFO L93 Difference]: Finished difference Result 13943 states and 53049 transitions. [2025-04-13 17:11:53,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:11:53,861 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 17:11:53,861 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:11:53,931 INFO L225 Difference]: With dead ends: 13943 [2025-04-13 17:11:53,931 INFO L226 Difference]: Without dead ends: 12899 [2025-04-13 17:11:53,939 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:11:53,941 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 75 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:11:53,941 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 32 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:11:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12899 states. [2025-04-13 17:11:54,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12899 to 6453. [2025-04-13 17:11:54,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6453 states, 6437 states have (on average 4.063849619387914) internal successors, (26159), 6452 states have internal predecessors, (26159), 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 17:11:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6453 states to 6453 states and 26159 transitions. [2025-04-13 17:11:54,336 INFO L79 Accepts]: Start accepts. Automaton has 6453 states and 26159 transitions. Word has length 10 [2025-04-13 17:11:54,336 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:11:54,336 INFO L485 AbstractCegarLoop]: Abstraction has 6453 states and 26159 transitions. [2025-04-13 17:11:54,336 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 17:11:54,336 INFO L278 IsEmpty]: Start isEmpty. Operand 6453 states and 26159 transitions. [2025-04-13 17:11:54,339 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 17:11:54,339 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:11:54,339 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:11:54,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 17:11:54,339 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:11:54,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:11:54,340 INFO L85 PathProgramCache]: Analyzing trace with hash 552421396, now seen corresponding path program 1 times [2025-04-13 17:11:54,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:11:54,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962011489] [2025-04-13 17:11:54,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:11:54,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:11:54,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 17:11:54,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 17:11:54,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:11:54,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:11:54,366 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 17:11:54,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:11:54,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962011489] [2025-04-13 17:11:54,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962011489] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:11:54,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:11:54,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:11:54,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549877417] [2025-04-13 17:11:54,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:11:54,367 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:11:54,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:11:54,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:11:54,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:11:54,367 INFO L87 Difference]: Start difference. First operand 6453 states and 26159 transitions. Second operand has 3 states, 2 states have (on average 4.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 17:11:54,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:11:54,662 INFO L93 Difference]: Finished difference Result 9993 states and 39792 transitions. [2025-04-13 17:11:54,662 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:11:54,662 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.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 10 [2025-04-13 17:11:54,662 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:11:54,705 INFO L225 Difference]: With dead ends: 9993 [2025-04-13 17:11:54,706 INFO L226 Difference]: Without dead ends: 8893 [2025-04-13 17:11:54,714 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 17:11:54,714 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:11:54,714 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 10 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:11:54,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8893 states. [2025-04-13 17:11:54,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8893 to 7013. [2025-04-13 17:11:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7013 states, 6997 states have (on average 4.054737744747749) internal successors, (28371), 7012 states have internal predecessors, (28371), 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 17:11:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7013 states to 7013 states and 28371 transitions. [2025-04-13 17:11:55,006 INFO L79 Accepts]: Start accepts. Automaton has 7013 states and 28371 transitions. Word has length 10 [2025-04-13 17:11:55,006 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:11:55,007 INFO L485 AbstractCegarLoop]: Abstraction has 7013 states and 28371 transitions. [2025-04-13 17:11:55,007 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.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 17:11:55,007 INFO L278 IsEmpty]: Start isEmpty. Operand 7013 states and 28371 transitions. [2025-04-13 17:11:55,007 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 17:11:55,008 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:11:55,008 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:11:55,008 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 17:11:55,008 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:11:55,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:11:55,008 INFO L85 PathProgramCache]: Analyzing trace with hash 570515579, now seen corresponding path program 2 times [2025-04-13 17:11:55,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:11:55,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486715668] [2025-04-13 17:11:55,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:11:55,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:11:55,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-04-13 17:11:55,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 17:11:55,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:11:55,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:11:55,052 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 17:11:55,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:11:55,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486715668] [2025-04-13 17:11:55,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486715668] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:11:55,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:11:55,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:11:55,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312148413] [2025-04-13 17:11:55,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:11:55,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:11:55,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:11:55,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:11:55,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:11:55,054 INFO L87 Difference]: Start difference. First operand 7013 states and 28371 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 17:11:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:11:55,493 INFO L93 Difference]: Finished difference Result 15085 states and 56903 transitions. [2025-04-13 17:11:55,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:11:55,494 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 17:11:55,494 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:11:55,559 INFO L225 Difference]: With dead ends: 15085 [2025-04-13 17:11:55,559 INFO L226 Difference]: Without dead ends: 13949 [2025-04-13 17:11:55,570 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:11:55,570 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 71 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:11:55,570 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 42 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:11:55,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13949 states. [2025-04-13 17:11:55,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13949 to 5831. [2025-04-13 17:11:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5831 states, 5815 states have (on average 3.9052450558899396) internal successors, (22709), 5830 states have internal predecessors, (22709), 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 17:11:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5831 states to 5831 states and 22709 transitions. [2025-04-13 17:11:55,899 INFO L79 Accepts]: Start accepts. Automaton has 5831 states and 22709 transitions. Word has length 10 [2025-04-13 17:11:55,900 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:11:55,900 INFO L485 AbstractCegarLoop]: Abstraction has 5831 states and 22709 transitions. [2025-04-13 17:11:55,900 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 17:11:55,900 INFO L278 IsEmpty]: Start isEmpty. Operand 5831 states and 22709 transitions. [2025-04-13 17:11:55,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 17:11:55,901 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:11:55,901 INFO L218 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2025-04-13 17:11:55,901 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 17:11:55,901 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:11:55,901 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:11:55,901 INFO L85 PathProgramCache]: Analyzing trace with hash -54932802, now seen corresponding path program 1 times [2025-04-13 17:11:55,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:11:55,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915158823] [2025-04-13 17:11:55,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:11:55,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:11:55,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 17:11:55,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 17:11:55,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:11:55,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:11:55,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:11:55,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 17:11:55,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 17:11:55,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:11:55,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:11:55,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:11:55,914 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:11:55,914 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 17:11:55,914 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 17:11:55,915 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 17:11:55,915 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 17:11:55,915 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 17:11:55,915 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 17:11:55,915 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 17:11:55,915 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2025-04-13 17:11:55,915 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:11:55,915 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 17:11:55,928 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:11:55,930 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 34 transitions, 108 flow [2025-04-13 17:11:56,793 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35707 states, 35618 states have (on average 4.830366668538379) internal successors, (172048), 35706 states have internal predecessors, (172048), 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 17:11:56,795 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:11:56,796 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;@3a8c6be9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:11:56,796 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 17:11:56,878 INFO L278 IsEmpty]: Start isEmpty. Operand has 35707 states, 35618 states have (on average 4.830366668538379) internal successors, (172048), 35706 states have internal predecessors, (172048), 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 17:11:56,878 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 17:11:56,878 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:11:56,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 17:11:56,879 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 17:11:56,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:11:56,879 INFO L85 PathProgramCache]: Analyzing trace with hash 2094084075, now seen corresponding path program 1 times [2025-04-13 17:11:56,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:11:56,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131965126] [2025-04-13 17:11:56,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:11:56,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:11:56,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 17:11:56,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 17:11:56,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:11:56,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:11:56,895 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 17:11:56,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:11:56,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131965126] [2025-04-13 17:11:56,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131965126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:11:56,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:11:56,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:11:56,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232487231] [2025-04-13 17:11:56,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:11:56,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:11:56,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:11:56,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:11:56,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:11:56,978 INFO L87 Difference]: Start difference. First operand has 35707 states, 35618 states have (on average 4.830366668538379) internal successors, (172048), 35706 states have internal predecessors, (172048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 17:11:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:11:57,844 INFO L93 Difference]: Finished difference Result 53019 states and 258900 transitions. [2025-04-13 17:11:57,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:11:57,844 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 17:11:57,844 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:11:58,201 INFO L225 Difference]: With dead ends: 53019 [2025-04-13 17:11:58,202 INFO L226 Difference]: Without dead ends: 39345 [2025-04-13 17:11:58,246 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 17:11:58,247 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:11:58,247 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 12 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:11:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39345 states. [2025-04-13 17:11:59,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39345 to 30689. [2025-04-13 17:11:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30689 states, 30657 states have (on average 4.781909514955801) internal successors, (146599), 30688 states have internal predecessors, (146599), 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 17:11:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30689 states to 30689 states and 146599 transitions. [2025-04-13 17:11:59,669 INFO L79 Accepts]: Start accepts. Automaton has 30689 states and 146599 transitions. Word has length 6 [2025-04-13 17:11:59,669 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:11:59,669 INFO L485 AbstractCegarLoop]: Abstraction has 30689 states and 146599 transitions. [2025-04-13 17:11:59,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 17:11:59,669 INFO L278 IsEmpty]: Start isEmpty. Operand 30689 states and 146599 transitions. [2025-04-13 17:11:59,669 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 17:11:59,669 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:11:59,670 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 17:11:59,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 17:11:59,670 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 17:11:59,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:11:59,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1933475994, now seen corresponding path program 1 times [2025-04-13 17:11:59,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:11:59,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284381249] [2025-04-13 17:11:59,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:11:59,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:11:59,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 17:11:59,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 17:11:59,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:11:59,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:11:59,696 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 17:11:59,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:11:59,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284381249] [2025-04-13 17:11:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284381249] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:11:59,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:11:59,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:11:59,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987408792] [2025-04-13 17:11:59,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:11:59,696 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:11:59,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:11:59,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:11:59,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:11:59,697 INFO L87 Difference]: Start difference. First operand 30689 states and 146599 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 17:12:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:00,505 INFO L93 Difference]: Finished difference Result 49899 states and 235647 transitions. [2025-04-13 17:12:00,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:12:00,505 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 17:12:00,505 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:00,801 INFO L225 Difference]: With dead ends: 49899 [2025-04-13 17:12:00,801 INFO L226 Difference]: Without dead ends: 44761 [2025-04-13 17:12:00,822 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 17:12:00,823 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:00,823 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 12 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:12:00,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44761 states. [2025-04-13 17:12:01,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44761 to 34789. [2025-04-13 17:12:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34789 states, 34757 states have (on average 4.796069856431798) internal successors, (166697), 34788 states have internal predecessors, (166697), 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 17:12:02,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34789 states to 34789 states and 166697 transitions. [2025-04-13 17:12:02,269 INFO L79 Accepts]: Start accepts. Automaton has 34789 states and 166697 transitions. Word has length 8 [2025-04-13 17:12:02,270 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:02,270 INFO L485 AbstractCegarLoop]: Abstraction has 34789 states and 166697 transitions. [2025-04-13 17:12:02,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 17:12:02,270 INFO L278 IsEmpty]: Start isEmpty. Operand 34789 states and 166697 transitions. [2025-04-13 17:12:02,271 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 17:12:02,271 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:02,271 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:12:02,271 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 17:12:02,271 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 17:12:02,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:02,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1330460106, now seen corresponding path program 1 times [2025-04-13 17:12:02,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:02,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425796172] [2025-04-13 17:12:02,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:02,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:02,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 17:12:02,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 17:12:02,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:02,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:02,326 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 17:12:02,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:02,326 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425796172] [2025-04-13 17:12:02,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425796172] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:02,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:02,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:12:02,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276282875] [2025-04-13 17:12:02,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:02,327 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:12:02,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:02,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:12:02,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:12:02,327 INFO L87 Difference]: Start difference. First operand 34789 states and 166697 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 17:12:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:04,234 INFO L93 Difference]: Finished difference Result 87547 states and 405861 transitions. [2025-04-13 17:12:04,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:12:04,234 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 17:12:04,234 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:04,847 INFO L225 Difference]: With dead ends: 87547 [2025-04-13 17:12:04,847 INFO L226 Difference]: Without dead ends: 81055 [2025-04-13 17:12:04,898 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:12:04,898 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 92 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:04,898 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 41 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:12:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81055 states. [2025-04-13 17:12:06,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81055 to 39813. [2025-04-13 17:12:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39813 states, 39781 states have (on average 4.902817928156658) internal successors, (195039), 39812 states have internal predecessors, (195039), 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 17:12:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39813 states to 39813 states and 195039 transitions. [2025-04-13 17:12:07,415 INFO L79 Accepts]: Start accepts. Automaton has 39813 states and 195039 transitions. Word has length 10 [2025-04-13 17:12:07,415 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:07,416 INFO L485 AbstractCegarLoop]: Abstraction has 39813 states and 195039 transitions. [2025-04-13 17:12:07,416 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 17:12:07,416 INFO L278 IsEmpty]: Start isEmpty. Operand 39813 states and 195039 transitions. [2025-04-13 17:12:07,416 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 17:12:07,416 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:07,416 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:12:07,416 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 17:12:07,416 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 17:12:07,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:07,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1646609775, now seen corresponding path program 1 times [2025-04-13 17:12:07,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:07,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777263207] [2025-04-13 17:12:07,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:07,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:07,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 17:12:07,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 17:12:07,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:07,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:07,455 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 17:12:07,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:07,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777263207] [2025-04-13 17:12:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777263207] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:07,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:07,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:12:07,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469674692] [2025-04-13 17:12:07,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:07,456 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:12:07,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:07,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:12:07,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:12:07,456 INFO L87 Difference]: Start difference. First operand 39813 states and 195039 transitions. Second operand has 3 states, 2 states have (on average 4.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 17:12:08,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:08,957 INFO L93 Difference]: Finished difference Result 63871 states and 308677 transitions. [2025-04-13 17:12:08,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:12:08,957 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.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 10 [2025-04-13 17:12:08,957 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:09,317 INFO L225 Difference]: With dead ends: 63871 [2025-04-13 17:12:09,317 INFO L226 Difference]: Without dead ends: 57161 [2025-04-13 17:12:09,356 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 17:12:09,356 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:09,357 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 12 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:12:09,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57161 states. [2025-04-13 17:12:11,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57161 to 44461. [2025-04-13 17:12:11,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44461 states, 44429 states have (on average 4.908573229197146) internal successors, (218083), 44460 states have internal predecessors, (218083), 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 17:12:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44461 states to 44461 states and 218083 transitions. [2025-04-13 17:12:11,770 INFO L79 Accepts]: Start accepts. Automaton has 44461 states and 218083 transitions. Word has length 10 [2025-04-13 17:12:11,770 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:11,770 INFO L485 AbstractCegarLoop]: Abstraction has 44461 states and 218083 transitions. [2025-04-13 17:12:11,770 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.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 17:12:11,770 INFO L278 IsEmpty]: Start isEmpty. Operand 44461 states and 218083 transitions. [2025-04-13 17:12:11,771 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 17:12:11,771 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:11,771 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:12:11,771 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 17:12:11,771 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 17:12:11,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:11,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1650538028, now seen corresponding path program 2 times [2025-04-13 17:12:11,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:11,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551295802] [2025-04-13 17:12:11,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:12:11,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:11,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-04-13 17:12:11,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 17:12:11,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:12:11,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:11,813 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 17:12:11,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:11,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551295802] [2025-04-13 17:12:11,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551295802] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:11,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:11,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:12:11,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967696612] [2025-04-13 17:12:11,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:11,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:12:11,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:11,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:12:11,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:12:11,814 INFO L87 Difference]: Start difference. First operand 44461 states and 218083 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 17:12:14,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:14,370 INFO L93 Difference]: Finished difference Result 98137 states and 452915 transitions. [2025-04-13 17:12:14,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:12:14,370 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 17:12:14,370 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:14,949 INFO L225 Difference]: With dead ends: 98137 [2025-04-13 17:12:14,949 INFO L226 Difference]: Without dead ends: 90899 [2025-04-13 17:12:14,997 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:12:14,998 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 88 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:14,998 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 54 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:12:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90899 states. [2025-04-13 17:12:17,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90899 to 37835. [2025-04-13 17:12:17,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37835 states, 37803 states have (on average 4.756262730471127) internal successors, (179801), 37834 states have internal predecessors, (179801), 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 17:12:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37835 states to 37835 states and 179801 transitions. [2025-04-13 17:12:17,515 INFO L79 Accepts]: Start accepts. Automaton has 37835 states and 179801 transitions. Word has length 10 [2025-04-13 17:12:17,516 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:17,516 INFO L485 AbstractCegarLoop]: Abstraction has 37835 states and 179801 transitions. [2025-04-13 17:12:17,516 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 17:12:17,516 INFO L278 IsEmpty]: Start isEmpty. Operand 37835 states and 179801 transitions. [2025-04-13 17:12:17,517 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 17:12:17,517 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:17,517 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:12:17,517 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 17:12:17,517 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 17:12:17,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:17,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1331896311, now seen corresponding path program 1 times [2025-04-13 17:12:17,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:17,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535841263] [2025-04-13 17:12:17,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:17,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:17,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 17:12:17,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 17:12:17,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:17,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:17,571 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 17:12:17,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:17,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535841263] [2025-04-13 17:12:17,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535841263] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:17,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:17,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:12:17,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923814683] [2025-04-13 17:12:17,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:17,572 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:12:17,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:17,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:12:17,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:12:17,572 INFO L87 Difference]: Start difference. First operand 37835 states and 179801 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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 17:12:20,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:20,635 INFO L93 Difference]: Finished difference Result 96929 states and 444903 transitions. [2025-04-13 17:12:20,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:12:20,635 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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 12 [2025-04-13 17:12:20,636 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:21,236 INFO L225 Difference]: With dead ends: 96929 [2025-04-13 17:12:21,237 INFO L226 Difference]: Without dead ends: 89897 [2025-04-13 17:12:21,276 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:12:21,277 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 92 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:21,277 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 41 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:12:21,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89897 states. [2025-04-13 17:12:23,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89897 to 43497. [2025-04-13 17:12:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43497 states, 43465 states have (on average 4.871206718049005) internal successors, (211727), 43496 states have internal predecessors, (211727), 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 17:12:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43497 states to 43497 states and 211727 transitions. [2025-04-13 17:12:23,706 INFO L79 Accepts]: Start accepts. Automaton has 43497 states and 211727 transitions. Word has length 12 [2025-04-13 17:12:23,706 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:23,706 INFO L485 AbstractCegarLoop]: Abstraction has 43497 states and 211727 transitions. [2025-04-13 17:12:23,706 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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 17:12:23,706 INFO L278 IsEmpty]: Start isEmpty. Operand 43497 states and 211727 transitions. [2025-04-13 17:12:23,707 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 17:12:23,707 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:23,707 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:12:23,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 17:12:23,707 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 17:12:23,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:23,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1843850731, now seen corresponding path program 2 times [2025-04-13 17:12:23,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:23,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095902759] [2025-04-13 17:12:23,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:12:23,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:23,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-13 17:12:23,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 17:12:23,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:12:23,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:23,750 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 17:12:23,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:23,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095902759] [2025-04-13 17:12:23,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095902759] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:23,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:23,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:12:23,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284604697] [2025-04-13 17:12:23,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:23,750 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:12:23,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:23,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:12:23,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:12:23,751 INFO L87 Difference]: Start difference. First operand 43497 states and 211727 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 17:12:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:26,986 INFO L93 Difference]: Finished difference Result 96227 states and 439773 transitions. [2025-04-13 17:12:26,986 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:12:26,987 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 12 [2025-04-13 17:12:26,987 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:27,723 INFO L225 Difference]: With dead ends: 96227 [2025-04-13 17:12:27,724 INFO L226 Difference]: Without dead ends: 89195 [2025-04-13 17:12:27,761 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:12:27,762 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 86 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:27,762 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 54 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:12:27,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89195 states. [2025-04-13 17:12:29,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89195 to 36637. [2025-04-13 17:12:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36637 states, 36605 states have (on average 4.741456085234257) internal successors, (173561), 36636 states have internal predecessors, (173561), 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 17:12:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36637 states to 36637 states and 173561 transitions. [2025-04-13 17:12:30,238 INFO L79 Accepts]: Start accepts. Automaton has 36637 states and 173561 transitions. Word has length 12 [2025-04-13 17:12:30,239 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:30,239 INFO L485 AbstractCegarLoop]: Abstraction has 36637 states and 173561 transitions. [2025-04-13 17:12:30,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 17:12:30,239 INFO L278 IsEmpty]: Start isEmpty. Operand 36637 states and 173561 transitions. [2025-04-13 17:12:30,239 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 17:12:30,239 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:30,239 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:12:30,240 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 17:12:30,240 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 17:12:30,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:30,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1844023406, now seen corresponding path program 1 times [2025-04-13 17:12:30,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:30,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345072536] [2025-04-13 17:12:30,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:30,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:30,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 17:12:30,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 17:12:30,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:30,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:30,293 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 17:12:30,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:30,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345072536] [2025-04-13 17:12:30,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345072536] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:30,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:30,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:12:30,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240719164] [2025-04-13 17:12:30,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:30,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:12:30,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:30,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:12:30,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:12:30,294 INFO L87 Difference]: Start difference. First operand 36637 states and 173561 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 17:12:33,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:33,760 INFO L93 Difference]: Finished difference Result 94019 states and 427965 transitions. [2025-04-13 17:12:33,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:12:33,760 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 12 [2025-04-13 17:12:33,760 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:34,289 INFO L225 Difference]: With dead ends: 94019 [2025-04-13 17:12:34,289 INFO L226 Difference]: Without dead ends: 87343 [2025-04-13 17:12:34,327 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:12:34,328 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 88 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:34,328 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 41 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:12:34,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87343 states. [2025-04-13 17:12:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87343 to 41325. [2025-04-13 17:12:36,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41325 states, 41293 states have (on average 4.834887269028649) internal successors, (199647), 41324 states have internal predecessors, (199647), 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 17:12:37,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41325 states to 41325 states and 199647 transitions. [2025-04-13 17:12:37,154 INFO L79 Accepts]: Start accepts. Automaton has 41325 states and 199647 transitions. Word has length 12 [2025-04-13 17:12:37,154 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:37,154 INFO L485 AbstractCegarLoop]: Abstraction has 41325 states and 199647 transitions. [2025-04-13 17:12:37,154 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 17:12:37,154 INFO L278 IsEmpty]: Start isEmpty. Operand 41325 states and 199647 transitions. [2025-04-13 17:12:37,155 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 17:12:37,155 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:37,156 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:12:37,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 17:12:37,156 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 17:12:37,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1830721714, now seen corresponding path program 1 times [2025-04-13 17:12:37,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:37,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45773334] [2025-04-13 17:12:37,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:37,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:37,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 17:12:37,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 17:12:37,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:37,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:37,177 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 17:12:37,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:37,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45773334] [2025-04-13 17:12:37,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45773334] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:37,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:37,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:12:37,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830923836] [2025-04-13 17:12:37,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:37,178 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:12:37,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:37,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:12:37,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:12:37,178 INFO L87 Difference]: Start difference. First operand 41325 states and 199647 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 17:12:39,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:39,804 INFO L93 Difference]: Finished difference Result 65213 states and 309557 transitions. [2025-04-13 17:12:39,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:12:39,805 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 12 [2025-04-13 17:12:39,805 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:40,164 INFO L225 Difference]: With dead ends: 65213 [2025-04-13 17:12:40,164 INFO L226 Difference]: Without dead ends: 57989 [2025-04-13 17:12:40,189 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 17:12:40,190 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:40,190 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 12 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:12:40,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57989 states. [2025-04-13 17:12:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57989 to 45461. [2025-04-13 17:12:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45461 states, 45429 states have (on average 4.818089766448744) internal successors, (218881), 45460 states have internal predecessors, (218881), 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 17:12:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45461 states to 45461 states and 218881 transitions. [2025-04-13 17:12:42,780 INFO L79 Accepts]: Start accepts. Automaton has 45461 states and 218881 transitions. Word has length 12 [2025-04-13 17:12:42,780 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:42,780 INFO L485 AbstractCegarLoop]: Abstraction has 45461 states and 218881 transitions. [2025-04-13 17:12:42,780 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 17:12:42,781 INFO L278 IsEmpty]: Start isEmpty. Operand 45461 states and 218881 transitions. [2025-04-13 17:12:42,781 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 17:12:42,781 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:42,781 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:12:42,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 17:12:42,782 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 17:12:42,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:42,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1834768976, now seen corresponding path program 2 times [2025-04-13 17:12:42,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:42,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974170095] [2025-04-13 17:12:42,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:12:42,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:42,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-13 17:12:42,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 17:12:42,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:12:42,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:42,811 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 17:12:42,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:42,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974170095] [2025-04-13 17:12:42,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974170095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:42,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:42,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:12:42,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967429317] [2025-04-13 17:12:42,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:42,812 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:12:42,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:42,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:12:42,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:12:42,812 INFO L87 Difference]: Start difference. First operand 45461 states and 218881 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 17:12:47,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:12:47,512 INFO L93 Difference]: Finished difference Result 100759 states and 454483 transitions. [2025-04-13 17:12:47,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:12:47,513 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 12 [2025-04-13 17:12:47,513 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:12:48,131 INFO L225 Difference]: With dead ends: 100759 [2025-04-13 17:12:48,132 INFO L226 Difference]: Without dead ends: 93403 [2025-04-13 17:12:48,191 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:12:48,191 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 84 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:12:48,191 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 54 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:12:48,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93403 states. [2025-04-13 17:12:50,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93403 to 37753. [2025-04-13 17:12:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37753 states, 37721 states have (on average 4.667771267993956) internal successors, (176073), 37752 states have internal predecessors, (176073), 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 17:12:50,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37753 states to 37753 states and 176073 transitions. [2025-04-13 17:12:50,849 INFO L79 Accepts]: Start accepts. Automaton has 37753 states and 176073 transitions. Word has length 12 [2025-04-13 17:12:50,849 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:12:50,849 INFO L485 AbstractCegarLoop]: Abstraction has 37753 states and 176073 transitions. [2025-04-13 17:12:50,849 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 17:12:50,850 INFO L278 IsEmpty]: Start isEmpty. Operand 37753 states and 176073 transitions. [2025-04-13 17:12:50,851 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 17:12:50,851 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:50,851 INFO L218 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:12:50,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 17:12:50,851 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 17:12:50,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:50,851 INFO L85 PathProgramCache]: Analyzing trace with hash 917215452, now seen corresponding path program 1 times [2025-04-13 17:12:50,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:50,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119778005] [2025-04-13 17:12:50,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:50,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:50,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 17:12:50,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 17:12:50,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:50,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:50,856 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:12:50,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 17:12:50,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 17:12:50,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:50,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:12:50,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:12:50,861 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:12:50,862 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-13 17:12:50,862 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 17:12:50,862 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-04-13 17:12:50,862 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-13 17:12:50,862 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 17:12:50,862 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 17:12:50,862 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 17:12:50,862 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 17:12:50,862 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1] [2025-04-13 17:12:50,862 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:12:50,864 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-13 17:12:50,876 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:12:50,877 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 40 transitions, 134 flow [2025-04-13 17:12:57,115 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 214491 states, 214307 states have (on average 5.656782092978764) internal successors, (1212288), 214490 states have internal predecessors, (1212288), 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 17:12:57,121 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:12:57,121 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;@3a8c6be9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:12:57,121 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 17:12:57,499 INFO L278 IsEmpty]: Start isEmpty. Operand has 214491 states, 214307 states have (on average 5.656782092978764) internal successors, (1212288), 214490 states have internal predecessors, (1212288), 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 17:12:57,499 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 17:12:57,499 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:12:57,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 17:12:57,499 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 17:12:57,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:12:57,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1017396026, now seen corresponding path program 1 times [2025-04-13 17:12:57,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:12:57,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548074087] [2025-04-13 17:12:57,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:12:57,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:12:57,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 17:12:57,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 17:12:57,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:12:57,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:12:57,511 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 17:12:57,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:12:57,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548074087] [2025-04-13 17:12:57,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548074087] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:12:57,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:12:57,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:12:57,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145236034] [2025-04-13 17:12:57,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:12:57,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:12:57,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:12:57,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:12:57,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:12:57,884 INFO L87 Difference]: Start difference. First operand has 214491 states, 214307 states have (on average 5.656782092978764) internal successors, (1212288), 214490 states have internal predecessors, (1212288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 17:13:03,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:13:03,819 INFO L93 Difference]: Finished difference Result 319611 states and 1827716 transitions. [2025-04-13 17:13:03,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:13:03,820 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 17:13:03,820 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:13:06,803 INFO L225 Difference]: With dead ends: 319611 [2025-04-13 17:13:06,803 INFO L226 Difference]: Without dead ends: 237313 [2025-04-13 17:13:07,012 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 17:13:07,013 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:13:07,013 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 14 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:13:07,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237313 states. [2025-04-13 17:13:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237313 to 184753. [2025-04-13 17:13:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184753 states, 184689 states have (on average 5.613192989295518) internal successors, (1036695), 184752 states have internal predecessors, (1036695), 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 17:13:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184753 states to 184753 states and 1036695 transitions. [2025-04-13 17:13:18,282 INFO L79 Accepts]: Start accepts. Automaton has 184753 states and 1036695 transitions. Word has length 6 [2025-04-13 17:13:18,282 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:13:18,282 INFO L485 AbstractCegarLoop]: Abstraction has 184753 states and 1036695 transitions. [2025-04-13 17:13:18,282 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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 17:13:18,282 INFO L278 IsEmpty]: Start isEmpty. Operand 184753 states and 1036695 transitions. [2025-04-13 17:13:18,282 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 17:13:18,282 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:13:18,283 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 17:13:18,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 17:13:18,283 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 17:13:18,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:13:18,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1526527317, now seen corresponding path program 1 times [2025-04-13 17:13:18,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:13:18,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008492357] [2025-04-13 17:13:18,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:13:18,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:13:18,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 17:13:18,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 17:13:18,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:13:18,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:13:18,298 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 17:13:18,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:13:18,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008492357] [2025-04-13 17:13:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008492357] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:13:18,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:13:18,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:13:18,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989256143] [2025-04-13 17:13:18,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:13:18,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:13:18,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:13:18,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:13:18,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:13:18,299 INFO L87 Difference]: Start difference. First operand 184753 states and 1036695 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 17:13:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:13:23,754 INFO L93 Difference]: Finished difference Result 302467 states and 1680971 transitions. [2025-04-13 17:13:23,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:13:23,762 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 17:13:23,762 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:13:28,273 INFO L225 Difference]: With dead ends: 302467 [2025-04-13 17:13:28,273 INFO L226 Difference]: Without dead ends: 271625 [2025-04-13 17:13:28,419 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 17:13:28,420 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:13:28,420 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 14 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:13:28,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271625 states. [2025-04-13 17:13:37,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271625 to 210565. [2025-04-13 17:13:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210565 states, 210501 states have (on average 5.629507698300721) internal successors, (1185017), 210564 states have internal predecessors, (1185017), 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 17:13:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210565 states to 210565 states and 1185017 transitions. [2025-04-13 17:13:40,693 INFO L79 Accepts]: Start accepts. Automaton has 210565 states and 1185017 transitions. Word has length 8 [2025-04-13 17:13:40,693 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:13:40,694 INFO L485 AbstractCegarLoop]: Abstraction has 210565 states and 1185017 transitions. [2025-04-13 17:13:40,694 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 17:13:40,694 INFO L278 IsEmpty]: Start isEmpty. Operand 210565 states and 1185017 transitions. [2025-04-13 17:13:40,694 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 17:13:40,694 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:13:40,694 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:13:40,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 17:13:40,695 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 17:13:40,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:13:40,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1913559414, now seen corresponding path program 1 times [2025-04-13 17:13:40,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:13:40,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951026937] [2025-04-13 17:13:40,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:13:40,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:13:40,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 17:13:40,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 17:13:40,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:13:40,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:13:40,721 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 17:13:40,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:13:40,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951026937] [2025-04-13 17:13:40,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951026937] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:13:40,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:13:40,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:13:40,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601221693] [2025-04-13 17:13:40,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:13:40,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:13:40,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:13:40,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:13:40,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:13:40,722 INFO L87 Difference]: Start difference. First operand 210565 states and 1185017 transitions. Second operand has 3 states, 2 states have (on average 4.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)