/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/parallel-ticket-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:37:14,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:37:15,010 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:37:15,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:37:15,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:37:15,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:37:15,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:37:15,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:37:15,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:37:15,036 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:37:15,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:37:15,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:37:15,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:37:15,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:37:15,036 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:37:15,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:37:15,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:37:15,037 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:37:15,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:37:15,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:37:15,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:37:15,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:37:15,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:37:15,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:37:15,038 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:37:15,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:37:15,038 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:37:15,038 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:37:15,038 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:37:15,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:37:15,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:37:15,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:37:15,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:37:15,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:37:15,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:37:15,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:37:15,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:37:15,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:37:15,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:37:15,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:37:15,039 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:37:15,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:37:15,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:37:15,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:37:15,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:37:15,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:37:15,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:37:15,040 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:37:15,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:37:15,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:37:15,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:37:15,258 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:37:15,258 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:37:15,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c [2025-04-13 22:37:16,486 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/355415ab8/43954cb48e6542dfac1d0f832e8ab8e8/FLAG713062877 [2025-04-13 22:37:16,679 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:37:16,679 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c [2025-04-13 22:37:16,684 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/355415ab8/43954cb48e6542dfac1d0f832e8ab8e8/FLAG713062877 [2025-04-13 22:37:17,487 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/355415ab8/43954cb48e6542dfac1d0f832e8ab8e8 [2025-04-13 22:37:17,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:37:17,490 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:37:17,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:37:17,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:37:17,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:37:17,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:37:17" (1/1) ... [2025-04-13 22:37:17,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b64a2cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:17, skipping insertion in model container [2025-04-13 22:37:17,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:37:17" (1/1) ... [2025-04-13 22:37:17,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:37:17,663 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/parallel-ticket-4.wvr.c[2554,2567] [2025-04-13 22:37:17,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:37:17,678 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:37:17,701 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/parallel-ticket-4.wvr.c[2554,2567] [2025-04-13 22:37:17,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:37:17,710 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:37:17,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:17 WrapperNode [2025-04-13 22:37:17,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:37:17,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:37:17,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:37:17,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:37:17,715 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:37:17" (1/1) ... [2025-04-13 22:37:17,720 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:37:17" (1/1) ... [2025-04-13 22:37:17,735 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2025-04-13 22:37:17,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:37:17,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:37:17,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:37:17,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:37:17,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:17" (1/1) ... [2025-04-13 22:37:17,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:17" (1/1) ... [2025-04-13 22:37:17,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:17" (1/1) ... [2025-04-13 22:37:17,751 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 22:37:17,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:17" (1/1) ... [2025-04-13 22:37:17,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:17" (1/1) ... [2025-04-13 22:37:17,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:17" (1/1) ... [2025-04-13 22:37:17,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:17" (1/1) ... [2025-04-13 22:37:17,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:17" (1/1) ... [2025-04-13 22:37:17,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:17" (1/1) ... [2025-04-13 22:37:17,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:37:17,759 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:37:17,759 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:37:17,759 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:37:17,760 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:17" (1/1) ... [2025-04-13 22:37:17,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:37:17,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:17,781 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:37:17,783 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:37:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:37:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:37:17,798 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:37:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:37:17,798 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:37:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:37:17,798 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:37:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 22:37:17,799 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 22:37:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:37:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:37:17,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:37:17,799 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:37:17,872 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:37:17,874 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:37:18,094 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:37:18,094 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:37:18,094 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:37:18,236 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:37:18,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:37:18 BoogieIcfgContainer [2025-04-13 22:37:18,237 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:37:18,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:37:18,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:37:18,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:37:18,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:37:17" (1/3) ... [2025-04-13 22:37:18,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4067ba86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:37:18, skipping insertion in model container [2025-04-13 22:37:18,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:17" (2/3) ... [2025-04-13 22:37:18,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4067ba86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:37:18, skipping insertion in model container [2025-04-13 22:37:18,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:37:18" (3/3) ... [2025-04-13 22:37:18,242 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2025-04-13 22:37:18,251 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:37:18,252 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-4.wvr.c that has 5 procedures, 53 locations, 51 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 22:37:18,252 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:37:18,302 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 22:37:18,326 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 55 transitions, 138 flow [2025-04-13 22:37:18,620 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6811 states, 6810 states have (on average 4.250367107195301) internal successors, (28945), 6810 states have internal predecessors, (28945), 0 states have call successors, (0), 0 states have 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:37:18,639 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:37:18,648 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;@6a2ee8b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:37:18,648 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 22:37:18,671 INFO L278 IsEmpty]: Start isEmpty. Operand has 6811 states, 6810 states have (on average 4.250367107195301) internal successors, (28945), 6810 states have internal predecessors, (28945), 0 states have call successors, (0), 0 states have 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:37:18,729 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:37:18,730 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:18,730 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, 1, 1, 1] [2025-04-13 22:37:18,731 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:37:18,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:18,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1305298921, now seen corresponding path program 1 times [2025-04-13 22:37:18,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:18,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891538799] [2025-04-13 22:37:18,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:37:18,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:18,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 22:37:18,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:37:18,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:18,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:19,044 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:37:19,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:19,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891538799] [2025-04-13 22:37:19,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891538799] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:19,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:19,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:37:19,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253579740] [2025-04-13 22:37:19,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:19,050 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:37:19,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:19,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:37:19,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:37:19,078 INFO L87 Difference]: Start difference. First operand has 6811 states, 6810 states have (on average 4.250367107195301) internal successors, (28945), 6810 states have internal predecessors, (28945), 0 states have call successors, (0), 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 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:37:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:19,325 INFO L93 Difference]: Finished difference Result 12188 states and 50978 transitions. [2025-04-13 22:37:19,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:37:19,327 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-04-13 22:37:19,327 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:19,436 INFO L225 Difference]: With dead ends: 12188 [2025-04-13 22:37:19,436 INFO L226 Difference]: Without dead ends: 11715 [2025-04-13 22:37:19,450 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:37:19,453 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:19,454 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 8 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:37:19,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11715 states. [2025-04-13 22:37:19,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11715 to 10075. [2025-04-13 22:37:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10075 states, 10074 states have (on average 4.195056581298392) internal successors, (42261), 10074 states have internal predecessors, (42261), 0 states have call successors, (0), 0 states have 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:37:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10075 states to 10075 states and 42261 transitions. [2025-04-13 22:37:20,023 INFO L79 Accepts]: Start accepts. Automaton has 10075 states and 42261 transitions. Word has length 44 [2025-04-13 22:37:20,024 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:20,024 INFO L485 AbstractCegarLoop]: Abstraction has 10075 states and 42261 transitions. [2025-04-13 22:37:20,025 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:37:20,025 INFO L278 IsEmpty]: Start isEmpty. Operand 10075 states and 42261 transitions. [2025-04-13 22:37:20,058 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:20,058 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:20,058 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, 1, 1, 1, 1] [2025-04-13 22:37:20,059 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:37:20,059 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:37:20,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:20,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1405763024, now seen corresponding path program 1 times [2025-04-13 22:37:20,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:20,060 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461416677] [2025-04-13 22:37:20,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:37:20,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:20,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:20,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:20,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:20,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:20,210 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:37:20,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:20,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461416677] [2025-04-13 22:37:20,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461416677] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:20,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:20,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:37:20,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384322035] [2025-04-13 22:37:20,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:20,212 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:37:20,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:20,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:37:20,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:37:20,213 INFO L87 Difference]: Start difference. First operand 10075 states and 42261 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:20,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:20,486 INFO L93 Difference]: Finished difference Result 13329 states and 55421 transitions. [2025-04-13 22:37:20,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:37:20,487 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:20,487 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:20,527 INFO L225 Difference]: With dead ends: 13329 [2025-04-13 22:37:20,528 INFO L226 Difference]: Without dead ends: 5584 [2025-04-13 22:37:20,541 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:37:20,542 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:20,542 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 7 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:37:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5584 states. [2025-04-13 22:37:20,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5584 to 5584. [2025-04-13 22:37:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5584 states, 5583 states have (on average 3.757836288733656) internal successors, (20980), 5583 states have internal predecessors, (20980), 0 states have call successors, (0), 0 states have 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:37:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5584 states to 5584 states and 20980 transitions. [2025-04-13 22:37:20,745 INFO L79 Accepts]: Start accepts. Automaton has 5584 states and 20980 transitions. Word has length 45 [2025-04-13 22:37:20,746 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:20,746 INFO L485 AbstractCegarLoop]: Abstraction has 5584 states and 20980 transitions. [2025-04-13 22:37:20,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:20,746 INFO L278 IsEmpty]: Start isEmpty. Operand 5584 states and 20980 transitions. [2025-04-13 22:37:20,760 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:20,760 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:20,760 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, 1, 1, 1, 1] [2025-04-13 22:37:20,760 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:37:20,760 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:37:20,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:20,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1813910273, now seen corresponding path program 1 times [2025-04-13 22:37:20,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:20,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497972841] [2025-04-13 22:37:20,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:37:20,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:20,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:20,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:20,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:20,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:20,820 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:37:20,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:20,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497972841] [2025-04-13 22:37:20,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497972841] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:20,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:20,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:37:20,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352411746] [2025-04-13 22:37:20,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:20,821 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:37:20,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:20,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:37:20,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:37:20,822 INFO L87 Difference]: Start difference. First operand 5584 states and 20980 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:20,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:20,956 INFO L93 Difference]: Finished difference Result 7919 states and 29261 transitions. [2025-04-13 22:37:20,956 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:37:20,956 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:20,957 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:20,984 INFO L225 Difference]: With dead ends: 7919 [2025-04-13 22:37:20,985 INFO L226 Difference]: Without dead ends: 5584 [2025-04-13 22:37:20,990 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:37:20,991 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:20,991 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 11 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:37:20,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5584 states. [2025-04-13 22:37:21,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5584 to 5584. [2025-04-13 22:37:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5584 states, 5583 states have (on average 3.678309152785241) internal successors, (20536), 5583 states have internal predecessors, (20536), 0 states have call successors, (0), 0 states have 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:37:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5584 states to 5584 states and 20536 transitions. [2025-04-13 22:37:21,214 INFO L79 Accepts]: Start accepts. Automaton has 5584 states and 20536 transitions. Word has length 45 [2025-04-13 22:37:21,214 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:21,215 INFO L485 AbstractCegarLoop]: Abstraction has 5584 states and 20536 transitions. [2025-04-13 22:37:21,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:21,215 INFO L278 IsEmpty]: Start isEmpty. Operand 5584 states and 20536 transitions. [2025-04-13 22:37:21,246 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:21,246 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:21,246 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, 1, 1, 1, 1] [2025-04-13 22:37:21,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:37:21,246 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:37:21,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:21,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1673444141, now seen corresponding path program 2 times [2025-04-13 22:37:21,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:21,247 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624315646] [2025-04-13 22:37:21,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:21,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:21,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:21,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:21,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:37:21,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:21,531 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:37:21,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:21,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624315646] [2025-04-13 22:37:21,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624315646] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:21,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:21,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:37:21,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31737792] [2025-04-13 22:37:21,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:21,532 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:37:21,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:21,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:37:21,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:37:21,532 INFO L87 Difference]: Start difference. First operand 5584 states and 20536 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:21,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:21,856 INFO L93 Difference]: Finished difference Result 12077 states and 43201 transitions. [2025-04-13 22:37:21,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:37:21,856 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:21,857 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:21,896 INFO L225 Difference]: With dead ends: 12077 [2025-04-13 22:37:21,896 INFO L226 Difference]: Without dead ends: 9673 [2025-04-13 22:37:21,903 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:37:21,903 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 96 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:21,904 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 42 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:37:21,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9673 states. [2025-04-13 22:37:22,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9673 to 6149. [2025-04-13 22:37:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6149 states, 6148 states have (on average 3.6585881587508133) internal successors, (22493), 6148 states have internal predecessors, (22493), 0 states have call successors, (0), 0 states have 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:37:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 22493 transitions. [2025-04-13 22:37:22,092 INFO L79 Accepts]: Start accepts. Automaton has 6149 states and 22493 transitions. Word has length 45 [2025-04-13 22:37:22,093 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:22,093 INFO L485 AbstractCegarLoop]: Abstraction has 6149 states and 22493 transitions. [2025-04-13 22:37:22,093 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:22,093 INFO L278 IsEmpty]: Start isEmpty. Operand 6149 states and 22493 transitions. [2025-04-13 22:37:22,109 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:22,109 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:22,109 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, 1, 1, 1, 1] [2025-04-13 22:37:22,109 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:37:22,109 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:37:22,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:22,110 INFO L85 PathProgramCache]: Analyzing trace with hash 781423039, now seen corresponding path program 1 times [2025-04-13 22:37:22,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:22,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206755842] [2025-04-13 22:37:22,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:37:22,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:22,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:22,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:22,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:22,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:22,226 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:37:22,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:22,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206755842] [2025-04-13 22:37:22,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206755842] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:22,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:22,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:37:22,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554946155] [2025-04-13 22:37:22,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:22,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:37:22,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:22,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:37:22,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:37:22,228 INFO L87 Difference]: Start difference. First operand 6149 states and 22493 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:22,479 INFO L93 Difference]: Finished difference Result 14957 states and 53790 transitions. [2025-04-13 22:37:22,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:37:22,479 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:22,479 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:22,526 INFO L225 Difference]: With dead ends: 14957 [2025-04-13 22:37:22,526 INFO L226 Difference]: Without dead ends: 10290 [2025-04-13 22:37:22,539 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:37:22,541 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 78 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:22,541 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 27 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:37:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10290 states. [2025-04-13 22:37:22,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10290 to 6873. [2025-04-13 22:37:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6873 states, 6872 states have (on average 3.6212165308498254) internal successors, (24885), 6872 states have internal predecessors, (24885), 0 states have call successors, (0), 0 states have 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:37:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6873 states to 6873 states and 24885 transitions. [2025-04-13 22:37:22,770 INFO L79 Accepts]: Start accepts. Automaton has 6873 states and 24885 transitions. Word has length 45 [2025-04-13 22:37:22,771 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:22,771 INFO L485 AbstractCegarLoop]: Abstraction has 6873 states and 24885 transitions. [2025-04-13 22:37:22,771 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:22,772 INFO L278 IsEmpty]: Start isEmpty. Operand 6873 states and 24885 transitions. [2025-04-13 22:37:22,787 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:22,787 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:22,787 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, 1, 1, 1, 1] [2025-04-13 22:37:22,787 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:37:22,788 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:37:22,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:22,788 INFO L85 PathProgramCache]: Analyzing trace with hash -149419395, now seen corresponding path program 2 times [2025-04-13 22:37:22,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:22,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037078783] [2025-04-13 22:37:22,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:22,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:22,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:22,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:22,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:37:22,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:22,991 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:37:22,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:22,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037078783] [2025-04-13 22:37:22,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037078783] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:22,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:22,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:37:22,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212496452] [2025-04-13 22:37:22,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:22,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:37:22,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:22,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:37:22,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:37:22,992 INFO L87 Difference]: Start difference. First operand 6873 states and 24885 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:23,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:23,381 INFO L93 Difference]: Finished difference Result 13117 states and 46143 transitions. [2025-04-13 22:37:23,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:37:23,381 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:23,381 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:23,419 INFO L225 Difference]: With dead ends: 13117 [2025-04-13 22:37:23,419 INFO L226 Difference]: Without dead ends: 9769 [2025-04-13 22:37:23,429 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:37:23,430 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 149 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:23,430 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 55 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:23,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9769 states. [2025-04-13 22:37:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9769 to 6568. [2025-04-13 22:37:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6568 states, 6567 states have (on average 3.480127912288716) internal successors, (22854), 6567 states have internal predecessors, (22854), 0 states have call successors, (0), 0 states have 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:37:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6568 states to 6568 states and 22854 transitions. [2025-04-13 22:37:23,581 INFO L79 Accepts]: Start accepts. Automaton has 6568 states and 22854 transitions. Word has length 45 [2025-04-13 22:37:23,582 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:23,582 INFO L485 AbstractCegarLoop]: Abstraction has 6568 states and 22854 transitions. [2025-04-13 22:37:23,582 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:23,582 INFO L278 IsEmpty]: Start isEmpty. Operand 6568 states and 22854 transitions. [2025-04-13 22:37:23,593 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:23,593 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:23,593 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, 1, 1, 1, 1] [2025-04-13 22:37:23,593 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 22:37:23,594 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:37:23,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:23,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1161731935, now seen corresponding path program 3 times [2025-04-13 22:37:23,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:23,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593286881] [2025-04-13 22:37:23,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:37:23,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:23,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:23,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:23,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:37:23,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:23,703 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:37:23,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:23,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593286881] [2025-04-13 22:37:23,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593286881] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:23,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:23,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:37:23,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296149746] [2025-04-13 22:37:23,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:23,704 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:37:23,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:23,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:37:23,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:37:23,704 INFO L87 Difference]: Start difference. First operand 6568 states and 22854 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:23,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:23,934 INFO L93 Difference]: Finished difference Result 12182 states and 41366 transitions. [2025-04-13 22:37:23,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:37:23,934 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:23,934 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:23,967 INFO L225 Difference]: With dead ends: 12182 [2025-04-13 22:37:23,967 INFO L226 Difference]: Without dead ends: 8639 [2025-04-13 22:37:23,974 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:37:23,974 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 101 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:23,975 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 38 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:37:23,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8639 states. [2025-04-13 22:37:24,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8639 to 6367. [2025-04-13 22:37:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6367 states, 6366 states have (on average 3.3361608545397425) internal successors, (21238), 6366 states have internal predecessors, (21238), 0 states have call successors, (0), 0 states have 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:37:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6367 states to 6367 states and 21238 transitions. [2025-04-13 22:37:24,111 INFO L79 Accepts]: Start accepts. Automaton has 6367 states and 21238 transitions. Word has length 45 [2025-04-13 22:37:24,111 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:24,111 INFO L485 AbstractCegarLoop]: Abstraction has 6367 states and 21238 transitions. [2025-04-13 22:37:24,111 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:24,111 INFO L278 IsEmpty]: Start isEmpty. Operand 6367 states and 21238 transitions. [2025-04-13 22:37:24,124 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:24,124 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:24,124 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, 1, 1, 1, 1] [2025-04-13 22:37:24,124 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:37:24,124 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:37:24,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:24,125 INFO L85 PathProgramCache]: Analyzing trace with hash -11122187, now seen corresponding path program 3 times [2025-04-13 22:37:24,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:24,125 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988333552] [2025-04-13 22:37:24,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:37:24,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:24,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:24,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:24,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:37:24,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:24,290 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:37:24,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:24,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988333552] [2025-04-13 22:37:24,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988333552] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:24,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:24,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:37:24,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952517717] [2025-04-13 22:37:24,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:24,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:37:24,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:24,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:37:24,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:37:24,291 INFO L87 Difference]: Start difference. First operand 6367 states and 21238 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:24,556 INFO L93 Difference]: Finished difference Result 8129 states and 26789 transitions. [2025-04-13 22:37:24,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:37:24,556 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:24,556 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:24,585 INFO L225 Difference]: With dead ends: 8129 [2025-04-13 22:37:24,586 INFO L226 Difference]: Without dead ends: 7742 [2025-04-13 22:37:24,588 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:37:24,589 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 149 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:24,589 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 50 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:37:24,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7742 states. [2025-04-13 22:37:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7742 to 6187. [2025-04-13 22:37:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6187 states, 6186 states have (on average 3.3262204978984804) internal successors, (20576), 6186 states have internal predecessors, (20576), 0 states have call successors, (0), 0 states have 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:37:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6187 states to 6187 states and 20576 transitions. [2025-04-13 22:37:24,705 INFO L79 Accepts]: Start accepts. Automaton has 6187 states and 20576 transitions. Word has length 45 [2025-04-13 22:37:24,705 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:24,706 INFO L485 AbstractCegarLoop]: Abstraction has 6187 states and 20576 transitions. [2025-04-13 22:37:24,706 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:24,706 INFO L278 IsEmpty]: Start isEmpty. Operand 6187 states and 20576 transitions. [2025-04-13 22:37:24,716 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:24,716 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:24,716 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, 1, 1, 1, 1] [2025-04-13 22:37:24,716 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:37:24,716 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:37:24,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:24,717 INFO L85 PathProgramCache]: Analyzing trace with hash 677825651, now seen corresponding path program 4 times [2025-04-13 22:37:24,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:24,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261002622] [2025-04-13 22:37:24,717 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:37:24,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:24,724 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:37:24,734 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:24,734 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:37:24,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:24,883 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:37:24,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:24,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261002622] [2025-04-13 22:37:24,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261002622] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:24,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:24,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:37:24,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950549454] [2025-04-13 22:37:24,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:24,884 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:37:24,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:24,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:37:24,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:37:24,884 INFO L87 Difference]: Start difference. First operand 6187 states and 20576 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:25,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:25,151 INFO L93 Difference]: Finished difference Result 10545 states and 34648 transitions. [2025-04-13 22:37:25,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:37:25,151 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:25,151 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:25,184 INFO L225 Difference]: With dead ends: 10545 [2025-04-13 22:37:25,184 INFO L226 Difference]: Without dead ends: 8865 [2025-04-13 22:37:25,189 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:37:25,190 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 164 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:25,190 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 47 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:37:25,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8865 states. [2025-04-13 22:37:25,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8865 to 6145. [2025-04-13 22:37:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6145 states, 6144 states have (on average 3.2996419270833335) internal successors, (20273), 6144 states have internal predecessors, (20273), 0 states have call successors, (0), 0 states have 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:37:25,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6145 states to 6145 states and 20273 transitions. [2025-04-13 22:37:25,312 INFO L79 Accepts]: Start accepts. Automaton has 6145 states and 20273 transitions. Word has length 45 [2025-04-13 22:37:25,313 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:25,313 INFO L485 AbstractCegarLoop]: Abstraction has 6145 states and 20273 transitions. [2025-04-13 22:37:25,313 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:25,313 INFO L278 IsEmpty]: Start isEmpty. Operand 6145 states and 20273 transitions. [2025-04-13 22:37:25,322 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:25,322 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:25,322 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, 1, 1, 1, 1] [2025-04-13 22:37:25,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:37:25,323 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:37:25,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:25,323 INFO L85 PathProgramCache]: Analyzing trace with hash 981118579, now seen corresponding path program 5 times [2025-04-13 22:37:25,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:25,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882269156] [2025-04-13 22:37:25,323 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:25,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:25,329 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:25,333 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:25,333 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:37:25,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:25,427 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:37:25,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:25,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882269156] [2025-04-13 22:37:25,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882269156] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:25,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:25,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:37:25,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133746597] [2025-04-13 22:37:25,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:25,428 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:37:25,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:25,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:37:25,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:37:25,428 INFO L87 Difference]: Start difference. First operand 6145 states and 20273 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:25,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:25,790 INFO L93 Difference]: Finished difference Result 10209 states and 33188 transitions. [2025-04-13 22:37:25,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:37:25,790 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:25,790 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:25,818 INFO L225 Difference]: With dead ends: 10209 [2025-04-13 22:37:25,818 INFO L226 Difference]: Without dead ends: 7746 [2025-04-13 22:37:25,824 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:37:25,824 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 108 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:25,824 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 42 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:25,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7746 states. [2025-04-13 22:37:25,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7746 to 5547. [2025-04-13 22:37:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5547 states, 5546 states have (on average 3.283086909484313) internal successors, (18208), 5546 states have internal predecessors, (18208), 0 states have call successors, (0), 0 states have 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:37:25,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5547 states to 5547 states and 18208 transitions. [2025-04-13 22:37:25,926 INFO L79 Accepts]: Start accepts. Automaton has 5547 states and 18208 transitions. Word has length 45 [2025-04-13 22:37:25,926 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:25,926 INFO L485 AbstractCegarLoop]: Abstraction has 5547 states and 18208 transitions. [2025-04-13 22:37:25,926 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:25,927 INFO L278 IsEmpty]: Start isEmpty. Operand 5547 states and 18208 transitions. [2025-04-13 22:37:25,934 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:25,934 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:25,934 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, 1, 1, 1, 1] [2025-04-13 22:37:25,934 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 22:37:25,934 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:37:25,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:25,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2003189547, now seen corresponding path program 6 times [2025-04-13 22:37:25,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:25,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464077882] [2025-04-13 22:37:25,935 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:37:25,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:25,942 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:25,945 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:25,946 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:37:25,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:26,033 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:37:26,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:26,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464077882] [2025-04-13 22:37:26,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464077882] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:26,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:26,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:37:26,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044174400] [2025-04-13 22:37:26,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:26,034 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:37:26,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:26,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:37:26,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:37:26,034 INFO L87 Difference]: Start difference. First operand 5547 states and 18208 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:26,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:26,321 INFO L93 Difference]: Finished difference Result 8881 states and 28509 transitions. [2025-04-13 22:37:26,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:37:26,321 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:26,321 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:26,350 INFO L225 Difference]: With dead ends: 8881 [2025-04-13 22:37:26,350 INFO L226 Difference]: Without dead ends: 6276 [2025-04-13 22:37:26,356 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:37:26,357 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 118 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:26,357 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 62 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:37:26,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6276 states. [2025-04-13 22:37:26,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6276 to 4615. [2025-04-13 22:37:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4615 states, 4614 states have (on average 3.2032943216298224) internal successors, (14780), 4614 states have internal predecessors, (14780), 0 states have call successors, (0), 0 states have 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:37:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4615 states to 4615 states and 14780 transitions. [2025-04-13 22:37:26,444 INFO L79 Accepts]: Start accepts. Automaton has 4615 states and 14780 transitions. Word has length 45 [2025-04-13 22:37:26,444 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:26,444 INFO L485 AbstractCegarLoop]: Abstraction has 4615 states and 14780 transitions. [2025-04-13 22:37:26,444 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:26,445 INFO L278 IsEmpty]: Start isEmpty. Operand 4615 states and 14780 transitions. [2025-04-13 22:37:26,450 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:26,451 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:26,451 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, 1, 1, 1, 1] [2025-04-13 22:37:26,451 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 22:37:26,451 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:37:26,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:26,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1585311515, now seen corresponding path program 7 times [2025-04-13 22:37:26,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:26,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15760445] [2025-04-13 22:37:26,451 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:26,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:26,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:26,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:26,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:26,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:26,600 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:37:26,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:26,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15760445] [2025-04-13 22:37:26,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15760445] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:26,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:26,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:37:26,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079462809] [2025-04-13 22:37:26,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:26,601 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:37:26,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:26,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:37:26,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:37:26,601 INFO L87 Difference]: Start difference. First operand 4615 states and 14780 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:26,870 INFO L93 Difference]: Finished difference Result 6015 states and 18915 transitions. [2025-04-13 22:37:26,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:37:26,871 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:26,871 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:26,893 INFO L225 Difference]: With dead ends: 6015 [2025-04-13 22:37:26,893 INFO L226 Difference]: Without dead ends: 5556 [2025-04-13 22:37:26,895 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:26,896 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 203 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:26,896 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 55 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:37:26,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5556 states. [2025-04-13 22:37:26,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5556 to 4499. [2025-04-13 22:37:26,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4499 states, 4498 states have (on average 3.192530013339262) internal successors, (14360), 4498 states have internal predecessors, (14360), 0 states have call successors, (0), 0 states have 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:37:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 14360 transitions. [2025-04-13 22:37:26,969 INFO L79 Accepts]: Start accepts. Automaton has 4499 states and 14360 transitions. Word has length 45 [2025-04-13 22:37:26,969 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:26,969 INFO L485 AbstractCegarLoop]: Abstraction has 4499 states and 14360 transitions. [2025-04-13 22:37:26,970 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:26,970 INFO L278 IsEmpty]: Start isEmpty. Operand 4499 states and 14360 transitions. [2025-04-13 22:37:26,975 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:26,975 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:26,975 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, 1, 1, 1, 1] [2025-04-13 22:37:26,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 22:37:26,976 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:37:26,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:26,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1652826897, now seen corresponding path program 8 times [2025-04-13 22:37:26,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:26,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779335071] [2025-04-13 22:37:26,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:26,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:26,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:26,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:26,985 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:37:26,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:27,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:37:27,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:27,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779335071] [2025-04-13 22:37:27,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779335071] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:27,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:27,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:37:27,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406809982] [2025-04-13 22:37:27,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:27,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:37:27,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:27,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:37:27,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:37:27,079 INFO L87 Difference]: Start difference. First operand 4499 states and 14360 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:27,451 INFO L93 Difference]: Finished difference Result 5953 states and 18616 transitions. [2025-04-13 22:37:27,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:37:27,451 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:27,451 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:27,473 INFO L225 Difference]: With dead ends: 5953 [2025-04-13 22:37:27,473 INFO L226 Difference]: Without dead ends: 5532 [2025-04-13 22:37:27,475 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:37:27,476 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 220 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:27,476 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 72 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:27,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2025-04-13 22:37:27,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 4511. [2025-04-13 22:37:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4511 states, 4510 states have (on average 3.182261640798226) internal successors, (14352), 4510 states have internal predecessors, (14352), 0 states have call successors, (0), 0 states have 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:37:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4511 states to 4511 states and 14352 transitions. [2025-04-13 22:37:27,578 INFO L79 Accepts]: Start accepts. Automaton has 4511 states and 14352 transitions. Word has length 45 [2025-04-13 22:37:27,578 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:27,578 INFO L485 AbstractCegarLoop]: Abstraction has 4511 states and 14352 transitions. [2025-04-13 22:37:27,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:27,579 INFO L278 IsEmpty]: Start isEmpty. Operand 4511 states and 14352 transitions. [2025-04-13 22:37:27,585 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:27,585 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:27,586 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, 1, 1, 1, 1] [2025-04-13 22:37:27,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 22:37:27,586 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:37:27,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:27,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1375708145, now seen corresponding path program 9 times [2025-04-13 22:37:27,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:27,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023430100] [2025-04-13 22:37:27,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:37:27,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:27,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:27,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:27,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:37:27,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:27,718 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:37:27,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:27,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023430100] [2025-04-13 22:37:27,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023430100] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:27,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:27,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:37:27,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681193199] [2025-04-13 22:37:27,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:27,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:37:27,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:27,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:37:27,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:37:27,720 INFO L87 Difference]: Start difference. First operand 4511 states and 14352 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:28,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:28,043 INFO L93 Difference]: Finished difference Result 6002 states and 18613 transitions. [2025-04-13 22:37:28,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:37:28,044 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:28,044 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:28,067 INFO L225 Difference]: With dead ends: 6002 [2025-04-13 22:37:28,068 INFO L226 Difference]: Without dead ends: 5188 [2025-04-13 22:37:28,070 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:37:28,071 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 149 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:28,071 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 65 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:28,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5188 states. [2025-04-13 22:37:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5188 to 4221. [2025-04-13 22:37:28,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4221 states, 4220 states have (on average 3.178909952606635) internal successors, (13415), 4220 states have internal predecessors, (13415), 0 states have call successors, (0), 0 states have 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:37:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4221 states to 4221 states and 13415 transitions. [2025-04-13 22:37:28,168 INFO L79 Accepts]: Start accepts. Automaton has 4221 states and 13415 transitions. Word has length 45 [2025-04-13 22:37:28,168 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:28,168 INFO L485 AbstractCegarLoop]: Abstraction has 4221 states and 13415 transitions. [2025-04-13 22:37:28,168 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:28,168 INFO L278 IsEmpty]: Start isEmpty. Operand 4221 states and 13415 transitions. [2025-04-13 22:37:28,175 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:28,175 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:28,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:28,175 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 22:37:28,176 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:37:28,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:28,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1495050289, now seen corresponding path program 4 times [2025-04-13 22:37:28,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:28,177 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028346912] [2025-04-13 22:37:28,177 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:37:28,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:28,185 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:37:28,191 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:28,191 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:37:28,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:28,327 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:37:28,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:28,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028346912] [2025-04-13 22:37:28,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028346912] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:28,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:28,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:37:28,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183683589] [2025-04-13 22:37:28,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:28,328 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:37:28,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:28,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:37:28,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:37:28,329 INFO L87 Difference]: Start difference. First operand 4221 states and 13415 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:28,580 INFO L93 Difference]: Finished difference Result 5774 states and 17945 transitions. [2025-04-13 22:37:28,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:37:28,580 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:28,580 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:28,605 INFO L225 Difference]: With dead ends: 5774 [2025-04-13 22:37:28,606 INFO L226 Difference]: Without dead ends: 5364 [2025-04-13 22:37:28,609 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:37:28,610 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 129 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:28,610 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 48 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:37:28,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5364 states. [2025-04-13 22:37:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5364 to 3995. [2025-04-13 22:37:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3995 states, 3994 states have (on average 3.1497245868803203) internal successors, (12580), 3994 states have internal predecessors, (12580), 0 states have call successors, (0), 0 states have 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:37:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3995 states to 3995 states and 12580 transitions. [2025-04-13 22:37:28,692 INFO L79 Accepts]: Start accepts. Automaton has 3995 states and 12580 transitions. Word has length 45 [2025-04-13 22:37:28,692 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:28,692 INFO L485 AbstractCegarLoop]: Abstraction has 3995 states and 12580 transitions. [2025-04-13 22:37:28,692 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:28,692 INFO L278 IsEmpty]: Start isEmpty. Operand 3995 states and 12580 transitions. [2025-04-13 22:37:28,697 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:28,697 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:28,697 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, 1, 1, 1, 1] [2025-04-13 22:37:28,697 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 22:37:28,697 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:37:28,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:28,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1851755407, now seen corresponding path program 5 times [2025-04-13 22:37:28,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:28,698 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244527202] [2025-04-13 22:37:28,698 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:28,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:28,703 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:28,707 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:28,707 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:37:28,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:28,787 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:37:28,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:28,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244527202] [2025-04-13 22:37:28,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244527202] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:28,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:28,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:37:28,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377953800] [2025-04-13 22:37:28,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:28,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:37:28,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:28,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:37:28,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:37:28,790 INFO L87 Difference]: Start difference. First operand 3995 states and 12580 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:29,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:29,084 INFO L93 Difference]: Finished difference Result 5362 states and 16569 transitions. [2025-04-13 22:37:29,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:37:29,084 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:29,084 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:29,106 INFO L225 Difference]: With dead ends: 5362 [2025-04-13 22:37:29,106 INFO L226 Difference]: Without dead ends: 4864 [2025-04-13 22:37:29,108 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:37:29,109 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 142 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:29,109 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 71 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4864 states. [2025-04-13 22:37:29,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4864 to 3795. [2025-04-13 22:37:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3795 states, 3794 states have (on average 3.1418028465998944) internal successors, (11920), 3794 states have internal predecessors, (11920), 0 states have call successors, (0), 0 states have 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:37:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3795 states to 3795 states and 11920 transitions. [2025-04-13 22:37:29,208 INFO L79 Accepts]: Start accepts. Automaton has 3795 states and 11920 transitions. Word has length 45 [2025-04-13 22:37:29,209 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:29,209 INFO L485 AbstractCegarLoop]: Abstraction has 3795 states and 11920 transitions. [2025-04-13 22:37:29,209 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:29,209 INFO L278 IsEmpty]: Start isEmpty. Operand 3795 states and 11920 transitions. [2025-04-13 22:37:29,215 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:29,215 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:29,215 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, 1, 1, 1, 1] [2025-04-13 22:37:29,215 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 22:37:29,215 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:37:29,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:29,216 INFO L85 PathProgramCache]: Analyzing trace with hash 966874681, now seen corresponding path program 6 times [2025-04-13 22:37:29,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:29,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058288353] [2025-04-13 22:37:29,216 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:37:29,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:29,221 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:29,225 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:29,225 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:37:29,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:29,305 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:37:29,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:29,306 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058288353] [2025-04-13 22:37:29,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058288353] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:29,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:29,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:37:29,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61961758] [2025-04-13 22:37:29,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:29,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:37:29,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:29,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:37:29,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:37:29,307 INFO L87 Difference]: Start difference. First operand 3795 states and 11920 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:29,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:29,643 INFO L93 Difference]: Finished difference Result 5156 states and 15907 transitions. [2025-04-13 22:37:29,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:37:29,644 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:29,645 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:29,660 INFO L225 Difference]: With dead ends: 5156 [2025-04-13 22:37:29,660 INFO L226 Difference]: Without dead ends: 4602 [2025-04-13 22:37:29,662 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:37:29,663 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 209 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:29,664 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 81 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:29,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2025-04-13 22:37:29,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 3623. [2025-04-13 22:37:29,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3623 states, 3622 states have (on average 3.150193263390392) internal successors, (11410), 3622 states have internal predecessors, (11410), 0 states have call successors, (0), 0 states have 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:37:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 11410 transitions. [2025-04-13 22:37:29,720 INFO L79 Accepts]: Start accepts. Automaton has 3623 states and 11410 transitions. Word has length 45 [2025-04-13 22:37:29,721 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:29,721 INFO L485 AbstractCegarLoop]: Abstraction has 3623 states and 11410 transitions. [2025-04-13 22:37:29,721 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:29,721 INFO L278 IsEmpty]: Start isEmpty. Operand 3623 states and 11410 transitions. [2025-04-13 22:37:29,727 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:29,727 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:29,727 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, 1, 1, 1, 1] [2025-04-13 22:37:29,727 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 22:37:29,727 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:37:29,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:29,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1595318830, now seen corresponding path program 2 times [2025-04-13 22:37:29,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:29,728 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903977290] [2025-04-13 22:37:29,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:29,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:29,734 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:29,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:29,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:37:29,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:29,777 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:37:29,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:29,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903977290] [2025-04-13 22:37:29,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903977290] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:29,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:29,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:37:29,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001540384] [2025-04-13 22:37:29,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:29,778 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:37:29,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:29,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:37:29,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:37:29,778 INFO L87 Difference]: Start difference. First operand 3623 states and 11410 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:29,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:29,920 INFO L93 Difference]: Finished difference Result 6350 states and 19814 transitions. [2025-04-13 22:37:29,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:37:29,920 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:29,920 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:29,935 INFO L225 Difference]: With dead ends: 6350 [2025-04-13 22:37:29,935 INFO L226 Difference]: Without dead ends: 3237 [2025-04-13 22:37:29,940 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:37:29,940 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 65 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:29,940 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 26 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:37:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3237 states. [2025-04-13 22:37:29,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3237 to 2035. [2025-04-13 22:37:29,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 2034 states have (on average 3.039331366764995) internal successors, (6182), 2034 states have internal predecessors, (6182), 0 states have call successors, (0), 0 states have 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:37:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 6182 transitions. [2025-04-13 22:37:29,976 INFO L79 Accepts]: Start accepts. Automaton has 2035 states and 6182 transitions. Word has length 45 [2025-04-13 22:37:29,976 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:29,976 INFO L485 AbstractCegarLoop]: Abstraction has 2035 states and 6182 transitions. [2025-04-13 22:37:29,976 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:29,976 INFO L278 IsEmpty]: Start isEmpty. Operand 2035 states and 6182 transitions. [2025-04-13 22:37:29,979 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:29,979 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:29,979 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, 1, 1, 1, 1] [2025-04-13 22:37:29,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 22:37:29,979 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:37:29,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:29,979 INFO L85 PathProgramCache]: Analyzing trace with hash 758590056, now seen corresponding path program 3 times [2025-04-13 22:37:29,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:29,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250337699] [2025-04-13 22:37:29,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:37:29,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:29,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:29,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:29,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:37:29,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:30,049 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:37:30,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:30,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250337699] [2025-04-13 22:37:30,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250337699] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:30,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:30,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:37:30,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095160871] [2025-04-13 22:37:30,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:30,050 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:37:30,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:30,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:37:30,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:37:30,051 INFO L87 Difference]: Start difference. First operand 2035 states and 6182 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:30,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:30,218 INFO L93 Difference]: Finished difference Result 3640 states and 11002 transitions. [2025-04-13 22:37:30,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:37:30,219 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:30,219 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:30,235 INFO L225 Difference]: With dead ends: 3640 [2025-04-13 22:37:30,235 INFO L226 Difference]: Without dead ends: 2203 [2025-04-13 22:37:30,238 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:37:30,238 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 70 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:30,238 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 40 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:37:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2025-04-13 22:37:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 1775. [2025-04-13 22:37:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1774 states have (on average 3.004509582863585) internal successors, (5330), 1774 states have internal predecessors, (5330), 0 states have call successors, (0), 0 states have 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:37:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 5330 transitions. [2025-04-13 22:37:30,268 INFO L79 Accepts]: Start accepts. Automaton has 1775 states and 5330 transitions. Word has length 45 [2025-04-13 22:37:30,268 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:30,268 INFO L485 AbstractCegarLoop]: Abstraction has 1775 states and 5330 transitions. [2025-04-13 22:37:30,269 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:30,269 INFO L278 IsEmpty]: Start isEmpty. Operand 1775 states and 5330 transitions. [2025-04-13 22:37:30,271 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:30,271 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:30,271 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, 1, 1, 1, 1] [2025-04-13 22:37:30,271 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 22:37:30,271 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:37:30,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:30,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1344287786, now seen corresponding path program 4 times [2025-04-13 22:37:30,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:30,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004666735] [2025-04-13 22:37:30,272 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:37:30,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:30,278 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 22:37:30,284 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:30,285 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:37:30,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:30,377 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:37:30,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:30,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004666735] [2025-04-13 22:37:30,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004666735] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:30,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:30,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:37:30,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344539914] [2025-04-13 22:37:30,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:30,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:37:30,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:30,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:37:30,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:37:30,378 INFO L87 Difference]: Start difference. First operand 1775 states and 5330 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:30,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:30,528 INFO L93 Difference]: Finished difference Result 2135 states and 6335 transitions. [2025-04-13 22:37:30,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:37:30,528 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:30,528 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:30,541 INFO L225 Difference]: With dead ends: 2135 [2025-04-13 22:37:30,541 INFO L226 Difference]: Without dead ends: 638 [2025-04-13 22:37:30,543 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:37:30,544 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 81 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:30,544 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 42 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:37:30,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-04-13 22:37:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 490. [2025-04-13 22:37:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 2.7955010224948875) internal successors, (1367), 489 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have 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:37:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1367 transitions. [2025-04-13 22:37:30,563 INFO L79 Accepts]: Start accepts. Automaton has 490 states and 1367 transitions. Word has length 45 [2025-04-13 22:37:30,563 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:30,563 INFO L485 AbstractCegarLoop]: Abstraction has 490 states and 1367 transitions. [2025-04-13 22:37:30,563 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:30,563 INFO L278 IsEmpty]: Start isEmpty. Operand 490 states and 1367 transitions. [2025-04-13 22:37:30,564 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:30,564 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:30,564 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, 1, 1, 1, 1] [2025-04-13 22:37:30,564 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 22:37:30,564 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:37:30,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:30,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1539819114, now seen corresponding path program 5 times [2025-04-13 22:37:30,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:30,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854119832] [2025-04-13 22:37:30,565 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:37:30,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:30,570 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:30,574 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:30,574 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:37:30,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:30,653 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:37:30,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:30,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854119832] [2025-04-13 22:37:30,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854119832] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:30,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:30,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:37:30,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999011792] [2025-04-13 22:37:30,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:30,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:37:30,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:30,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:37:30,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:37:30,654 INFO L87 Difference]: Start difference. First operand 490 states and 1367 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:30,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:30,777 INFO L93 Difference]: Finished difference Result 866 states and 2421 transitions. [2025-04-13 22:37:30,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:37:30,777 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:30,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:30,785 INFO L225 Difference]: With dead ends: 866 [2025-04-13 22:37:30,786 INFO L226 Difference]: Without dead ends: 638 [2025-04-13 22:37:30,786 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:37:30,787 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 57 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:30,787 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 36 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:37:30,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-04-13 22:37:30,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 442. [2025-04-13 22:37:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 2.7188208616780045) internal successors, (1199), 441 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have 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:37:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1199 transitions. [2025-04-13 22:37:30,798 INFO L79 Accepts]: Start accepts. Automaton has 442 states and 1199 transitions. Word has length 45 [2025-04-13 22:37:30,799 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:30,799 INFO L485 AbstractCegarLoop]: Abstraction has 442 states and 1199 transitions. [2025-04-13 22:37:30,799 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:30,799 INFO L278 IsEmpty]: Start isEmpty. Operand 442 states and 1199 transitions. [2025-04-13 22:37:30,799 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:30,799 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:30,799 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, 1, 1, 1, 1] [2025-04-13 22:37:30,800 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 22:37:30,800 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:37:30,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:30,800 INFO L85 PathProgramCache]: Analyzing trace with hash -954121384, now seen corresponding path program 6 times [2025-04-13 22:37:30,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:30,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991291629] [2025-04-13 22:37:30,800 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:37:30,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:30,808 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:30,811 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:30,811 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:37:30,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:37:30,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:30,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991291629] [2025-04-13 22:37:30,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991291629] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:30,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:30,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:37:30,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759337052] [2025-04-13 22:37:30,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:30,877 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:37:30,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:30,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:37:30,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:37:30,877 INFO L87 Difference]: Start difference. First operand 442 states and 1199 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:30,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:30,998 INFO L93 Difference]: Finished difference Result 638 states and 1742 transitions. [2025-04-13 22:37:30,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:37:30,998 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:30,998 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:31,006 INFO L225 Difference]: With dead ends: 638 [2025-04-13 22:37:31,006 INFO L226 Difference]: Without dead ends: 410 [2025-04-13 22:37:31,007 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:37:31,008 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 51 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:31,008 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 36 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:37:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-04-13 22:37:31,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2025-04-13 22:37:31,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 2.7163814180929093) internal successors, (1111), 409 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have 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:37:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1111 transitions. [2025-04-13 22:37:31,020 INFO L79 Accepts]: Start accepts. Automaton has 410 states and 1111 transitions. Word has length 45 [2025-04-13 22:37:31,020 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:31,020 INFO L485 AbstractCegarLoop]: Abstraction has 410 states and 1111 transitions. [2025-04-13 22:37:31,020 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:31,020 INFO L278 IsEmpty]: Start isEmpty. Operand 410 states and 1111 transitions. [2025-04-13 22:37:31,020 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 22:37:31,020 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:31,021 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, 1, 1, 1, 1] [2025-04-13 22:37:31,021 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 22:37:31,021 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:37:31,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:31,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1578800336, now seen corresponding path program 7 times [2025-04-13 22:37:31,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:31,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519386250] [2025-04-13 22:37:31,021 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:31,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:31,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 22:37:31,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 22:37:31,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:31,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:31,096 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:37:31,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:31,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519386250] [2025-04-13 22:37:31,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519386250] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:31,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:31,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:37:31,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521376684] [2025-04-13 22:37:31,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:31,097 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:37:31,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:31,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:37:31,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:37:31,097 INFO L87 Difference]: Start difference. First operand 410 states and 1111 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:31,184 INFO L93 Difference]: Finished difference Result 410 states and 1111 transitions. [2025-04-13 22:37:31,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:37:31,184 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-04-13 22:37:31,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:31,192 INFO L225 Difference]: With dead ends: 410 [2025-04-13 22:37:31,192 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 22:37:31,193 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:37:31,193 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:31,193 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 36 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:37:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 22:37:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 22:37:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have 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:37:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 22:37:31,199 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2025-04-13 22:37:31,199 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:31,199 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 22:37:31,199 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have 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:37:31,199 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 22:37:31,200 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 22:37:31,202 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 22:37:31,202 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 22:37:31,202 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 22:37:31,202 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 22:37:31,202 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 22:37:31,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 22:37:31,204 INFO L422 BasicCegarLoop]: Path program histogram: [9, 7, 6, 1] [2025-04-13 22:37:31,206 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:37:31,206 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:37:31,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:37:31 BasicIcfg [2025-04-13 22:37:31,208 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:37:31,208 INFO L158 Benchmark]: Toolchain (without parser) took 13718.53ms. Allocated memory was 155.2MB in the beginning and 755.0MB in the end (delta: 599.8MB). Free memory was 111.0MB in the beginning and 540.1MB in the end (delta: -429.1MB). Peak memory consumption was 167.3MB. Max. memory is 8.0GB. [2025-04-13 22:37:31,208 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 163.6MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:37:31,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.99ms. Allocated memory is still 155.2MB. Free memory was 110.5MB in the beginning and 95.9MB in the end (delta: 14.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 22:37:31,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.80ms. Allocated memory is still 155.2MB. Free memory was 95.9MB in the beginning and 94.0MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:37:31,209 INFO L158 Benchmark]: Boogie Preprocessor took 22.05ms. Allocated memory is still 155.2MB. Free memory was 94.0MB in the beginning and 92.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:37:31,209 INFO L158 Benchmark]: IcfgBuilder took 477.97ms. Allocated memory is still 155.2MB. Free memory was 92.3MB in the beginning and 48.4MB in the end (delta: 44.0MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-13 22:37:31,209 INFO L158 Benchmark]: TraceAbstraction took 12969.75ms. Allocated memory was 155.2MB in the beginning and 755.0MB in the end (delta: 599.8MB). Free memory was 47.8MB in the beginning and 540.1MB in the end (delta: -492.3MB). Peak memory consumption was 104.3MB. Max. memory is 8.0GB. [2025-04-13 22:37:31,209 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.17ms. Allocated memory is still 163.6MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.99ms. Allocated memory is still 155.2MB. Free memory was 110.5MB in the beginning and 95.9MB in the end (delta: 14.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.80ms. Allocated memory is still 155.2MB. Free memory was 95.9MB in the beginning and 94.0MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.05ms. Allocated memory is still 155.2MB. Free memory was 94.0MB in the beginning and 92.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 477.97ms. Allocated memory is still 155.2MB. Free memory was 92.3MB in the beginning and 48.4MB in the end (delta: 44.0MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 12969.75ms. Allocated memory was 155.2MB in the beginning and 755.0MB in the end (delta: 599.8MB). Free memory was 47.8MB in the beginning and 540.1MB in the end (delta: -492.3MB). Peak memory consumption was 104.3MB. 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 - PositiveResult [Line: 107]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 86 locations, 91 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.3s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2441 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2441 mSDsluCounter, 997 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 674 mSDsCounter, 422 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7636 IncrementalHoareTripleChecker+Invalid, 8058 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 422 mSolverCounterUnsat, 323 mSDtfsCounter, 7636 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10075occurred in iteration=1, InterpolantAutomatonStates: 170, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 30625 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1034 NumberOfCodeBlocks, 1034 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1011 ConstructedInterpolants, 0 QuantifiedInterpolants, 2649 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 22:37:31,225 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...