/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:56:00,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:56:00,986 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 22:56:00,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:56:00,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:56:01,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:56:01,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:56:01,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:56:01,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:56:01,016 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:56:01,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:56:01,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:56:01,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:56:01,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:56:01,017 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:56:01,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:56:01,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:56:01,018 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:56:01,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:56:01,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:56:01,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:56:01,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:56:01,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:56:01,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:56:01,018 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:56:01,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:56:01,018 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:56:01,018 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:56:01,018 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:56:01,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:56:01,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:56:01,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:56:01,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:56:01,018 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:56:01,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:56:01,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:56:01,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:56:01,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:56:01,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:56:01,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:56:01,019 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:56:01,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:56:01,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:56:01,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:56:01,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:56:01,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:56:01,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:56:01,019 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 22:56:01,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:56:01,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:56:01,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:56:01,276 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:56:01,278 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:56:01,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult3.wvr.c [2025-04-13 22:56:02,596 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/204850397/9291807e5f754260854e2c84ce7154a6/FLAG2a90f24bd [2025-04-13 22:56:02,810 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:56:02,810 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult3.wvr.c [2025-04-13 22:56:02,819 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/204850397/9291807e5f754260854e2c84ce7154a6/FLAG2a90f24bd [2025-04-13 22:56:03,798 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/204850397/9291807e5f754260854e2c84ce7154a6 [2025-04-13 22:56:03,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:56:03,801 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:56:03,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:56:03,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:56:03,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:56:03,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:56:03" (1/1) ... [2025-04-13 22:56:03,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71f7593d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:56:03, skipping insertion in model container [2025-04-13 22:56:03,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:56:03" (1/1) ... [2025-04-13 22:56:03,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:56:03,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult3.wvr.c[4270,4283] [2025-04-13 22:56:03,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:56:04,004 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:56:04,030 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult3.wvr.c[4270,4283] [2025-04-13 22:56:04,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:56:04,048 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:56:04,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:56:04 WrapperNode [2025-04-13 22:56:04,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:56:04,049 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:56:04,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:56:04,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:56:04,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:56:04" (1/1) ... [2025-04-13 22:56:04,065 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:56:04" (1/1) ... [2025-04-13 22:56:04,091 INFO L138 Inliner]: procedures = 26, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 278 [2025-04-13 22:56:04,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:56:04,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:56:04,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:56:04,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:56:04,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:56:04" (1/1) ... [2025-04-13 22:56:04,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:56:04" (1/1) ... [2025-04-13 22:56:04,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:56:04" (1/1) ... [2025-04-13 22:56:04,127 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 22:56:04,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:56:04" (1/1) ... [2025-04-13 22:56:04,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:56:04" (1/1) ... [2025-04-13 22:56:04,137 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:56:04" (1/1) ... [2025-04-13 22:56:04,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:56:04" (1/1) ... [2025-04-13 22:56:04,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:56:04" (1/1) ... [2025-04-13 22:56:04,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:56:04" (1/1) ... [2025-04-13 22:56:04,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:56:04,144 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:56:04,144 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:56:04,144 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:56:04,148 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:56:04" (1/1) ... [2025-04-13 22:56:04,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:56:04,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:56:04,174 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 22:56:04,176 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 22:56:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:56:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:56:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:56:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:56:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:56:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:56:04,192 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:56:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:56:04,192 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:56:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:56:04,192 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:56:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 22:56:04,192 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 22:56:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:56:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:56:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 22:56:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 22:56:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:56:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:56:04,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:56:04,194 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 22:56:04,277 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:56:04,278 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:56:04,630 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:56:04,631 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:56:04,631 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:56:04,905 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:56:04,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:56:04 BoogieIcfgContainer [2025-04-13 22:56:04,905 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:56:04,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:56:04,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:56:04,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:56:04,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:56:03" (1/3) ... [2025-04-13 22:56:04,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216fdf2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:56:04, skipping insertion in model container [2025-04-13 22:56:04,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:56:04" (2/3) ... [2025-04-13 22:56:04,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216fdf2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:56:04, skipping insertion in model container [2025-04-13 22:56:04,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:56:04" (3/3) ... [2025-04-13 22:56:04,911 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult3.wvr.c [2025-04-13 22:56:04,921 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:56:04,923 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult3.wvr.c that has 5 procedures, 44 locations, 45 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 22:56:04,923 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:56:04,979 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 22:56:05,006 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 49 transitions, 126 flow [2025-04-13 22:56:05,240 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4528 states, 4527 states have (on average 4.34857521537442) internal successors, (19686), 4527 states have internal predecessors, (19686), 0 states have call successors, (0), 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 22:56:05,261 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:56:05,268 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;@1461b7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:56:05,269 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 22:56:05,287 INFO L278 IsEmpty]: Start isEmpty. Operand has 4528 states, 4527 states have (on average 4.34857521537442) internal successors, (19686), 4527 states have internal predecessors, (19686), 0 states have call successors, (0), 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 22:56:05,335 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:56:05,336 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:05,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:05,336 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:05,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:05,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1920611613, now seen corresponding path program 1 times [2025-04-13 22:56:05,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:05,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118508942] [2025-04-13 22:56:05,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:56:05,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:05,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:56:05,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:56:05,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:56:05,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:56:05,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:05,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118508942] [2025-04-13 22:56:05,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118508942] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:05,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:05,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 22:56:05,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023850552] [2025-04-13 22:56:05,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:05,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:56:05,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:05,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:56:05,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:56:05,674 INFO L87 Difference]: Start difference. First operand has 4528 states, 4527 states have (on average 4.34857521537442) internal successors, (19686), 4527 states have internal predecessors, (19686), 0 states have call successors, (0), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:05,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:05,959 INFO L93 Difference]: Finished difference Result 7055 states and 30786 transitions. [2025-04-13 22:56:05,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:56:05,961 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:56:05,961 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:06,030 INFO L225 Difference]: With dead ends: 7055 [2025-04-13 22:56:06,030 INFO L226 Difference]: Without dead ends: 6946 [2025-04-13 22:56:06,037 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:56:06,038 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:06,039 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 16 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:56:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2025-04-13 22:56:06,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 5893. [2025-04-13 22:56:06,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5893 states, 5892 states have (on average 4.356415478615071) internal successors, (25668), 5892 states have internal predecessors, (25668), 0 states have call successors, (0), 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 22:56:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5893 states to 5893 states and 25668 transitions. [2025-04-13 22:56:06,409 INFO L79 Accepts]: Start accepts. Automaton has 5893 states and 25668 transitions. Word has length 28 [2025-04-13 22:56:06,409 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:06,409 INFO L485 AbstractCegarLoop]: Abstraction has 5893 states and 25668 transitions. [2025-04-13 22:56:06,410 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:06,410 INFO L278 IsEmpty]: Start isEmpty. Operand 5893 states and 25668 transitions. [2025-04-13 22:56:06,436 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:56:06,436 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:06,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:06,437 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:56:06,437 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:06,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash -523066841, now seen corresponding path program 1 times [2025-04-13 22:56:06,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:06,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155089683] [2025-04-13 22:56:06,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:56:06,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:06,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:56:06,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:56:06,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:56:06,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:06,608 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 22:56:06,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:06,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155089683] [2025-04-13 22:56:06,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155089683] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:06,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:06,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:56:06,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390700152] [2025-04-13 22:56:06,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:06,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:56:06,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:06,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:56:06,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:56:06,610 INFO L87 Difference]: Start difference. First operand 5893 states and 25668 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:06,946 INFO L93 Difference]: Finished difference Result 11194 states and 48773 transitions. [2025-04-13 22:56:06,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:56:06,947 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-13 22:56:06,947 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:07,011 INFO L225 Difference]: With dead ends: 11194 [2025-04-13 22:56:07,011 INFO L226 Difference]: Without dead ends: 8038 [2025-04-13 22:56:07,026 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 22:56:07,026 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:07,027 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 15 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:56:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8038 states. [2025-04-13 22:56:07,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8038 to 7525. [2025-04-13 22:56:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7525 states, 7524 states have (on average 4.330940988835725) internal successors, (32586), 7524 states have internal predecessors, (32586), 0 states have call successors, (0), 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 22:56:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7525 states to 7525 states and 32586 transitions. [2025-04-13 22:56:07,398 INFO L79 Accepts]: Start accepts. Automaton has 7525 states and 32586 transitions. Word has length 31 [2025-04-13 22:56:07,399 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:07,399 INFO L485 AbstractCegarLoop]: Abstraction has 7525 states and 32586 transitions. [2025-04-13 22:56:07,399 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:07,399 INFO L278 IsEmpty]: Start isEmpty. Operand 7525 states and 32586 transitions. [2025-04-13 22:56:07,423 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:56:07,424 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:07,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:07,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:56:07,425 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:07,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:07,425 INFO L85 PathProgramCache]: Analyzing trace with hash 577866481, now seen corresponding path program 1 times [2025-04-13 22:56:07,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:07,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046201983] [2025-04-13 22:56:07,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:56:07,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:07,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:56:07,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:56:07,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:56:07,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:56:07,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:07,534 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046201983] [2025-04-13 22:56:07,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046201983] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:07,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:07,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:56:07,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775488833] [2025-04-13 22:56:07,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:07,535 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:56:07,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:07,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:56:07,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:56:07,535 INFO L87 Difference]: Start difference. First operand 7525 states and 32586 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:08,019 INFO L93 Difference]: Finished difference Result 13704 states and 59375 transitions. [2025-04-13 22:56:08,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:56:08,019 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-13 22:56:08,019 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:08,086 INFO L225 Difference]: With dead ends: 13704 [2025-04-13 22:56:08,086 INFO L226 Difference]: Without dead ends: 10092 [2025-04-13 22:56:08,099 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 22:56:08,100 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:08,100 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 15 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:56:08,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10092 states. [2025-04-13 22:56:08,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10092 to 9614. [2025-04-13 22:56:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9614 states, 9613 states have (on average 4.281077707271403) internal successors, (41154), 9613 states have internal predecessors, (41154), 0 states have call successors, (0), 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 22:56:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 41154 transitions. [2025-04-13 22:56:08,542 INFO L79 Accepts]: Start accepts. Automaton has 9614 states and 41154 transitions. Word has length 31 [2025-04-13 22:56:08,542 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:08,543 INFO L485 AbstractCegarLoop]: Abstraction has 9614 states and 41154 transitions. [2025-04-13 22:56:08,543 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:08,543 INFO L278 IsEmpty]: Start isEmpty. Operand 9614 states and 41154 transitions. [2025-04-13 22:56:08,572 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:56:08,572 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:08,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:08,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:56:08,573 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:08,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:08,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1017715940, now seen corresponding path program 1 times [2025-04-13 22:56:08,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:08,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114564695] [2025-04-13 22:56:08,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:56:08,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:08,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:56:08,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:56:08,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:56:08,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:56:08,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:08,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114564695] [2025-04-13 22:56:08,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114564695] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:08,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:08,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:56:08,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688120293] [2025-04-13 22:56:08,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:08,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:56:08,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:08,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:56:08,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:56:08,708 INFO L87 Difference]: Start difference. First operand 9614 states and 41154 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:09,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:09,141 INFO L93 Difference]: Finished difference Result 19689 states and 83804 transitions. [2025-04-13 22:56:09,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:56:09,141 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:56:09,142 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:09,269 INFO L225 Difference]: With dead ends: 19689 [2025-04-13 22:56:09,269 INFO L226 Difference]: Without dead ends: 12043 [2025-04-13 22:56:09,280 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:56:09,281 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 32 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:09,281 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 24 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:56:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12043 states. [2025-04-13 22:56:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12043 to 11243. [2025-04-13 22:56:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11243 states, 11242 states have (on average 4.2466642946095) internal successors, (47741), 11242 states have internal predecessors, (47741), 0 states have call successors, (0), 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 22:56:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11243 states to 11243 states and 47741 transitions. [2025-04-13 22:56:09,785 INFO L79 Accepts]: Start accepts. Automaton has 11243 states and 47741 transitions. Word has length 35 [2025-04-13 22:56:09,785 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:09,785 INFO L485 AbstractCegarLoop]: Abstraction has 11243 states and 47741 transitions. [2025-04-13 22:56:09,786 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:09,786 INFO L278 IsEmpty]: Start isEmpty. Operand 11243 states and 47741 transitions. [2025-04-13 22:56:09,818 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:56:09,818 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:09,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:09,819 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:56:09,819 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:09,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:09,819 INFO L85 PathProgramCache]: Analyzing trace with hash 91069274, now seen corresponding path program 1 times [2025-04-13 22:56:09,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:09,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377578727] [2025-04-13 22:56:09,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:56:09,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:09,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:56:09,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:56:09,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:56:09,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:09,973 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 22:56:09,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:09,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377578727] [2025-04-13 22:56:09,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377578727] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:09,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:09,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:56:09,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484019555] [2025-04-13 22:56:09,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:09,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:56:09,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:09,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:56:09,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:56:09,975 INFO L87 Difference]: Start difference. First operand 11243 states and 47741 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:10,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:10,590 INFO L93 Difference]: Finished difference Result 22844 states and 96682 transitions. [2025-04-13 22:56:10,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:56:10,590 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:56:10,590 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:10,692 INFO L225 Difference]: With dead ends: 22844 [2025-04-13 22:56:10,692 INFO L226 Difference]: Without dead ends: 13692 [2025-04-13 22:56:10,719 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:56:10,719 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:10,720 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 24 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:56:10,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13692 states. [2025-04-13 22:56:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13692 to 13060. [2025-04-13 22:56:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13060 states, 13059 states have (on average 4.216249329964009) internal successors, (55060), 13059 states have internal predecessors, (55060), 0 states have call successors, (0), 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 22:56:11,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13060 states to 13060 states and 55060 transitions. [2025-04-13 22:56:11,370 INFO L79 Accepts]: Start accepts. Automaton has 13060 states and 55060 transitions. Word has length 35 [2025-04-13 22:56:11,371 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:11,371 INFO L485 AbstractCegarLoop]: Abstraction has 13060 states and 55060 transitions. [2025-04-13 22:56:11,371 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:11,371 INFO L278 IsEmpty]: Start isEmpty. Operand 13060 states and 55060 transitions. [2025-04-13 22:56:11,418 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:56:11,418 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:11,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:11,418 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:56:11,418 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:11,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:11,419 INFO L85 PathProgramCache]: Analyzing trace with hash -808592798, now seen corresponding path program 1 times [2025-04-13 22:56:11,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:11,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998317943] [2025-04-13 22:56:11,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:56:11,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:11,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:56:11,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:56:11,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:56:11,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:11,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:11,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998317943] [2025-04-13 22:56:11,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998317943] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:56:11,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346514095] [2025-04-13 22:56:11,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:56:11,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:56:11,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:56:11,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:56:11,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 22:56:11,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:56:11,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:56:11,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:56:11,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:11,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 22:56:11,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:56:12,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:12,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:56:12,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:12,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346514095] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:56:12,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:56:12,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 6] total 17 [2025-04-13 22:56:12,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803991256] [2025-04-13 22:56:12,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:12,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:56:12,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:12,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:56:12,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:56:12,303 INFO L87 Difference]: Start difference. First operand 13060 states and 55060 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:13,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:13,525 INFO L93 Difference]: Finished difference Result 18960 states and 77656 transitions. [2025-04-13 22:56:13,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:56:13,526 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:13,526 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:13,620 INFO L225 Difference]: With dead ends: 18960 [2025-04-13 22:56:13,620 INFO L226 Difference]: Without dead ends: 16466 [2025-04-13 22:56:13,633 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:56:13,633 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 193 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:13,633 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 149 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:56:13,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16466 states. [2025-04-13 22:56:14,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16466 to 12601. [2025-04-13 22:56:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12601 states, 12600 states have (on average 4.234920634920635) internal successors, (53360), 12600 states have internal predecessors, (53360), 0 states have call successors, (0), 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 22:56:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12601 states to 12601 states and 53360 transitions. [2025-04-13 22:56:14,274 INFO L79 Accepts]: Start accepts. Automaton has 12601 states and 53360 transitions. Word has length 36 [2025-04-13 22:56:14,275 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:14,275 INFO L485 AbstractCegarLoop]: Abstraction has 12601 states and 53360 transitions. [2025-04-13 22:56:14,275 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:14,275 INFO L278 IsEmpty]: Start isEmpty. Operand 12601 states and 53360 transitions. [2025-04-13 22:56:14,307 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:56:14,307 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:14,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:14,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 22:56:14,512 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 22:56:14,512 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:14,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:14,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1940655416, now seen corresponding path program 2 times [2025-04-13 22:56:14,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:14,513 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325337278] [2025-04-13 22:56:14,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:56:14,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:14,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:56:14,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:56:14,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:56:14,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:14,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:14,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325337278] [2025-04-13 22:56:14,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325337278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:14,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:14,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:56:14,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876990584] [2025-04-13 22:56:14,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:14,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:56:14,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:14,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:56:14,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:56:14,953 INFO L87 Difference]: Start difference. First operand 12601 states and 53360 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:16,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:16,857 INFO L93 Difference]: Finished difference Result 19476 states and 79808 transitions. [2025-04-13 22:56:16,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:56:16,858 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:16,858 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:16,950 INFO L225 Difference]: With dead ends: 19476 [2025-04-13 22:56:16,951 INFO L226 Difference]: Without dead ends: 18470 [2025-04-13 22:56:16,961 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:56:16,962 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 235 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:16,962 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 107 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:56:16,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18470 states. [2025-04-13 22:56:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18470 to 13033. [2025-04-13 22:56:17,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13033 states, 13032 states have (on average 4.234806629834254) internal successors, (55188), 13032 states have internal predecessors, (55188), 0 states have call successors, (0), 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 22:56:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13033 states to 13033 states and 55188 transitions. [2025-04-13 22:56:17,843 INFO L79 Accepts]: Start accepts. Automaton has 13033 states and 55188 transitions. Word has length 36 [2025-04-13 22:56:17,843 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:17,843 INFO L485 AbstractCegarLoop]: Abstraction has 13033 states and 55188 transitions. [2025-04-13 22:56:17,843 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:17,844 INFO L278 IsEmpty]: Start isEmpty. Operand 13033 states and 55188 transitions. [2025-04-13 22:56:17,875 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:56:17,875 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:17,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:17,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:56:17,876 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:17,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:17,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1085922238, now seen corresponding path program 3 times [2025-04-13 22:56:17,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:17,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271737112] [2025-04-13 22:56:17,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:56:17,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:17,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:56:17,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:56:17,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:56:17,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:18,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:18,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271737112] [2025-04-13 22:56:18,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271737112] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:18,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:18,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:56:18,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808655798] [2025-04-13 22:56:18,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:18,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:56:18,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:18,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:56:18,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:56:18,202 INFO L87 Difference]: Start difference. First operand 13033 states and 55188 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:19,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:19,670 INFO L93 Difference]: Finished difference Result 21153 states and 87212 transitions. [2025-04-13 22:56:19,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:56:19,670 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:19,670 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:19,752 INFO L225 Difference]: With dead ends: 21153 [2025-04-13 22:56:19,752 INFO L226 Difference]: Without dead ends: 19740 [2025-04-13 22:56:19,761 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:56:19,762 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 145 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:19,762 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 94 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:56:19,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19740 states. [2025-04-13 22:56:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19740 to 13167. [2025-04-13 22:56:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13167 states, 13166 states have (on average 4.2466200820294695) internal successors, (55911), 13166 states have internal predecessors, (55911), 0 states have call successors, (0), 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 22:56:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13167 states to 13167 states and 55911 transitions. [2025-04-13 22:56:20,677 INFO L79 Accepts]: Start accepts. Automaton has 13167 states and 55911 transitions. Word has length 36 [2025-04-13 22:56:20,677 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:20,677 INFO L485 AbstractCegarLoop]: Abstraction has 13167 states and 55911 transitions. [2025-04-13 22:56:20,677 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:20,678 INFO L278 IsEmpty]: Start isEmpty. Operand 13167 states and 55911 transitions. [2025-04-13 22:56:20,705 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:56:20,705 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:20,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:20,705 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:56:20,705 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:20,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:20,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1672118962, now seen corresponding path program 4 times [2025-04-13 22:56:20,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:20,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335759662] [2025-04-13 22:56:20,706 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:56:20,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:20,712 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:56:20,726 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:56:20,727 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:56:20,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:20,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:20,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335759662] [2025-04-13 22:56:20,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335759662] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:20,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:20,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:56:20,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111635096] [2025-04-13 22:56:20,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:20,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:56:20,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:20,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:56:20,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:56:20,926 INFO L87 Difference]: Start difference. First operand 13167 states and 55911 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:22,379 INFO L93 Difference]: Finished difference Result 17257 states and 71245 transitions. [2025-04-13 22:56:22,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:56:22,379 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:22,380 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:22,454 INFO L225 Difference]: With dead ends: 17257 [2025-04-13 22:56:22,454 INFO L226 Difference]: Without dead ends: 15932 [2025-04-13 22:56:22,463 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:56:22,463 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 119 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:22,466 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 69 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:56:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15932 states. [2025-04-13 22:56:23,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15932 to 12987. [2025-04-13 22:56:23,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12987 states, 12986 states have (on average 4.245187124595718) internal successors, (55128), 12986 states have internal predecessors, (55128), 0 states have call successors, (0), 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 22:56:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12987 states to 12987 states and 55128 transitions. [2025-04-13 22:56:23,309 INFO L79 Accepts]: Start accepts. Automaton has 12987 states and 55128 transitions. Word has length 36 [2025-04-13 22:56:23,310 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:23,310 INFO L485 AbstractCegarLoop]: Abstraction has 12987 states and 55128 transitions. [2025-04-13 22:56:23,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:23,310 INFO L278 IsEmpty]: Start isEmpty. Operand 12987 states and 55128 transitions. [2025-04-13 22:56:23,393 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:56:23,393 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:23,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:23,393 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:56:23,394 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:23,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:23,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1626071080, now seen corresponding path program 5 times [2025-04-13 22:56:23,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:23,394 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617546826] [2025-04-13 22:56:23,394 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:56:23,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:23,400 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:56:23,412 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:56:23,412 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:56:23,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:23,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:23,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:23,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617546826] [2025-04-13 22:56:23,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617546826] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:23,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:23,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:56:23,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867720114] [2025-04-13 22:56:23,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:23,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:56:23,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:23,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:56:23,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:56:23,641 INFO L87 Difference]: Start difference. First operand 12987 states and 55128 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:24,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:24,599 INFO L93 Difference]: Finished difference Result 13363 states and 56225 transitions. [2025-04-13 22:56:24,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:56:24,599 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:24,599 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:24,662 INFO L225 Difference]: With dead ends: 13363 [2025-04-13 22:56:24,663 INFO L226 Difference]: Without dead ends: 13231 [2025-04-13 22:56:24,669 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:56:24,669 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 60 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:24,669 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 64 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:56:24,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13231 states. [2025-04-13 22:56:25,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13231 to 13051. [2025-04-13 22:56:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13051 states, 13050 states have (on average 4.237701149425288) internal successors, (55302), 13050 states have internal predecessors, (55302), 0 states have call successors, (0), 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 22:56:25,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13051 states to 13051 states and 55302 transitions. [2025-04-13 22:56:25,524 INFO L79 Accepts]: Start accepts. Automaton has 13051 states and 55302 transitions. Word has length 36 [2025-04-13 22:56:25,524 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:25,524 INFO L485 AbstractCegarLoop]: Abstraction has 13051 states and 55302 transitions. [2025-04-13 22:56:25,525 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:25,525 INFO L278 IsEmpty]: Start isEmpty. Operand 13051 states and 55302 transitions. [2025-04-13 22:56:25,552 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:56:25,552 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:25,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:25,552 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 22:56:25,552 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:25,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:25,553 INFO L85 PathProgramCache]: Analyzing trace with hash 244835820, now seen corresponding path program 6 times [2025-04-13 22:56:25,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:25,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799005444] [2025-04-13 22:56:25,553 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:56:25,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:25,560 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:56:25,567 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:56:25,567 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:56:25,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:25,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:25,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:25,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799005444] [2025-04-13 22:56:25,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799005444] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:25,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:25,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:56:25,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221025590] [2025-04-13 22:56:25,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:25,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:56:25,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:25,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:56:25,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:56:25,838 INFO L87 Difference]: Start difference. First operand 13051 states and 55302 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:27,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:27,448 INFO L93 Difference]: Finished difference Result 19102 states and 79297 transitions. [2025-04-13 22:56:27,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:56:27,452 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:27,452 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:27,541 INFO L225 Difference]: With dead ends: 19102 [2025-04-13 22:56:27,541 INFO L226 Difference]: Without dead ends: 17716 [2025-04-13 22:56:27,551 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:56:27,551 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 183 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:27,551 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 101 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:56:27,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17716 states. [2025-04-13 22:56:28,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17716 to 13339. [2025-04-13 22:56:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13339 states, 13338 states have (on average 4.236467236467236) internal successors, (56506), 13338 states have internal predecessors, (56506), 0 states have call successors, (0), 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 22:56:28,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13339 states to 13339 states and 56506 transitions. [2025-04-13 22:56:28,575 INFO L79 Accepts]: Start accepts. Automaton has 13339 states and 56506 transitions. Word has length 36 [2025-04-13 22:56:28,575 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:28,575 INFO L485 AbstractCegarLoop]: Abstraction has 13339 states and 56506 transitions. [2025-04-13 22:56:28,575 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:28,575 INFO L278 IsEmpty]: Start isEmpty. Operand 13339 states and 56506 transitions. [2025-04-13 22:56:28,603 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:56:28,603 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:28,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:28,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 22:56:28,603 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:28,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:28,603 INFO L85 PathProgramCache]: Analyzing trace with hash -719328784, now seen corresponding path program 7 times [2025-04-13 22:56:28,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:28,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276132529] [2025-04-13 22:56:28,604 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:56:28,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:28,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:56:28,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:56:28,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:56:28,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:28,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:28,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276132529] [2025-04-13 22:56:28,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276132529] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:28,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:28,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:56:28,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678913441] [2025-04-13 22:56:28,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:28,786 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:56:28,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:28,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:56:28,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:56:28,786 INFO L87 Difference]: Start difference. First operand 13339 states and 56506 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:29,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:29,979 INFO L93 Difference]: Finished difference Result 13751 states and 57701 transitions. [2025-04-13 22:56:29,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:56:29,979 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:29,979 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:30,048 INFO L225 Difference]: With dead ends: 13751 [2025-04-13 22:56:30,048 INFO L226 Difference]: Without dead ends: 13415 [2025-04-13 22:56:30,055 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:56:30,056 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 50 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:30,056 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 76 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:56:30,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13415 states. [2025-04-13 22:56:30,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13415 to 13251. [2025-04-13 22:56:30,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13251 states, 13250 states have (on average 4.233207547169811) internal successors, (56090), 13250 states have internal predecessors, (56090), 0 states have call successors, (0), 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 22:56:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 56090 transitions. [2025-04-13 22:56:31,036 INFO L79 Accepts]: Start accepts. Automaton has 13251 states and 56090 transitions. Word has length 36 [2025-04-13 22:56:31,036 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:31,036 INFO L485 AbstractCegarLoop]: Abstraction has 13251 states and 56090 transitions. [2025-04-13 22:56:31,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:31,037 INFO L278 IsEmpty]: Start isEmpty. Operand 13251 states and 56090 transitions. [2025-04-13 22:56:31,063 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:56:31,064 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:31,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:31,064 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 22:56:31,064 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:31,064 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:31,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1781827730, now seen corresponding path program 8 times [2025-04-13 22:56:31,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:31,064 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295967140] [2025-04-13 22:56:31,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:56:31,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:31,070 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:56:31,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:56:31,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:56:31,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:31,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:31,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295967140] [2025-04-13 22:56:31,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295967140] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:31,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:31,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:56:31,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167683687] [2025-04-13 22:56:31,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:31,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:56:31,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:31,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:56:31,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:56:31,310 INFO L87 Difference]: Start difference. First operand 13251 states and 56090 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:33,823 INFO L93 Difference]: Finished difference Result 23593 states and 97645 transitions. [2025-04-13 22:56:33,824 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:56:33,824 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:33,824 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:33,920 INFO L225 Difference]: With dead ends: 23593 [2025-04-13 22:56:33,920 INFO L226 Difference]: Without dead ends: 22629 [2025-04-13 22:56:33,930 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:56:33,930 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 185 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:33,930 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 86 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:56:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22629 states. [2025-04-13 22:56:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22629 to 13628. [2025-04-13 22:56:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13628 states, 13627 states have (on average 4.2673369046745435) internal successors, (58151), 13627 states have internal predecessors, (58151), 0 states have call successors, (0), 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 22:56:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13628 states to 13628 states and 58151 transitions. [2025-04-13 22:56:35,212 INFO L79 Accepts]: Start accepts. Automaton has 13628 states and 58151 transitions. Word has length 36 [2025-04-13 22:56:35,212 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:35,213 INFO L485 AbstractCegarLoop]: Abstraction has 13628 states and 58151 transitions. [2025-04-13 22:56:35,213 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:35,213 INFO L278 IsEmpty]: Start isEmpty. Operand 13628 states and 58151 transitions. [2025-04-13 22:56:35,242 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:56:35,242 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:35,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:35,243 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 22:56:35,243 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:35,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:35,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1399057244, now seen corresponding path program 9 times [2025-04-13 22:56:35,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:35,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212400429] [2025-04-13 22:56:35,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:56:35,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:35,251 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:56:35,266 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:56:35,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:56:35,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:35,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:35,449 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212400429] [2025-04-13 22:56:35,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212400429] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:56:35,449 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655052862] [2025-04-13 22:56:35,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:56:35,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:56:35,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:56:35,451 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:56:35,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 22:56:35,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:56:35,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:56:35,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:56:35,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:35,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 22:56:35,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:56:35,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:35,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:56:35,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:35,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655052862] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:56:35,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:56:35,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 6] total 16 [2025-04-13 22:56:35,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603206856] [2025-04-13 22:56:35,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:35,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:56:35,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:35,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:56:35,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:56:35,967 INFO L87 Difference]: Start difference. First operand 13628 states and 58151 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:38,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:38,548 INFO L93 Difference]: Finished difference Result 18770 states and 77954 transitions. [2025-04-13 22:56:38,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:56:38,548 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:38,548 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:38,632 INFO L225 Difference]: With dead ends: 18770 [2025-04-13 22:56:38,632 INFO L226 Difference]: Without dead ends: 18568 [2025-04-13 22:56:38,641 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:56:38,642 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 228 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:38,642 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 81 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:56:38,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18568 states. [2025-04-13 22:56:39,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18568 to 13878. [2025-04-13 22:56:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13878 states, 13877 states have (on average 4.284283346544642) internal successors, (59453), 13877 states have internal predecessors, (59453), 0 states have call successors, (0), 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 22:56:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13878 states to 13878 states and 59453 transitions. [2025-04-13 22:56:40,077 INFO L79 Accepts]: Start accepts. Automaton has 13878 states and 59453 transitions. Word has length 36 [2025-04-13 22:56:40,077 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:40,077 INFO L485 AbstractCegarLoop]: Abstraction has 13878 states and 59453 transitions. [2025-04-13 22:56:40,077 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:40,077 INFO L278 IsEmpty]: Start isEmpty. Operand 13878 states and 59453 transitions. [2025-04-13 22:56:40,104 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:56:40,104 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:40,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:40,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 22:56:40,305 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 22:56:40,305 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:40,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:40,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1159215576, now seen corresponding path program 10 times [2025-04-13 22:56:40,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:40,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365004160] [2025-04-13 22:56:40,306 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:56:40,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:40,311 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:56:40,318 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:56:40,318 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:56:40,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:40,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:40,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365004160] [2025-04-13 22:56:40,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365004160] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:56:40,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225148615] [2025-04-13 22:56:40,566 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:56:40,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:56:40,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:56:40,568 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:56:40,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 22:56:40,622 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:56:40,649 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:56:40,650 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:56:40,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:40,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 22:56:40,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:56:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:41,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:56:41,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:41,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225148615] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:56:41,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:56:41,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7, 7] total 21 [2025-04-13 22:56:41,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141481736] [2025-04-13 22:56:41,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:41,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:56:41,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:41,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:56:41,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:56:41,389 INFO L87 Difference]: Start difference. First operand 13878 states and 59453 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:45,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:45,195 INFO L93 Difference]: Finished difference Result 26957 states and 114040 transitions. [2025-04-13 22:56:45,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:56:45,196 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:45,196 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:45,316 INFO L225 Difference]: With dead ends: 26957 [2025-04-13 22:56:45,317 INFO L226 Difference]: Without dead ends: 26855 [2025-04-13 22:56:45,327 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=381, Invalid=1025, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:56:45,327 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 442 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:45,327 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 84 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:56:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26855 states. [2025-04-13 22:56:47,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26855 to 13890. [2025-04-13 22:56:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13890 states, 13889 states have (on average 4.284469724242206) internal successors, (59507), 13889 states have internal predecessors, (59507), 0 states have call successors, (0), 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 22:56:47,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13890 states to 13890 states and 59507 transitions. [2025-04-13 22:56:47,090 INFO L79 Accepts]: Start accepts. Automaton has 13890 states and 59507 transitions. Word has length 36 [2025-04-13 22:56:47,090 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:47,090 INFO L485 AbstractCegarLoop]: Abstraction has 13890 states and 59507 transitions. [2025-04-13 22:56:47,090 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:47,090 INFO L278 IsEmpty]: Start isEmpty. Operand 13890 states and 59507 transitions. [2025-04-13 22:56:47,116 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:56:47,116 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:47,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:47,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 22:56:47,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:56:47,317 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:47,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:47,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1546339920, now seen corresponding path program 11 times [2025-04-13 22:56:47,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:47,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632030015] [2025-04-13 22:56:47,318 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:56:47,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:47,322 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:56:47,329 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:56:47,329 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:56:47,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:47,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:47,488 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632030015] [2025-04-13 22:56:47,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632030015] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:47,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:47,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:56:47,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951000287] [2025-04-13 22:56:47,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:47,488 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:56:47,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:47,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:56:47,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:56:47,489 INFO L87 Difference]: Start difference. First operand 13890 states and 59507 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:50,307 INFO L93 Difference]: Finished difference Result 19678 states and 82540 transitions. [2025-04-13 22:56:50,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:56:50,307 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:50,307 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:50,392 INFO L225 Difference]: With dead ends: 19678 [2025-04-13 22:56:50,393 INFO L226 Difference]: Without dead ends: 18615 [2025-04-13 22:56:50,400 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:56:50,400 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 136 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:50,400 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 106 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:56:50,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18615 states. [2025-04-13 22:56:51,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18615 to 13596. [2025-04-13 22:56:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13596 states, 13595 states have (on average 4.273630011033468) internal successors, (58100), 13595 states have internal predecessors, (58100), 0 states have call successors, (0), 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 22:56:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13596 states to 13596 states and 58100 transitions. [2025-04-13 22:56:51,985 INFO L79 Accepts]: Start accepts. Automaton has 13596 states and 58100 transitions. Word has length 36 [2025-04-13 22:56:51,985 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:51,985 INFO L485 AbstractCegarLoop]: Abstraction has 13596 states and 58100 transitions. [2025-04-13 22:56:51,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:51,985 INFO L278 IsEmpty]: Start isEmpty. Operand 13596 states and 58100 transitions. [2025-04-13 22:56:52,011 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:56:52,011 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:52,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:52,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 22:56:52,012 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:52,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:52,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2008231082, now seen corresponding path program 12 times [2025-04-13 22:56:52,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:52,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966268678] [2025-04-13 22:56:52,012 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:56:52,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:52,017 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:56:52,021 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:56:52,021 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:56:52,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:52,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:56:52,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:52,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966268678] [2025-04-13 22:56:52,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966268678] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:52,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:52,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:56:52,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302753442] [2025-04-13 22:56:52,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:52,220 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:56:52,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:52,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:56:52,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:56:52,221 INFO L87 Difference]: Start difference. First operand 13596 states and 58100 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:54,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:54,795 INFO L93 Difference]: Finished difference Result 16719 states and 68864 transitions. [2025-04-13 22:56:54,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:56:54,795 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:54,795 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:54,867 INFO L225 Difference]: With dead ends: 16719 [2025-04-13 22:56:54,867 INFO L226 Difference]: Without dead ends: 16112 [2025-04-13 22:56:54,873 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:56:54,874 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 132 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:54,874 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 80 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:56:54,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16112 states. [2025-04-13 22:56:56,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16112 to 13694. [2025-04-13 22:56:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13694 states, 13693 states have (on average 4.261082304827284) internal successors, (58347), 13693 states have internal predecessors, (58347), 0 states have call successors, (0), 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 22:56:56,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13694 states to 13694 states and 58347 transitions. [2025-04-13 22:56:56,489 INFO L79 Accepts]: Start accepts. Automaton has 13694 states and 58347 transitions. Word has length 36 [2025-04-13 22:56:56,489 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:56,490 INFO L485 AbstractCegarLoop]: Abstraction has 13694 states and 58347 transitions. [2025-04-13 22:56:56,490 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:56,490 INFO L278 IsEmpty]: Start isEmpty. Operand 13694 states and 58347 transitions. [2025-04-13 22:56:56,518 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:56:56,518 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:56,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:56,518 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 22:56:56,519 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:56:56,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:56,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1746765476, now seen corresponding path program 13 times [2025-04-13 22:56:56,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:56,519 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160282191] [2025-04-13 22:56:56,519 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:56:56,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:56,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:56:56,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:56:56,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:56:56,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:56:56,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:56,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160282191] [2025-04-13 22:56:56,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160282191] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:56:56,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:56:56,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:56:56,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565797207] [2025-04-13 22:56:56,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:56:56,676 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:56:56,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:56,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:56:56,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:56:56,676 INFO L87 Difference]: Start difference. First operand 13694 states and 58347 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:56:59,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:59,275 INFO L93 Difference]: Finished difference Result 17123 states and 70861 transitions. [2025-04-13 22:56:59,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:56:59,275 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:56:59,275 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:59,350 INFO L225 Difference]: With dead ends: 17123 [2025-04-13 22:56:59,350 INFO L226 Difference]: Without dead ends: 16035 [2025-04-13 22:56:59,358 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:56:59,359 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 142 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:59,359 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 96 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:56:59,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16035 states. [2025-04-13 22:57:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16035 to 13680. [2025-04-13 22:57:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13680 states, 13679 states have (on average 4.2666861612690985) internal successors, (58364), 13679 states have internal predecessors, (58364), 0 states have call successors, (0), 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 22:57:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13680 states to 13680 states and 58364 transitions. [2025-04-13 22:57:00,977 INFO L79 Accepts]: Start accepts. Automaton has 13680 states and 58364 transitions. Word has length 36 [2025-04-13 22:57:00,978 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:00,978 INFO L485 AbstractCegarLoop]: Abstraction has 13680 states and 58364 transitions. [2025-04-13 22:57:00,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:00,978 INFO L278 IsEmpty]: Start isEmpty. Operand 13680 states and 58364 transitions. [2025-04-13 22:57:01,005 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:57:01,005 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:01,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:57:01,005 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 22:57:01,005 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:01,005 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:01,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1681883894, now seen corresponding path program 14 times [2025-04-13 22:57:01,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:01,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857027633] [2025-04-13 22:57:01,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:57:01,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:01,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:57:01,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:57:01,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:57:01,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:57:01,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:01,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857027633] [2025-04-13 22:57:01,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857027633] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:01,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:01,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:57:01,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415884891] [2025-04-13 22:57:01,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:01,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:57:01,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:01,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:57:01,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:57:01,188 INFO L87 Difference]: Start difference. First operand 13680 states and 58364 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:04,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:04,418 INFO L93 Difference]: Finished difference Result 20491 states and 87079 transitions. [2025-04-13 22:57:04,418 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:57:04,418 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:57:04,418 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:04,502 INFO L225 Difference]: With dead ends: 20491 [2025-04-13 22:57:04,502 INFO L226 Difference]: Without dead ends: 19428 [2025-04-13 22:57:04,508 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:57:04,509 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 134 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:04,509 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 78 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:57:04,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19428 states. [2025-04-13 22:57:06,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19428 to 13656. [2025-04-13 22:57:06,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13656 states, 13655 states have (on average 4.26832662028561) internal successors, (58284), 13655 states have internal predecessors, (58284), 0 states have call successors, (0), 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 22:57:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13656 states to 13656 states and 58284 transitions. [2025-04-13 22:57:06,257 INFO L79 Accepts]: Start accepts. Automaton has 13656 states and 58284 transitions. Word has length 36 [2025-04-13 22:57:06,257 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:06,257 INFO L485 AbstractCegarLoop]: Abstraction has 13656 states and 58284 transitions. [2025-04-13 22:57:06,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:06,257 INFO L278 IsEmpty]: Start isEmpty. Operand 13656 states and 58284 transitions. [2025-04-13 22:57:06,285 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:57:06,285 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:06,285 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:57:06,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 22:57:06,285 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:06,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:06,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1102961326, now seen corresponding path program 15 times [2025-04-13 22:57:06,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:06,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51335991] [2025-04-13 22:57:06,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:57:06,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:06,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:57:06,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:57:06,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:57:06,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:57:06,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:06,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51335991] [2025-04-13 22:57:06,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51335991] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:57:06,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271569278] [2025-04-13 22:57:06,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:57:06,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:57:06,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:57:06,457 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:57:06,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 22:57:06,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:57:06,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:57:06,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:57:06,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:06,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 22:57:06,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:57:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:57:06,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:57:06,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:57:06,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271569278] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:57:06,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:57:06,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 18 [2025-04-13 22:57:06,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183617730] [2025-04-13 22:57:06,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:57:06,760 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:57:06,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:06,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:57:06,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:57:06,761 INFO L87 Difference]: Start difference. First operand 13656 states and 58284 transitions. Second operand has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 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 22:57:15,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:15,835 INFO L93 Difference]: Finished difference Result 51507 states and 222789 transitions. [2025-04-13 22:57:15,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-04-13 22:57:15,836 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:57:15,836 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:16,049 INFO L225 Difference]: With dead ends: 51507 [2025-04-13 22:57:16,049 INFO L226 Difference]: Without dead ends: 47644 [2025-04-13 22:57:16,071 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3775 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2079, Invalid=8427, Unknown=0, NotChecked=0, Total=10506 [2025-04-13 22:57:16,072 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 1210 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 3103 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 3172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:16,072 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 716 Invalid, 3172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3103 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 22:57:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47644 states. [2025-04-13 22:57:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47644 to 16862. [2025-04-13 22:57:18,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16862 states, 16861 states have (on average 4.29672024197853) internal successors, (72447), 16861 states have internal predecessors, (72447), 0 states have call successors, (0), 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 22:57:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16862 states to 16862 states and 72447 transitions. [2025-04-13 22:57:18,703 INFO L79 Accepts]: Start accepts. Automaton has 16862 states and 72447 transitions. Word has length 36 [2025-04-13 22:57:18,703 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:18,703 INFO L485 AbstractCegarLoop]: Abstraction has 16862 states and 72447 transitions. [2025-04-13 22:57:18,703 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 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 22:57:18,703 INFO L278 IsEmpty]: Start isEmpty. Operand 16862 states and 72447 transitions. [2025-04-13 22:57:18,735 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:57:18,735 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:18,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:57:18,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 22:57:18,935 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:57:18,936 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:18,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:18,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1652351548, now seen corresponding path program 16 times [2025-04-13 22:57:18,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:18,936 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112925235] [2025-04-13 22:57:18,936 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:57:18,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:18,941 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:57:18,951 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:57:18,951 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:57:18,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:57:19,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:19,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112925235] [2025-04-13 22:57:19,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112925235] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:19,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:19,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:57:19,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465608046] [2025-04-13 22:57:19,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:19,172 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:57:19,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:19,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:57:19,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:57:19,172 INFO L87 Difference]: Start difference. First operand 16862 states and 72447 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:22,941 INFO L93 Difference]: Finished difference Result 21807 states and 90864 transitions. [2025-04-13 22:57:22,942 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:57:22,942 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:57:22,942 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:23,036 INFO L225 Difference]: With dead ends: 21807 [2025-04-13 22:57:23,037 INFO L226 Difference]: Without dead ends: 20441 [2025-04-13 22:57:23,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:57:23,047 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 124 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:23,047 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 91 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:57:23,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20441 states. [2025-04-13 22:57:25,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20441 to 16962. [2025-04-13 22:57:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16962 states, 16961 states have (on average 4.303814633571133) internal successors, (72997), 16961 states have internal predecessors, (72997), 0 states have call successors, (0), 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 22:57:25,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16962 states to 16962 states and 72997 transitions. [2025-04-13 22:57:25,362 INFO L79 Accepts]: Start accepts. Automaton has 16962 states and 72997 transitions. Word has length 36 [2025-04-13 22:57:25,362 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:25,362 INFO L485 AbstractCegarLoop]: Abstraction has 16962 states and 72997 transitions. [2025-04-13 22:57:25,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:25,362 INFO L278 IsEmpty]: Start isEmpty. Operand 16962 states and 72997 transitions. [2025-04-13 22:57:25,394 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:57:25,394 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:25,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:57:25,394 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 22:57:25,394 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:25,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:25,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1483554000, now seen corresponding path program 17 times [2025-04-13 22:57:25,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:25,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129052414] [2025-04-13 22:57:25,395 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:57:25,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:25,399 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:57:25,404 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:57:25,404 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:57:25,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:57:25,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:25,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129052414] [2025-04-13 22:57:25,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129052414] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:25,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:25,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:57:25,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830426588] [2025-04-13 22:57:25,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:25,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:57:25,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:25,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:57:25,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:57:25,584 INFO L87 Difference]: Start difference. First operand 16962 states and 72997 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:28,692 INFO L93 Difference]: Finished difference Result 18168 states and 77058 transitions. [2025-04-13 22:57:28,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:57:28,692 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:57:28,693 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:28,781 INFO L225 Difference]: With dead ends: 18168 [2025-04-13 22:57:28,781 INFO L226 Difference]: Without dead ends: 17324 [2025-04-13 22:57:28,787 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:57:28,788 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 85 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:28,788 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 85 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:57:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17324 states. [2025-04-13 22:57:30,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17324 to 16870. [2025-04-13 22:57:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16870 states, 16869 states have (on average 4.311518169423202) internal successors, (72731), 16869 states have internal predecessors, (72731), 0 states have call successors, (0), 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 22:57:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16870 states to 16870 states and 72731 transitions. [2025-04-13 22:57:30,934 INFO L79 Accepts]: Start accepts. Automaton has 16870 states and 72731 transitions. Word has length 36 [2025-04-13 22:57:30,934 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:30,934 INFO L485 AbstractCegarLoop]: Abstraction has 16870 states and 72731 transitions. [2025-04-13 22:57:30,934 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:30,934 INFO L278 IsEmpty]: Start isEmpty. Operand 16870 states and 72731 transitions. [2025-04-13 22:57:30,966 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:57:30,966 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:30,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:57:30,966 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 22:57:30,966 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:30,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:30,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1746647912, now seen corresponding path program 18 times [2025-04-13 22:57:30,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:30,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971927537] [2025-04-13 22:57:30,967 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:57:30,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:30,972 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:57:30,976 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:57:30,976 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:57:30,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:31,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:57:31,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:31,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971927537] [2025-04-13 22:57:31,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971927537] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:31,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:31,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:57:31,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65997338] [2025-04-13 22:57:31,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:31,097 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:57:31,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:31,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:57:31,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:57:31,098 INFO L87 Difference]: Start difference. First operand 16870 states and 72731 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:34,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:34,249 INFO L93 Difference]: Finished difference Result 19507 states and 83543 transitions. [2025-04-13 22:57:34,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:57:34,249 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:57:34,249 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:34,339 INFO L225 Difference]: With dead ends: 19507 [2025-04-13 22:57:34,339 INFO L226 Difference]: Without dead ends: 19428 [2025-04-13 22:57:34,346 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:57:34,346 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 80 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:34,346 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 83 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:57:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19428 states. [2025-04-13 22:57:36,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19428 to 16850. [2025-04-13 22:57:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16850 states, 16849 states have (on average 4.312956258531663) internal successors, (72669), 16849 states have internal predecessors, (72669), 0 states have call successors, (0), 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 22:57:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16850 states to 16850 states and 72669 transitions. [2025-04-13 22:57:36,543 INFO L79 Accepts]: Start accepts. Automaton has 16850 states and 72669 transitions. Word has length 36 [2025-04-13 22:57:36,543 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:36,543 INFO L485 AbstractCegarLoop]: Abstraction has 16850 states and 72669 transitions. [2025-04-13 22:57:36,543 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:36,543 INFO L278 IsEmpty]: Start isEmpty. Operand 16850 states and 72669 transitions. [2025-04-13 22:57:36,576 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:57:36,576 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:36,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:57:36,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 22:57:36,576 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:36,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:36,576 INFO L85 PathProgramCache]: Analyzing trace with hash 52478588, now seen corresponding path program 19 times [2025-04-13 22:57:36,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:36,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913077458] [2025-04-13 22:57:36,577 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:57:36,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:36,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:57:36,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:57:36,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:57:36,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:57:36,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:36,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913077458] [2025-04-13 22:57:36,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913077458] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:36,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:36,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:57:36,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138975981] [2025-04-13 22:57:36,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:36,799 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:57:36,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:36,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:57:36,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:57:36,799 INFO L87 Difference]: Start difference. First operand 16850 states and 72669 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:40,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:40,295 INFO L93 Difference]: Finished difference Result 20752 states and 88185 transitions. [2025-04-13 22:57:40,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:57:40,296 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:57:40,296 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:40,388 INFO L225 Difference]: With dead ends: 20752 [2025-04-13 22:57:40,388 INFO L226 Difference]: Without dead ends: 20693 [2025-04-13 22:57:40,393 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:57:40,393 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 104 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:40,394 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 80 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:57:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20693 states. [2025-04-13 22:57:42,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20693 to 16842. [2025-04-13 22:57:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16842 states, 16841 states have (on average 4.31357995368446) internal successors, (72645), 16841 states have internal predecessors, (72645), 0 states have call successors, (0), 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 22:57:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16842 states to 16842 states and 72645 transitions. [2025-04-13 22:57:42,620 INFO L79 Accepts]: Start accepts. Automaton has 16842 states and 72645 transitions. Word has length 36 [2025-04-13 22:57:42,621 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:42,621 INFO L485 AbstractCegarLoop]: Abstraction has 16842 states and 72645 transitions. [2025-04-13 22:57:42,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:42,621 INFO L278 IsEmpty]: Start isEmpty. Operand 16842 states and 72645 transitions. [2025-04-13 22:57:42,652 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:57:42,653 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:42,653 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:57:42,653 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 22:57:42,653 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:42,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:42,653 INFO L85 PathProgramCache]: Analyzing trace with hash 858717872, now seen corresponding path program 20 times [2025-04-13 22:57:42,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:42,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649385552] [2025-04-13 22:57:42,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:57:42,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:42,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:57:42,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:57:42,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:57:42,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:57:42,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:42,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649385552] [2025-04-13 22:57:42,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649385552] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:42,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:42,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:57:42,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501380013] [2025-04-13 22:57:42,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:42,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:57:42,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:42,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:57:42,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:57:42,852 INFO L87 Difference]: Start difference. First operand 16842 states and 72645 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:45,952 INFO L93 Difference]: Finished difference Result 18113 states and 76798 transitions. [2025-04-13 22:57:45,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:57:45,953 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:57:45,953 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:46,035 INFO L225 Difference]: With dead ends: 18113 [2025-04-13 22:57:46,035 INFO L226 Difference]: Without dead ends: 17460 [2025-04-13 22:57:46,042 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:57:46,043 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 61 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:46,043 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 89 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:57:46,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17460 states. [2025-04-13 22:57:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17460 to 16930. [2025-04-13 22:57:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16930 states, 16929 states have (on average 4.3036800756099005) internal successors, (72857), 16929 states have internal predecessors, (72857), 0 states have call successors, (0), 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 22:57:48,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16930 states to 16930 states and 72857 transitions. [2025-04-13 22:57:48,267 INFO L79 Accepts]: Start accepts. Automaton has 16930 states and 72857 transitions. Word has length 36 [2025-04-13 22:57:48,268 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:48,268 INFO L485 AbstractCegarLoop]: Abstraction has 16930 states and 72857 transitions. [2025-04-13 22:57:48,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:48,268 INFO L278 IsEmpty]: Start isEmpty. Operand 16930 states and 72857 transitions. [2025-04-13 22:57:48,304 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:57:48,304 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:48,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:57:48,304 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 22:57:48,304 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:48,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:48,304 INFO L85 PathProgramCache]: Analyzing trace with hash 308790644, now seen corresponding path program 21 times [2025-04-13 22:57:48,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:48,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889604321] [2025-04-13 22:57:48,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:57:48,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:48,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:57:48,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:57:48,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:57:48,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:57:48,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:48,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889604321] [2025-04-13 22:57:48,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889604321] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:48,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:48,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:57:48,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521722307] [2025-04-13 22:57:48,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:48,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:57:48,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:48,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:57:48,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:57:48,431 INFO L87 Difference]: Start difference. First operand 16930 states and 72857 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:51,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:51,117 INFO L93 Difference]: Finished difference Result 17864 states and 75968 transitions. [2025-04-13 22:57:51,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:57:51,117 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:57:51,117 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:51,208 INFO L225 Difference]: With dead ends: 17864 [2025-04-13 22:57:51,209 INFO L226 Difference]: Without dead ends: 16451 [2025-04-13 22:57:51,217 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:57:51,218 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 59 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:51,218 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 75 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:57:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16451 states. [2025-04-13 22:57:53,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16451 to 16395. [2025-04-13 22:57:53,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16395 states, 16394 states have (on average 4.336647553983164) internal successors, (71095), 16394 states have internal predecessors, (71095), 0 states have call successors, (0), 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 22:57:53,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16395 states to 16395 states and 71095 transitions. [2025-04-13 22:57:53,459 INFO L79 Accepts]: Start accepts. Automaton has 16395 states and 71095 transitions. Word has length 36 [2025-04-13 22:57:53,459 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:53,459 INFO L485 AbstractCegarLoop]: Abstraction has 16395 states and 71095 transitions. [2025-04-13 22:57:53,459 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:53,459 INFO L278 IsEmpty]: Start isEmpty. Operand 16395 states and 71095 transitions. [2025-04-13 22:57:53,491 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:57:53,491 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:53,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:57:53,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 22:57:53,492 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:53,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:53,492 INFO L85 PathProgramCache]: Analyzing trace with hash -15651929, now seen corresponding path program 1 times [2025-04-13 22:57:53,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:53,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572100876] [2025-04-13 22:57:53,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:57:53,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:53,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:57:53,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:57:53,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:57:53,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:57:53,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:53,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572100876] [2025-04-13 22:57:53,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572100876] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:53,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:53,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:57:53,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819079839] [2025-04-13 22:57:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:53,839 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:57:53,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:53,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:57:53,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:57:53,839 INFO L87 Difference]: Start difference. First operand 16395 states and 71095 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:57:56,498 INFO L93 Difference]: Finished difference Result 17160 states and 73499 transitions. [2025-04-13 22:57:56,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:57:56,498 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:57:56,498 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:57:56,579 INFO L225 Difference]: With dead ends: 17160 [2025-04-13 22:57:56,579 INFO L226 Difference]: Without dead ends: 16333 [2025-04-13 22:57:56,586 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:57:56,586 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 67 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:57:56,586 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 64 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:57:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16333 states. [2025-04-13 22:57:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16333 to 16305. [2025-04-13 22:57:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16305 states, 16304 states have (on average 4.33114573110893) internal successors, (70615), 16304 states have internal predecessors, (70615), 0 states have call successors, (0), 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 22:57:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16305 states to 16305 states and 70615 transitions. [2025-04-13 22:57:58,885 INFO L79 Accepts]: Start accepts. Automaton has 16305 states and 70615 transitions. Word has length 36 [2025-04-13 22:57:58,885 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:57:58,885 INFO L485 AbstractCegarLoop]: Abstraction has 16305 states and 70615 transitions. [2025-04-13 22:57:58,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:57:58,885 INFO L278 IsEmpty]: Start isEmpty. Operand 16305 states and 70615 transitions. [2025-04-13 22:57:58,916 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:57:58,916 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:57:58,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:57:58,916 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 22:57:58,916 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:57:58,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:57:58,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1203934207, now seen corresponding path program 2 times [2025-04-13 22:57:58,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:57:58,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222802419] [2025-04-13 22:57:58,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:57:58,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:57:58,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:57:58,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:57:58,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:57:58,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:57:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:57:59,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:57:59,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222802419] [2025-04-13 22:57:59,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222802419] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:57:59,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:57:59,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:57:59,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583105586] [2025-04-13 22:57:59,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:57:59,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:57:59,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:57:59,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:57:59,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:57:59,059 INFO L87 Difference]: Start difference. First operand 16305 states and 70615 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:02,128 INFO L93 Difference]: Finished difference Result 17140 states and 73416 transitions. [2025-04-13 22:58:02,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:58:02,129 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:58:02,129 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:02,211 INFO L225 Difference]: With dead ends: 17140 [2025-04-13 22:58:02,211 INFO L226 Difference]: Without dead ends: 16431 [2025-04-13 22:58:02,218 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:58:02,218 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 70 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:02,219 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 62 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:58:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16431 states. [2025-04-13 22:58:04,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16431 to 16075. [2025-04-13 22:58:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16075 states, 16074 states have (on average 4.3361950976732615) internal successors, (69700), 16074 states have internal predecessors, (69700), 0 states have call successors, (0), 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 22:58:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16075 states to 16075 states and 69700 transitions. [2025-04-13 22:58:04,380 INFO L79 Accepts]: Start accepts. Automaton has 16075 states and 69700 transitions. Word has length 36 [2025-04-13 22:58:04,380 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:04,380 INFO L485 AbstractCegarLoop]: Abstraction has 16075 states and 69700 transitions. [2025-04-13 22:58:04,380 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:04,380 INFO L278 IsEmpty]: Start isEmpty. Operand 16075 states and 69700 transitions. [2025-04-13 22:58:04,410 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:58:04,410 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:04,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:58:04,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 22:58:04,411 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:58:04,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:04,411 INFO L85 PathProgramCache]: Analyzing trace with hash 951175961, now seen corresponding path program 3 times [2025-04-13 22:58:04,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:04,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402724805] [2025-04-13 22:58:04,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:58:04,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:04,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:58:04,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:58:04,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:58:04,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:04,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:58:04,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:04,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402724805] [2025-04-13 22:58:04,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402724805] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:58:04,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:58:04,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:58:04,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630970479] [2025-04-13 22:58:04,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:58:04,573 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:58:04,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:04,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:58:04,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:58:04,574 INFO L87 Difference]: Start difference. First operand 16075 states and 69700 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:08,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:08,051 INFO L93 Difference]: Finished difference Result 20610 states and 88882 transitions. [2025-04-13 22:58:08,052 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:58:08,052 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:58:08,052 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:08,241 INFO L225 Difference]: With dead ends: 20610 [2025-04-13 22:58:08,241 INFO L226 Difference]: Without dead ends: 19483 [2025-04-13 22:58:08,247 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:58:08,247 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 118 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:08,248 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 98 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:58:08,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19483 states. [2025-04-13 22:58:10,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19483 to 16569. [2025-04-13 22:58:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16569 states, 16568 states have (on average 4.344760985031386) internal successors, (71984), 16568 states have internal predecessors, (71984), 0 states have call successors, (0), 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 22:58:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16569 states to 16569 states and 71984 transitions. [2025-04-13 22:58:10,562 INFO L79 Accepts]: Start accepts. Automaton has 16569 states and 71984 transitions. Word has length 36 [2025-04-13 22:58:10,562 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:10,562 INFO L485 AbstractCegarLoop]: Abstraction has 16569 states and 71984 transitions. [2025-04-13 22:58:10,562 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:10,562 INFO L278 IsEmpty]: Start isEmpty. Operand 16569 states and 71984 transitions. [2025-04-13 22:58:10,594 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:58:10,594 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:10,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:58:10,594 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 22:58:10,594 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:58:10,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:10,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2006129439, now seen corresponding path program 4 times [2025-04-13 22:58:10,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:10,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295921038] [2025-04-13 22:58:10,595 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:58:10,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:10,599 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:58:10,605 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:58:10,605 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:58:10,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:58:10,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:10,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295921038] [2025-04-13 22:58:10,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295921038] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:58:10,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:58:10,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:58:10,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074937973] [2025-04-13 22:58:10,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:58:10,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:58:10,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:10,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:58:10,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:58:10,757 INFO L87 Difference]: Start difference. First operand 16569 states and 71984 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:15,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:15,648 INFO L93 Difference]: Finished difference Result 25237 states and 108055 transitions. [2025-04-13 22:58:15,648 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:58:15,648 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:58:15,648 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:15,761 INFO L225 Difference]: With dead ends: 25237 [2025-04-13 22:58:15,762 INFO L226 Difference]: Without dead ends: 23933 [2025-04-13 22:58:15,771 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:58:15,772 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 163 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:15,772 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 86 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:58:15,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23933 states. [2025-04-13 22:58:18,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23933 to 17726. [2025-04-13 22:58:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17726 states, 17725 states have (on average 4.376361071932299) internal successors, (77571), 17725 states have internal predecessors, (77571), 0 states have call successors, (0), 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 22:58:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17726 states to 17726 states and 77571 transitions. [2025-04-13 22:58:18,796 INFO L79 Accepts]: Start accepts. Automaton has 17726 states and 77571 transitions. Word has length 36 [2025-04-13 22:58:18,796 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:18,796 INFO L485 AbstractCegarLoop]: Abstraction has 17726 states and 77571 transitions. [2025-04-13 22:58:18,796 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:18,796 INFO L278 IsEmpty]: Start isEmpty. Operand 17726 states and 77571 transitions. [2025-04-13 22:58:18,833 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:58:18,833 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:18,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:58:18,833 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 22:58:18,833 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:58:18,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:18,834 INFO L85 PathProgramCache]: Analyzing trace with hash 943271953, now seen corresponding path program 5 times [2025-04-13 22:58:18,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:18,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314866368] [2025-04-13 22:58:18,834 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:58:18,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:18,838 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:58:18,843 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:58:18,843 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:58:18,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:58:18,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:18,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314866368] [2025-04-13 22:58:18,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314866368] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:58:18,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:58:18,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:58:18,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729756385] [2025-04-13 22:58:18,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:58:18,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:58:18,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:18,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:58:18,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:58:18,967 INFO L87 Difference]: Start difference. First operand 17726 states and 77571 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:24,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:24,077 INFO L93 Difference]: Finished difference Result 26141 states and 114603 transitions. [2025-04-13 22:58:24,077 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:58:24,077 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:58:24,077 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:24,184 INFO L225 Difference]: With dead ends: 26141 [2025-04-13 22:58:24,184 INFO L226 Difference]: Without dead ends: 23133 [2025-04-13 22:58:24,195 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:58:24,196 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 122 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:24,196 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 83 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:58:24,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23133 states. [2025-04-13 22:58:27,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23133 to 17540. [2025-04-13 22:58:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17540 states, 17539 states have (on average 4.387593363361651) internal successors, (76954), 17539 states have internal predecessors, (76954), 0 states have call successors, (0), 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 22:58:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17540 states to 17540 states and 76954 transitions. [2025-04-13 22:58:27,141 INFO L79 Accepts]: Start accepts. Automaton has 17540 states and 76954 transitions. Word has length 36 [2025-04-13 22:58:27,141 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:27,141 INFO L485 AbstractCegarLoop]: Abstraction has 17540 states and 76954 transitions. [2025-04-13 22:58:27,141 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:27,141 INFO L278 IsEmpty]: Start isEmpty. Operand 17540 states and 76954 transitions. [2025-04-13 22:58:27,175 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:58:27,176 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:27,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:58:27,176 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 22:58:27,176 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:58:27,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:27,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1494943555, now seen corresponding path program 6 times [2025-04-13 22:58:27,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:27,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138920844] [2025-04-13 22:58:27,176 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:58:27,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:27,181 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:58:27,186 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:58:27,186 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:58:27,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:58:27,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:27,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138920844] [2025-04-13 22:58:27,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138920844] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:58:27,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:58:27,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:58:27,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10572492] [2025-04-13 22:58:27,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:58:27,285 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:58:27,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:27,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:58:27,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:58:27,285 INFO L87 Difference]: Start difference. First operand 17540 states and 76954 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:31,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:31,153 INFO L93 Difference]: Finished difference Result 19395 states and 83663 transitions. [2025-04-13 22:58:31,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:58:31,154 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:58:31,154 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:31,249 INFO L225 Difference]: With dead ends: 19395 [2025-04-13 22:58:31,249 INFO L226 Difference]: Without dead ends: 18472 [2025-04-13 22:58:31,256 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:58:31,257 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 88 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:31,257 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 76 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:58:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18472 states. [2025-04-13 22:58:34,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18472 to 17808. [2025-04-13 22:58:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17808 states, 17807 states have (on average 4.364519570955243) internal successors, (77719), 17807 states have internal predecessors, (77719), 0 states have call successors, (0), 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 22:58:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17808 states to 17808 states and 77719 transitions. [2025-04-13 22:58:34,458 INFO L79 Accepts]: Start accepts. Automaton has 17808 states and 77719 transitions. Word has length 36 [2025-04-13 22:58:34,458 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:34,458 INFO L485 AbstractCegarLoop]: Abstraction has 17808 states and 77719 transitions. [2025-04-13 22:58:34,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:34,458 INFO L278 IsEmpty]: Start isEmpty. Operand 17808 states and 77719 transitions. [2025-04-13 22:58:34,493 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:58:34,493 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:34,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:58:34,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 22:58:34,493 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:58:34,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:34,493 INFO L85 PathProgramCache]: Analyzing trace with hash 207080595, now seen corresponding path program 7 times [2025-04-13 22:58:34,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:34,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568974808] [2025-04-13 22:58:34,494 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:58:34,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:34,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:58:34,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:58:34,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:58:34,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:58:34,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:34,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568974808] [2025-04-13 22:58:34,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568974808] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:58:34,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:58:34,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:58:34,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852118816] [2025-04-13 22:58:34,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:58:34,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:58:34,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:34,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:58:34,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:58:34,652 INFO L87 Difference]: Start difference. First operand 17808 states and 77719 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:38,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:38,873 INFO L93 Difference]: Finished difference Result 20909 states and 88464 transitions. [2025-04-13 22:58:38,873 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:58:38,873 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:58:38,873 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:38,971 INFO L225 Difference]: With dead ends: 20909 [2025-04-13 22:58:38,971 INFO L226 Difference]: Without dead ends: 18731 [2025-04-13 22:58:38,980 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:58:38,981 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 108 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:38,981 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 64 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:58:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18731 states. [2025-04-13 22:58:42,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18731 to 18235. [2025-04-13 22:58:42,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18235 states, 18234 states have (on average 4.342217834814083) internal successors, (79176), 18234 states have internal predecessors, (79176), 0 states have call successors, (0), 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 22:58:42,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18235 states to 18235 states and 79176 transitions. [2025-04-13 22:58:42,125 INFO L79 Accepts]: Start accepts. Automaton has 18235 states and 79176 transitions. Word has length 36 [2025-04-13 22:58:42,125 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:42,125 INFO L485 AbstractCegarLoop]: Abstraction has 18235 states and 79176 transitions. [2025-04-13 22:58:42,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:42,125 INFO L278 IsEmpty]: Start isEmpty. Operand 18235 states and 79176 transitions. [2025-04-13 22:58:42,161 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:58:42,161 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:42,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:58:42,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 22:58:42,161 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:58:42,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:42,161 INFO L85 PathProgramCache]: Analyzing trace with hash -991108517, now seen corresponding path program 8 times [2025-04-13 22:58:42,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:42,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987448046] [2025-04-13 22:58:42,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:58:42,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:42,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:58:42,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:58:42,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:58:42,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:58:42,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:42,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987448046] [2025-04-13 22:58:42,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987448046] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:58:42,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:58:42,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:58:42,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205670763] [2025-04-13 22:58:42,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:58:42,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:58:42,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:42,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:58:42,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:58:42,329 INFO L87 Difference]: Start difference. First operand 18235 states and 79176 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:47,875 INFO L93 Difference]: Finished difference Result 24041 states and 102222 transitions. [2025-04-13 22:58:47,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:58:47,876 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:58:47,876 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:47,990 INFO L225 Difference]: With dead ends: 24041 [2025-04-13 22:58:47,990 INFO L226 Difference]: Without dead ends: 22621 [2025-04-13 22:58:47,999 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:58:47,999 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 141 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:47,999 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 80 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:58:48,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22621 states. [2025-04-13 22:58:51,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22621 to 18427. [2025-04-13 22:58:51,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18427 states, 18426 states have (on average 4.3275263215022255) internal successors, (79739), 18426 states have internal predecessors, (79739), 0 states have call successors, (0), 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 22:58:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18427 states to 18427 states and 79739 transitions. [2025-04-13 22:58:51,406 INFO L79 Accepts]: Start accepts. Automaton has 18427 states and 79739 transitions. Word has length 36 [2025-04-13 22:58:51,406 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:51,406 INFO L485 AbstractCegarLoop]: Abstraction has 18427 states and 79739 transitions. [2025-04-13 22:58:51,406 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:51,406 INFO L278 IsEmpty]: Start isEmpty. Operand 18427 states and 79739 transitions. [2025-04-13 22:58:51,447 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:58:51,447 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:51,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:58:51,448 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 22:58:51,448 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:58:51,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1135441291, now seen corresponding path program 9 times [2025-04-13 22:58:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:51,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616236383] [2025-04-13 22:58:51,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:58:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:51,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:58:51,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:58:51,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:58:51,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:58:51,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:51,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616236383] [2025-04-13 22:58:51,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616236383] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:58:51,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:58:51,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:58:51,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589113296] [2025-04-13 22:58:51,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:58:51,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:58:51,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:51,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:58:51,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:58:51,609 INFO L87 Difference]: Start difference. First operand 18427 states and 79739 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:58:58,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:58,237 INFO L93 Difference]: Finished difference Result 27342 states and 117296 transitions. [2025-04-13 22:58:58,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:58:58,237 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:58:58,237 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:58,375 INFO L225 Difference]: With dead ends: 27342 [2025-04-13 22:58:58,375 INFO L226 Difference]: Without dead ends: 26104 [2025-04-13 22:58:58,386 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:58:58,386 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 158 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:58,386 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 108 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:58:58,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26104 states. [2025-04-13 22:59:01,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26104 to 17983. [2025-04-13 22:59:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17983 states, 17982 states have (on average 4.3205983761539315) internal successors, (77693), 17982 states have internal predecessors, (77693), 0 states have call successors, (0), 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 22:59:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17983 states to 17983 states and 77693 transitions. [2025-04-13 22:59:01,787 INFO L79 Accepts]: Start accepts. Automaton has 17983 states and 77693 transitions. Word has length 36 [2025-04-13 22:59:01,787 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:01,787 INFO L485 AbstractCegarLoop]: Abstraction has 17983 states and 77693 transitions. [2025-04-13 22:59:01,787 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:01,787 INFO L278 IsEmpty]: Start isEmpty. Operand 17983 states and 77693 transitions. [2025-04-13 22:59:01,823 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:59:01,823 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:01,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:01,823 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 22:59:01,823 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:59:01,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:01,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1179918835, now seen corresponding path program 10 times [2025-04-13 22:59:01,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:01,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917195459] [2025-04-13 22:59:01,824 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:59:01,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:01,828 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:59:01,833 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:59:01,833 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:59:01,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:01,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:01,947 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917195459] [2025-04-13 22:59:01,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917195459] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:01,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:01,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:59:01,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90738146] [2025-04-13 22:59:01,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:01,947 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:59:01,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:01,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:59:01,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:59:01,948 INFO L87 Difference]: Start difference. First operand 17983 states and 77693 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:08,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:08,365 INFO L93 Difference]: Finished difference Result 30287 states and 129480 transitions. [2025-04-13 22:59:08,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:59:08,365 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:59:08,365 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:08,500 INFO L225 Difference]: With dead ends: 30287 [2025-04-13 22:59:08,500 INFO L226 Difference]: Without dead ends: 27896 [2025-04-13 22:59:08,514 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:59:08,514 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 192 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:08,514 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 90 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:59:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27896 states. [2025-04-13 22:59:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27896 to 17378. [2025-04-13 22:59:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17378 states, 17377 states have (on average 4.346319848075042) internal successors, (75526), 17377 states have internal predecessors, (75526), 0 states have call successors, (0), 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 22:59:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17378 states to 17378 states and 75526 transitions. [2025-04-13 22:59:11,715 INFO L79 Accepts]: Start accepts. Automaton has 17378 states and 75526 transitions. Word has length 36 [2025-04-13 22:59:11,716 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:11,716 INFO L485 AbstractCegarLoop]: Abstraction has 17378 states and 75526 transitions. [2025-04-13 22:59:11,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:11,716 INFO L278 IsEmpty]: Start isEmpty. Operand 17378 states and 75526 transitions. [2025-04-13 22:59:11,751 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:59:11,751 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:11,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:11,751 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 22:59:11,751 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:59:11,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:11,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1400236691, now seen corresponding path program 11 times [2025-04-13 22:59:11,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:11,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163332167] [2025-04-13 22:59:11,752 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:59:11,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:11,756 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:59:11,760 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:59:11,760 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:59:11,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:11,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:11,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163332167] [2025-04-13 22:59:11,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163332167] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:11,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:11,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:59:11,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88114371] [2025-04-13 22:59:11,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:11,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:59:11,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:11,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:59:11,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:59:11,875 INFO L87 Difference]: Start difference. First operand 17378 states and 75526 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:15,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:15,897 INFO L93 Difference]: Finished difference Result 18399 states and 79050 transitions. [2025-04-13 22:59:15,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:59:15,897 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:59:15,897 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:15,988 INFO L225 Difference]: With dead ends: 18399 [2025-04-13 22:59:15,989 INFO L226 Difference]: Without dead ends: 17302 [2025-04-13 22:59:15,995 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:59:15,996 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 52 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:15,996 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 79 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:59:16,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17302 states. [2025-04-13 22:59:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17302 to 17302. [2025-04-13 22:59:19,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17302 states, 17301 states have (on average 4.351540373388821) internal successors, (75286), 17301 states have internal predecessors, (75286), 0 states have call successors, (0), 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 22:59:19,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17302 states to 17302 states and 75286 transitions. [2025-04-13 22:59:19,084 INFO L79 Accepts]: Start accepts. Automaton has 17302 states and 75286 transitions. Word has length 36 [2025-04-13 22:59:19,084 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:19,084 INFO L485 AbstractCegarLoop]: Abstraction has 17302 states and 75286 transitions. [2025-04-13 22:59:19,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:19,085 INFO L278 IsEmpty]: Start isEmpty. Operand 17302 states and 75286 transitions. [2025-04-13 22:59:19,118 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:59:19,118 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:19,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:19,119 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 22:59:19,119 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:59:19,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:19,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1077144559, now seen corresponding path program 12 times [2025-04-13 22:59:19,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:19,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646143545] [2025-04-13 22:59:19,119 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:59:19,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:19,124 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:59:19,127 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:59:19,127 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:59:19,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:19,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646143545] [2025-04-13 22:59:19,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646143545] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:19,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:19,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:59:19,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018286063] [2025-04-13 22:59:19,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:19,229 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:59:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:19,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:59:19,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:59:19,229 INFO L87 Difference]: Start difference. First operand 17302 states and 75286 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:23,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:23,154 INFO L93 Difference]: Finished difference Result 19189 states and 81604 transitions. [2025-04-13 22:59:23,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:59:23,155 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:59:23,155 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:23,250 INFO L225 Difference]: With dead ends: 19189 [2025-04-13 22:59:23,250 INFO L226 Difference]: Without dead ends: 17262 [2025-04-13 22:59:23,258 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:59:23,258 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 55 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:23,258 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 66 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:59:23,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17262 states. [2025-04-13 22:59:26,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17262 to 17262. [2025-04-13 22:59:26,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17262 states, 17261 states have (on average 4.351196338566711) internal successors, (75106), 17261 states have internal predecessors, (75106), 0 states have call successors, (0), 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 22:59:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17262 states to 17262 states and 75106 transitions. [2025-04-13 22:59:26,690 INFO L79 Accepts]: Start accepts. Automaton has 17262 states and 75106 transitions. Word has length 36 [2025-04-13 22:59:26,691 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:26,691 INFO L485 AbstractCegarLoop]: Abstraction has 17262 states and 75106 transitions. [2025-04-13 22:59:26,691 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:26,691 INFO L278 IsEmpty]: Start isEmpty. Operand 17262 states and 75106 transitions. [2025-04-13 22:59:26,724 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:59:26,724 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:26,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:26,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 22:59:26,725 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:59:26,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:26,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1260393847, now seen corresponding path program 13 times [2025-04-13 22:59:26,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:26,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126520635] [2025-04-13 22:59:26,725 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:59:26,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:26,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:59:26,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:59:26,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:26,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:26,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:26,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126520635] [2025-04-13 22:59:26,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126520635] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:26,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:26,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:59:26,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048041998] [2025-04-13 22:59:26,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:26,851 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:59:26,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:26,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:59:26,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:59:26,851 INFO L87 Difference]: Start difference. First operand 17262 states and 75106 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:31,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:31,043 INFO L93 Difference]: Finished difference Result 20399 states and 85677 transitions. [2025-04-13 22:59:31,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:59:31,043 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:59:31,043 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:31,136 INFO L225 Difference]: With dead ends: 20399 [2025-04-13 22:59:31,136 INFO L226 Difference]: Without dead ends: 18273 [2025-04-13 22:59:31,143 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:59:31,144 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 91 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:31,144 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 58 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:59:31,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18273 states. [2025-04-13 22:59:34,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18273 to 17867. [2025-04-13 22:59:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17867 states, 17866 states have (on average 4.31355647598791) internal successors, (77066), 17866 states have internal predecessors, (77066), 0 states have call successors, (0), 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 22:59:34,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17867 states to 17867 states and 77066 transitions. [2025-04-13 22:59:34,548 INFO L79 Accepts]: Start accepts. Automaton has 17867 states and 77066 transitions. Word has length 36 [2025-04-13 22:59:34,548 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:34,548 INFO L485 AbstractCegarLoop]: Abstraction has 17867 states and 77066 transitions. [2025-04-13 22:59:34,548 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:34,548 INFO L278 IsEmpty]: Start isEmpty. Operand 17867 states and 77066 transitions. [2025-04-13 22:59:34,583 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:59:34,583 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:34,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:34,583 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 22:59:34,583 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:59:34,584 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:34,584 INFO L85 PathProgramCache]: Analyzing trace with hash 650756199, now seen corresponding path program 14 times [2025-04-13 22:59:34,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:34,584 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485379500] [2025-04-13 22:59:34,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:59:34,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:34,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:59:34,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 22:59:34,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:59:34,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:34,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:34,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485379500] [2025-04-13 22:59:34,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485379500] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:34,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:34,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:59:34,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459917602] [2025-04-13 22:59:34,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:34,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:59:34,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:34,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:59:34,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:59:34,734 INFO L87 Difference]: Start difference. First operand 17867 states and 77066 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:38,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:38,989 INFO L93 Difference]: Finished difference Result 19555 states and 83243 transitions. [2025-04-13 22:59:38,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:59:38,989 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:59:38,989 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:39,084 INFO L225 Difference]: With dead ends: 19555 [2025-04-13 22:59:39,084 INFO L226 Difference]: Without dead ends: 18678 [2025-04-13 22:59:39,090 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:59:39,090 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 98 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:39,090 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 154 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:59:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18678 states. [2025-04-13 22:59:42,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18678 to 17945. [2025-04-13 22:59:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17945 states, 17944 states have (on average 4.308403923316986) internal successors, (77310), 17944 states have internal predecessors, (77310), 0 states have call successors, (0), 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 22:59:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17945 states to 17945 states and 77310 transitions. [2025-04-13 22:59:42,298 INFO L79 Accepts]: Start accepts. Automaton has 17945 states and 77310 transitions. Word has length 36 [2025-04-13 22:59:42,299 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:42,299 INFO L485 AbstractCegarLoop]: Abstraction has 17945 states and 77310 transitions. [2025-04-13 22:59:42,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:42,299 INFO L278 IsEmpty]: Start isEmpty. Operand 17945 states and 77310 transitions. [2025-04-13 22:59:42,333 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:59:42,334 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:42,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:42,334 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 22:59:42,334 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:59:42,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:42,334 INFO L85 PathProgramCache]: Analyzing trace with hash -308138203, now seen corresponding path program 15 times [2025-04-13 22:59:42,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:42,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731158398] [2025-04-13 22:59:42,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:59:42,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:42,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:59:42,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 36 statements. [2025-04-13 22:59:42,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:59:42,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:42,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:59:42,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:42,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731158398] [2025-04-13 22:59:42,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731158398] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:42,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:42,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:59:42,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010791383] [2025-04-13 22:59:42,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:42,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:59:42,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:42,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:59:42,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:59:42,480 INFO L87 Difference]: Start difference. First operand 17945 states and 77310 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:48,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:48,315 INFO L93 Difference]: Finished difference Result 26030 states and 111661 transitions. [2025-04-13 22:59:48,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:59:48,315 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 22:59:48,315 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:48,432 INFO L225 Difference]: With dead ends: 26030 [2025-04-13 22:59:48,432 INFO L226 Difference]: Without dead ends: 22915 [2025-04-13 22:59:48,442 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:59:48,443 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 121 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:48,443 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 97 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:59:48,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22915 states. [2025-04-13 22:59:51,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22915 to 15448. [2025-04-13 22:59:51,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15448 states, 15447 states have (on average 4.362594678578365) internal successors, (67389), 15447 states have internal predecessors, (67389), 0 states have call successors, (0), 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 22:59:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15448 states to 15448 states and 67389 transitions. [2025-04-13 22:59:51,310 INFO L79 Accepts]: Start accepts. Automaton has 15448 states and 67389 transitions. Word has length 36 [2025-04-13 22:59:51,310 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:51,310 INFO L485 AbstractCegarLoop]: Abstraction has 15448 states and 67389 transitions. [2025-04-13 22:59:51,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:51,310 INFO L278 IsEmpty]: Start isEmpty. Operand 15448 states and 67389 transitions. [2025-04-13 22:59:51,342 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:59:51,342 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:51,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:51,342 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 22:59:51,342 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:59:51,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:51,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1086940738, now seen corresponding path program 1 times [2025-04-13 22:59:51,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:51,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706198869] [2025-04-13 22:59:51,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:59:51,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:51,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 22:59:51,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:59:51,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:51,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 22:59:51,359 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 22:59:51,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 22:59:51,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:59:51,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:51,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 22:59:51,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 22:59:51,399 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 22:59:51,400 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 22:59:51,401 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 22:59:51,401 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 22:59:51,401 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 22:59:51,401 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 22:59:51,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-13 22:59:51,405 INFO L422 BasicCegarLoop]: Path program histogram: [21, 15, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:51,487 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:59:51,487 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:59:51,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:59:51 BasicIcfg [2025-04-13 22:59:51,490 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:59:51,490 INFO L158 Benchmark]: Toolchain (without parser) took 227689.58ms. Allocated memory was 142.6MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 100.0MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-04-13 22:59:51,490 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:59:51,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.12ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 84.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 22:59:51,490 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.98ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 81.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:59:51,490 INFO L158 Benchmark]: Boogie Preprocessor took 51.92ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 78.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:59:51,490 INFO L158 Benchmark]: IcfgBuilder took 761.34ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 45.6MB in the end (delta: 33.0MB). Peak memory consumption was 61.7MB. Max. memory is 8.0GB. [2025-04-13 22:59:51,491 INFO L158 Benchmark]: TraceAbstraction took 226583.43ms. Allocated memory was 142.6MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 44.9MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-04-13 22:59:51,491 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.12ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 84.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.98ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 81.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 51.92ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 78.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 761.34ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 45.6MB in the end (delta: 33.0MB). Peak memory consumption was 61.7MB. Max. memory is 8.0GB. * TraceAbstraction took 226583.43ms. Allocated memory was 142.6MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 44.9MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 152]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int *q1, *q2; [L42] 0 int q1_front, q1_back, q2_front, q2_back, i, j, n1, n2, N, C, total; [L126] 0 pthread_t t1, t2, t3, t4; [L128] 0 C = __VERIFIER_nondet_int() [L129] 0 N = __VERIFIER_nondet_int() [L130] 0 n1 = __VERIFIER_nondet_int() [L131] 0 n2 = __VERIFIER_nondet_int() [L132] 0 q1_front = __VERIFIER_nondet_int() [L133] 0 q1_back = q1_front [L134] 0 q2_front = __VERIFIER_nondet_int() [L135] 0 q2_back = q2_front [L136] CALL, EXPR 0 create_fresh_int_array(n1) [L158] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L158] RET 0 assume_abort_if_not(size >= 0) [L159] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L159] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L161] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L162] 0 int i = 0; VAL [C=-5, N=1, \at(size, Pre)=1, arr={-3:0}, i=0, i=0, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L162] COND TRUE 0 i < size [L163] 0 arr[i] = __VERIFIER_nondet_int() [L162] 0 i++ VAL [C=-5, N=1, \at(size, Pre)=1, arr={-3:0}, i=0, i=1, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L162] COND FALSE 0 !(i < size) [L165] 0 return arr; [L136] RET, EXPR 0 create_fresh_int_array(n1) [L136] 0 q1 = create_fresh_int_array(n1) [L137] CALL, EXPR 0 create_fresh_int_array(n2) [L158] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L158] RET 0 assume_abort_if_not(size >= 0) [L159] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L159] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L161] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L162] 0 int i = 0; VAL [C=-5, N=1, \at(size, Pre)=1, arr={-4:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-3:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L162] COND TRUE 0 i < size [L163] 0 arr[i] = __VERIFIER_nondet_int() [L162] 0 i++ VAL [C=-5, N=1, \at(size, Pre)=1, arr={-4:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L162] COND FALSE 0 !(i < size) [L165] 0 return arr; [L137] RET, EXPR 0 create_fresh_int_array(n2) [L137] 0 q2 = create_fresh_int_array(n2) [L139] CALL 0 assume_abort_if_not(C > -2147483648 && N >= 0) [L38] COND FALSE 0 !(!cond) [L139] RET 0 assume_abort_if_not(C > -2147483648 && N >= 0) [L142] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [C=-5, N=1, i=0, j=0, n1=1, n2=1, q1={-3:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, total=0] [L49] 1 _Bool cond = i < N; VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, i=0, j=0, n1=1, n2=1, q1={-3:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [C=-5, N=1, i=0, j=0, n1=1, n2=1, q1={-3:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L38] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L54] EXPR 1 q1[q1_back] [L54] CALL 1 assume_abort_if_not(q1[q1_back] == C) [L38] COND FALSE 1 !(!cond) [L54] RET 1 assume_abort_if_not(q1[q1_back] == C) [L55] 1 i++ VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L58] 1 q1_back++ VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L61] 1 cond = i < N VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L51] COND FALSE 1 !(\read(cond)) [L65] 1 return 0; [L143] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [C=-5, N=1, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, total=0] [L70] 2 _Bool cond = j < N; VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L72] COND TRUE 2 \read(cond) VAL [C=-5, N=1, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L144] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [C=-5, N=1, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, total=0] [L91] 3 _Bool cond = i < N || q1_front < q1_back; VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L93] COND TRUE 3 \read(cond) VAL [C=-5, N=1, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L95] CALL 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L38] COND FALSE 3 !(!cond) [L95] RET 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L96] EXPR 3 q1[q1_front] [L96] CALL, EXPR 3 plus(total, q1[q1_front]) [L169] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L38] COND FALSE 3 !(!cond) [L169] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L170] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 3 !(!cond) [L170] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L171] 3 return a + b; [L96] RET, EXPR 3 plus(total, q1[q1_front]) [L96] 3 total = plus(total, q1[q1_front]) [L97] 3 q1_front++ VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=0, q2_front=0, total=-5] [L145] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [C=-5, N=1, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=-5] [L100] 3 cond = i < N || q1_front < q1_back VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=0, q2_front=0, total=-5] [L93] COND FALSE 3 !(\read(cond)) [L104] 3 return 0; [L146] FCALL, JOIN 1 pthread_join(t1, 0) VAL [C=-5, N=1, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=-5] [L74] CALL 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L38] COND FALSE 2 !(!cond) [L74] RET 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L75] EXPR 2 q2[q2_back] [L75] CALL 2 assume_abort_if_not(q2[q2_back] == -C) [L38] COND FALSE 2 !(!cond) [L75] RET 2 assume_abort_if_not(q2[q2_back] == -C) [L76] 2 j++ VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, i=1, j=1, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=0, q2_front=0, total=-5] [L109] 4 _Bool cond = j < N || q2_front < q2_back; VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, i=1, j=1, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=0, q2_front=0, total=-5] [L111] COND FALSE 4 !(\read(cond)) [L122] 4 return 0; [L79] 2 q2_back++ VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, i=1, j=1, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, total=-5] [L82] 2 cond = j < N VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, i=1, j=1, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, total=-5] [L72] COND FALSE 2 !(\read(cond)) [L86] 2 return 0; [L147] FCALL, JOIN 2 pthread_join(t2, 0) VAL [C=-5, N=1, i=1, j=1, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=-5] [L148] FCALL, JOIN 3 pthread_join(t3, 0) VAL [C=-5, N=1, i=1, j=1, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=-5] [L149] FCALL, JOIN 4 pthread_join(t4, 0) VAL [C=-5, N=1, i=1, j=1, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=-5] [L151] CALL 0 assume_abort_if_not(total != 0) [L38] COND FALSE 0 !(!cond) [L151] RET 0 assume_abort_if_not(total != 0) [L152] 0 reach_error() VAL [C=-5, N=1, i=1, j=1, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=-5] - UnprovableResult [Line: 143]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 144]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 142]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 74 locations, 83 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 226.4s, OverallIterations: 42, TraceHistogramMax: 1, PathProgramHistogramMax: 21, EmptinessCheckTime: 1.4s, AutomataDifference: 133.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5846 SdHoareTripleChecker+Valid, 9.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5846 mSDsluCounter, 3849 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2960 mSDsCounter, 258 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16608 IncrementalHoareTripleChecker+Invalid, 16866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 258 mSolverCounterUnsat, 889 mSDtfsCounter, 16608 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 792 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 479 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4642 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18427occurred in iteration=34, InterpolantAutomatonStates: 456, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 79.2s AutomataMinimizationTime, 41 MinimizatonAttempts, 158664 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 1641 NumberOfCodeBlocks, 1621 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1695 ConstructedInterpolants, 0 QuantifiedInterpolants, 16034 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1120 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 49 InterpolantComputations, 40 PerfectInterpolantSequences, 67/77 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 22:59:51,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...