/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:51:14,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:51:15,017 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 18:51:15,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:51:15,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:51:15,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:51:15,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:51:15,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:51:15,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:51:15,054 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:51:15,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:51:15,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:51:15,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:51:15,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:51:15,055 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:51:15,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:51:15,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:51:15,055 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:51:15,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:51:15,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:51:15,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:51:15,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:51:15,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:51:15,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:51:15,056 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:51:15,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:51:15,056 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:51:15,056 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:51:15,056 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:51:15,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:51:15,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:51:15,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:51:15,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:51:15,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:51:15,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:51:15,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:51:15,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:51:15,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:51:15,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:51:15,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:51:15,057 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:51:15,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:51:15,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:51:15,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:51:15,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:51:15,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:51:15,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:51:15,057 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 18:51:15,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:51:15,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:51:15,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:51:15,271 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:51:15,273 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:51:15,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-hard1.wvr.c [2025-04-13 18:51:16,520 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04b6ae5a6/a99f9b8afe744be09d51383475bc4d91/FLAG1fb7f04f5 [2025-04-13 18:51:16,707 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:51:16,707 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-hard1.wvr.c [2025-04-13 18:51:16,713 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04b6ae5a6/a99f9b8afe744be09d51383475bc4d91/FLAG1fb7f04f5 [2025-04-13 18:51:17,721 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04b6ae5a6/a99f9b8afe744be09d51383475bc4d91 [2025-04-13 18:51:17,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:51:17,724 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:51:17,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:51:17,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:51:17,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:51:17,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:51:17" (1/1) ... [2025-04-13 18:51:17,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18a29d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:17, skipping insertion in model container [2025-04-13 18:51:17,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:51:17" (1/1) ... [2025-04-13 18:51:17,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:51:17,920 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/test-hard1.wvr.c[3425,3438] [2025-04-13 18:51:17,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:51:17,933 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:51:17,965 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/test-hard1.wvr.c[3425,3438] [2025-04-13 18:51:17,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:51:17,981 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:51:17,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:17 WrapperNode [2025-04-13 18:51:17,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:51:17,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:51:17,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:51:17,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:51:17,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:17" (1/1) ... [2025-04-13 18:51:17,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:17" (1/1) ... [2025-04-13 18:51:18,011 INFO L138 Inliner]: procedures = 23, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-04-13 18:51:18,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:51:18,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:51:18,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:51:18,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:51:18,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:17" (1/1) ... [2025-04-13 18:51:18,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:17" (1/1) ... [2025-04-13 18:51:18,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:17" (1/1) ... [2025-04-13 18:51:18,042 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 18:51:18,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:17" (1/1) ... [2025-04-13 18:51:18,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:17" (1/1) ... [2025-04-13 18:51:18,045 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:17" (1/1) ... [2025-04-13 18:51:18,048 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:17" (1/1) ... [2025-04-13 18:51:18,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:17" (1/1) ... [2025-04-13 18:51:18,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:17" (1/1) ... [2025-04-13 18:51:18,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:17" (1/1) ... [2025-04-13 18:51:18,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:51:18,055 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:51:18,055 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:51:18,055 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:51:18,056 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:17" (1/1) ... [2025-04-13 18:51:18,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:51:18,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:18,080 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 18:51:18,083 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 18:51:18,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:51:18,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:51:18,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:51:18,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:51:18,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:51:18,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:51:18,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:51:18,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 18:51:18,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 18:51:18,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:51:18,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 18:51:18,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 18:51:18,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:51:18,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:51:18,101 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:51:18,159 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:51:18,161 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:51:18,309 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:51:18,309 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:51:18,309 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:51:18,460 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:51:18,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:51:18 BoogieIcfgContainer [2025-04-13 18:51:18,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:51:18,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:51:18,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:51:18,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:51:18,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:51:17" (1/3) ... [2025-04-13 18:51:18,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bab2320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:51:18, skipping insertion in model container [2025-04-13 18:51:18,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:17" (2/3) ... [2025-04-13 18:51:18,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bab2320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:51:18, skipping insertion in model container [2025-04-13 18:51:18,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:51:18" (3/3) ... [2025-04-13 18:51:18,467 INFO L128 eAbstractionObserver]: Analyzing ICFG test-hard1.wvr.c [2025-04-13 18:51:18,478 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:51:18,479 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-hard1.wvr.c that has 5 procedures, 40 locations, 39 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 18:51:18,479 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:51:18,534 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 18:51:18,554 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 52 places, 43 transitions, 114 flow [2025-04-13 18:51:18,722 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3370 states, 3369 states have (on average 4.3395666369842685) internal successors, (14620), 3369 states have internal predecessors, (14620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:18,741 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:51:18,750 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;@4fa3344c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:51:18,750 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 18:51:18,763 INFO L278 IsEmpty]: Start isEmpty. Operand has 3370 states, 3369 states have (on average 4.3395666369842685) internal successors, (14620), 3369 states have internal predecessors, (14620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:18,791 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:51:18,792 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:18,792 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] [2025-04-13 18:51:18,793 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 18:51:18,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:18,797 INFO L85 PathProgramCache]: Analyzing trace with hash -244716664, now seen corresponding path program 1 times [2025-04-13 18:51:18,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:18,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110204236] [2025-04-13 18:51:18,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:51:18,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:18,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 18:51:18,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:51:18,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:18,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:19,088 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 18:51:19,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:19,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110204236] [2025-04-13 18:51:19,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110204236] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:19,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:19,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 18:51:19,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806918886] [2025-04-13 18:51:19,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:19,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:51:19,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:19,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:51:19,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:51:19,115 INFO L87 Difference]: Start difference. First operand has 3370 states, 3369 states have (on average 4.3395666369842685) internal successors, (14620), 3369 states have internal predecessors, (14620), 0 states have call successors, (0), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:19,406 INFO L93 Difference]: Finished difference Result 5027 states and 21762 transitions. [2025-04-13 18:51:19,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:51:19,408 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-04-13 18:51:19,408 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:19,486 INFO L225 Difference]: With dead ends: 5027 [2025-04-13 18:51:19,487 INFO L226 Difference]: Without dead ends: 5020 [2025-04-13 18:51:19,493 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:51:19,495 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:19,496 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 32 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:51:19,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5020 states. [2025-04-13 18:51:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5020 to 4069. [2025-04-13 18:51:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4069 states, 4068 states have (on average 4.326941986234021) internal successors, (17602), 4068 states have internal predecessors, (17602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4069 states to 4069 states and 17602 transitions. [2025-04-13 18:51:19,755 INFO L79 Accepts]: Start accepts. Automaton has 4069 states and 17602 transitions. Word has length 26 [2025-04-13 18:51:19,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:19,756 INFO L485 AbstractCegarLoop]: Abstraction has 4069 states and 17602 transitions. [2025-04-13 18:51:19,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:19,758 INFO L278 IsEmpty]: Start isEmpty. Operand 4069 states and 17602 transitions. [2025-04-13 18:51:19,770 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:51:19,770 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:19,770 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] [2025-04-13 18:51:19,771 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:51:19,771 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 18:51:19,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash 50304006, now seen corresponding path program 1 times [2025-04-13 18:51:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:19,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669861703] [2025-04-13 18:51:19,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:51:19,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:19,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:51:19,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:51:19,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:19,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:20,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:20,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669861703] [2025-04-13 18:51:20,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669861703] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:20,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970193344] [2025-04-13 18:51:20,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:51:20,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:20,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:20,145 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:51:20,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 18:51:20,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:51:20,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:51:20,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:20,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:20,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:51:20,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:20,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:20,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:20,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970193344] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:51:20,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:51:20,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-04-13 18:51:20,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854432416] [2025-04-13 18:51:20,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:51:20,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:51:20,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:20,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:51:20,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:51:20,877 INFO L87 Difference]: Start difference. First operand 4069 states and 17602 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:23,062 INFO L93 Difference]: Finished difference Result 16915 states and 73829 transitions. [2025-04-13 18:51:23,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:51:23,063 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 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 29 [2025-04-13 18:51:23,063 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:23,177 INFO L225 Difference]: With dead ends: 16915 [2025-04-13 18:51:23,177 INFO L226 Difference]: Without dead ends: 16242 [2025-04-13 18:51:23,186 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=551, Invalid=1171, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 18:51:23,186 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 504 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:23,187 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 285 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:51:23,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16242 states. [2025-04-13 18:51:23,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16242 to 6671. [2025-04-13 18:51:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6671 states, 6670 states have (on average 4.397301349325337) internal successors, (29330), 6670 states have internal predecessors, (29330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6671 states to 6671 states and 29330 transitions. [2025-04-13 18:51:23,618 INFO L79 Accepts]: Start accepts. Automaton has 6671 states and 29330 transitions. Word has length 29 [2025-04-13 18:51:23,618 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:23,619 INFO L485 AbstractCegarLoop]: Abstraction has 6671 states and 29330 transitions. [2025-04-13 18:51:23,619 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:23,619 INFO L278 IsEmpty]: Start isEmpty. Operand 6671 states and 29330 transitions. [2025-04-13 18:51:23,637 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:51:23,637 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:23,637 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] [2025-04-13 18:51:23,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 18:51:23,841 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:23,841 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 18:51:23,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:23,842 INFO L85 PathProgramCache]: Analyzing trace with hash -263132302, now seen corresponding path program 1 times [2025-04-13 18:51:23,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:23,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672027956] [2025-04-13 18:51:23,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:51:23,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:23,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:51:23,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:51:23,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:23,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:24,000 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 18:51:24,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:24,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672027956] [2025-04-13 18:51:24,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672027956] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:24,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:24,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:51:24,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026346824] [2025-04-13 18:51:24,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:24,001 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:51:24,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:24,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:51:24,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:51:24,001 INFO L87 Difference]: Start difference. First operand 6671 states and 29330 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:24,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:24,484 INFO L93 Difference]: Finished difference Result 10546 states and 44686 transitions. [2025-04-13 18:51:24,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:51:24,484 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:51:24,484 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:24,525 INFO L225 Difference]: With dead ends: 10546 [2025-04-13 18:51:24,525 INFO L226 Difference]: Without dead ends: 9465 [2025-04-13 18:51:24,531 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:51:24,531 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 90 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:24,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 84 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:51:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9465 states. [2025-04-13 18:51:25,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9465 to 8033. [2025-04-13 18:51:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8033 states, 8032 states have (on average 4.417704183266932) internal successors, (35483), 8032 states have internal predecessors, (35483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:25,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8033 states to 8033 states and 35483 transitions. [2025-04-13 18:51:25,125 INFO L79 Accepts]: Start accepts. Automaton has 8033 states and 35483 transitions. Word has length 29 [2025-04-13 18:51:25,125 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:25,125 INFO L485 AbstractCegarLoop]: Abstraction has 8033 states and 35483 transitions. [2025-04-13 18:51:25,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:25,125 INFO L278 IsEmpty]: Start isEmpty. Operand 8033 states and 35483 transitions. [2025-04-13 18:51:25,153 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:51:25,153 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:25,153 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] [2025-04-13 18:51:25,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:51:25,154 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 18:51:25,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:25,154 INFO L85 PathProgramCache]: Analyzing trace with hash 555333518, now seen corresponding path program 1 times [2025-04-13 18:51:25,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:25,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381225001] [2025-04-13 18:51:25,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:51:25,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:25,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:51:25,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:51:25,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:25,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:25,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:25,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381225001] [2025-04-13 18:51:25,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381225001] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:25,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:25,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:51:25,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17258835] [2025-04-13 18:51:25,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:25,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:51:25,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:25,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:51:25,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:51:25,370 INFO L87 Difference]: Start difference. First operand 8033 states and 35483 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:26,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:26,167 INFO L93 Difference]: Finished difference Result 12525 states and 53355 transitions. [2025-04-13 18:51:26,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:51:26,167 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:51:26,168 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:26,220 INFO L225 Difference]: With dead ends: 12525 [2025-04-13 18:51:26,220 INFO L226 Difference]: Without dead ends: 11902 [2025-04-13 18:51:26,228 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:51:26,229 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 134 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:26,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 66 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:51:26,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11902 states. [2025-04-13 18:51:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11902 to 10110. [2025-04-13 18:51:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10110 states, 10109 states have (on average 4.40182016025324) internal successors, (44498), 10109 states have internal predecessors, (44498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10110 states to 10110 states and 44498 transitions. [2025-04-13 18:51:26,779 INFO L79 Accepts]: Start accepts. Automaton has 10110 states and 44498 transitions. Word has length 29 [2025-04-13 18:51:26,779 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:26,779 INFO L485 AbstractCegarLoop]: Abstraction has 10110 states and 44498 transitions. [2025-04-13 18:51:26,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:26,779 INFO L278 IsEmpty]: Start isEmpty. Operand 10110 states and 44498 transitions. [2025-04-13 18:51:26,803 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:51:26,803 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:26,803 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] [2025-04-13 18:51:26,803 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:51:26,803 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 18:51:26,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:26,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1082425720, now seen corresponding path program 1 times [2025-04-13 18:51:26,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:26,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049339870] [2025-04-13 18:51:26,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:51:26,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:26,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:51:26,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:51:26,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:26,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:27,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:27,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049339870] [2025-04-13 18:51:27,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049339870] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:27,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:27,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:51:27,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346611340] [2025-04-13 18:51:27,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:27,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:51:27,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:27,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:51:27,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:51:27,038 INFO L87 Difference]: Start difference. First operand 10110 states and 44498 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:27,900 INFO L93 Difference]: Finished difference Result 12897 states and 54607 transitions. [2025-04-13 18:51:27,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:51:27,901 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:51:27,901 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:27,950 INFO L225 Difference]: With dead ends: 12897 [2025-04-13 18:51:27,950 INFO L226 Difference]: Without dead ends: 11882 [2025-04-13 18:51:27,957 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:51:27,957 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 125 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:27,957 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 66 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:51:27,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11882 states. [2025-04-13 18:51:28,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11882 to 10465. [2025-04-13 18:51:28,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10465 states, 10464 states have (on average 4.363245412844036) internal successors, (45657), 10464 states have internal predecessors, (45657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10465 states to 10465 states and 45657 transitions. [2025-04-13 18:51:28,787 INFO L79 Accepts]: Start accepts. Automaton has 10465 states and 45657 transitions. Word has length 29 [2025-04-13 18:51:28,787 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:28,787 INFO L485 AbstractCegarLoop]: Abstraction has 10465 states and 45657 transitions. [2025-04-13 18:51:28,787 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:28,787 INFO L278 IsEmpty]: Start isEmpty. Operand 10465 states and 45657 transitions. [2025-04-13 18:51:28,814 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:51:28,815 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:28,815 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] [2025-04-13 18:51:28,815 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:51:28,815 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 18:51:28,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:28,815 INFO L85 PathProgramCache]: Analyzing trace with hash 356130388, now seen corresponding path program 2 times [2025-04-13 18:51:28,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:28,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162739691] [2025-04-13 18:51:28,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:28,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:28,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:51:28,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:51:28,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:51:28,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:29,006 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 18:51:29,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:29,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162739691] [2025-04-13 18:51:29,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162739691] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:29,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:29,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:51:29,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360654970] [2025-04-13 18:51:29,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:29,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:51:29,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:29,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:51:29,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:51:29,007 INFO L87 Difference]: Start difference. First operand 10465 states and 45657 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:29,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:29,888 INFO L93 Difference]: Finished difference Result 18227 states and 75314 transitions. [2025-04-13 18:51:29,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:51:29,889 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:51:29,889 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:29,955 INFO L225 Difference]: With dead ends: 18227 [2025-04-13 18:51:29,955 INFO L226 Difference]: Without dead ends: 16023 [2025-04-13 18:51:29,965 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 18:51:29,966 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 83 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:29,966 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 87 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:51:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16023 states. [2025-04-13 18:51:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16023 to 11637. [2025-04-13 18:51:30,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11637 states, 11636 states have (on average 4.3846682708834654) internal successors, (51020), 11636 states have internal predecessors, (51020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:30,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11637 states to 11637 states and 51020 transitions. [2025-04-13 18:51:30,624 INFO L79 Accepts]: Start accepts. Automaton has 11637 states and 51020 transitions. Word has length 29 [2025-04-13 18:51:30,624 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:30,624 INFO L485 AbstractCegarLoop]: Abstraction has 11637 states and 51020 transitions. [2025-04-13 18:51:30,624 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:30,624 INFO L278 IsEmpty]: Start isEmpty. Operand 11637 states and 51020 transitions. [2025-04-13 18:51:30,648 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:51:30,648 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:30,649 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] [2025-04-13 18:51:30,649 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:51:30,649 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 18:51:30,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:30,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1942552170, now seen corresponding path program 3 times [2025-04-13 18:51:30,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:30,649 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614706781] [2025-04-13 18:51:30,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:51:30,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:30,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:51:30,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:51:30,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:51:30,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:30,771 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 18:51:30,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:30,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614706781] [2025-04-13 18:51:30,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614706781] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:30,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:30,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:51:30,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392047022] [2025-04-13 18:51:30,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:30,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:51:30,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:30,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:51:30,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:51:30,774 INFO L87 Difference]: Start difference. First operand 11637 states and 51020 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:31,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:31,571 INFO L93 Difference]: Finished difference Result 16217 states and 67223 transitions. [2025-04-13 18:51:31,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:51:31,572 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:51:31,573 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:31,632 INFO L225 Difference]: With dead ends: 16217 [2025-04-13 18:51:31,632 INFO L226 Difference]: Without dead ends: 14073 [2025-04-13 18:51:31,642 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:51:31,642 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 84 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:31,643 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 96 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:51:31,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14073 states. [2025-04-13 18:51:32,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14073 to 11539. [2025-04-13 18:51:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11539 states, 11538 states have (on average 4.396429190500953) internal successors, (50726), 11538 states have internal predecessors, (50726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11539 states to 11539 states and 50726 transitions. [2025-04-13 18:51:32,303 INFO L79 Accepts]: Start accepts. Automaton has 11539 states and 50726 transitions. Word has length 29 [2025-04-13 18:51:32,304 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:32,304 INFO L485 AbstractCegarLoop]: Abstraction has 11539 states and 50726 transitions. [2025-04-13 18:51:32,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:32,304 INFO L278 IsEmpty]: Start isEmpty. Operand 11539 states and 50726 transitions. [2025-04-13 18:51:32,327 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:51:32,327 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:32,327 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] [2025-04-13 18:51:32,327 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:51:32,327 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 18:51:32,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:32,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2041759606, now seen corresponding path program 4 times [2025-04-13 18:51:32,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:32,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411983001] [2025-04-13 18:51:32,328 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:51:32,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:32,332 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:51:32,338 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:51:32,338 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:51:32,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:32,447 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 18:51:32,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:32,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411983001] [2025-04-13 18:51:32,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411983001] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:32,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:32,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:51:32,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366786322] [2025-04-13 18:51:32,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:32,448 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:51:32,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:32,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:51:32,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:51:32,450 INFO L87 Difference]: Start difference. First operand 11539 states and 50726 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:34,535 INFO L93 Difference]: Finished difference Result 24391 states and 106541 transitions. [2025-04-13 18:51:34,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:51:34,536 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:51:34,536 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:34,640 INFO L225 Difference]: With dead ends: 24391 [2025-04-13 18:51:34,640 INFO L226 Difference]: Without dead ends: 23075 [2025-04-13 18:51:34,653 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:51:34,653 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 163 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:34,654 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 107 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:51:34,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23075 states. [2025-04-13 18:51:35,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23075 to 11227. [2025-04-13 18:51:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11227 states, 11226 states have (on average 4.362194904685551) internal successors, (48970), 11226 states have internal predecessors, (48970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11227 states to 11227 states and 48970 transitions. [2025-04-13 18:51:35,558 INFO L79 Accepts]: Start accepts. Automaton has 11227 states and 48970 transitions. Word has length 29 [2025-04-13 18:51:35,559 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:35,559 INFO L485 AbstractCegarLoop]: Abstraction has 11227 states and 48970 transitions. [2025-04-13 18:51:35,559 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:35,559 INFO L278 IsEmpty]: Start isEmpty. Operand 11227 states and 48970 transitions. [2025-04-13 18:51:35,582 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:51:35,582 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:35,582 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] [2025-04-13 18:51:35,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 18:51:35,582 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 18:51:35,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:35,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2057864376, now seen corresponding path program 2 times [2025-04-13 18:51:35,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:35,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671098416] [2025-04-13 18:51:35,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:35,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:35,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:51:35,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:51:35,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:51:35,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:35,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:35,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671098416] [2025-04-13 18:51:35,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671098416] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:35,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:35,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:51:35,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186264177] [2025-04-13 18:51:35,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:35,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:51:35,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:35,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:51:35,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:51:35,702 INFO L87 Difference]: Start difference. First operand 11227 states and 48970 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:37,053 INFO L93 Difference]: Finished difference Result 18071 states and 76292 transitions. [2025-04-13 18:51:37,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:51:37,053 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:51:37,053 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:37,117 INFO L225 Difference]: With dead ends: 18071 [2025-04-13 18:51:37,117 INFO L226 Difference]: Without dead ends: 17316 [2025-04-13 18:51:37,125 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:51:37,125 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 146 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:37,125 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 106 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:51:37,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17316 states. [2025-04-13 18:51:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17316 to 12848. [2025-04-13 18:51:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12848 states, 12847 states have (on average 4.36670039697984) internal successors, (56099), 12847 states have internal predecessors, (56099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12848 states to 12848 states and 56099 transitions. [2025-04-13 18:51:38,101 INFO L79 Accepts]: Start accepts. Automaton has 12848 states and 56099 transitions. Word has length 29 [2025-04-13 18:51:38,102 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:38,102 INFO L485 AbstractCegarLoop]: Abstraction has 12848 states and 56099 transitions. [2025-04-13 18:51:38,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:38,102 INFO L278 IsEmpty]: Start isEmpty. Operand 12848 states and 56099 transitions. [2025-04-13 18:51:38,127 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:51:38,128 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:38,128 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] [2025-04-13 18:51:38,128 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:51:38,128 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 18:51:38,128 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:38,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1319412176, now seen corresponding path program 2 times [2025-04-13 18:51:38,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:38,128 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879247405] [2025-04-13 18:51:38,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:38,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:38,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:51:38,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:51:38,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:51:38,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:38,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:38,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879247405] [2025-04-13 18:51:38,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879247405] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:38,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:38,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:51:38,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214146280] [2025-04-13 18:51:38,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:38,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:51:38,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:38,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:51:38,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:51:38,242 INFO L87 Difference]: Start difference. First operand 12848 states and 56099 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:39,682 INFO L93 Difference]: Finished difference Result 18415 states and 77414 transitions. [2025-04-13 18:51:39,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:51:39,682 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:51:39,682 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:39,759 INFO L225 Difference]: With dead ends: 18415 [2025-04-13 18:51:39,759 INFO L226 Difference]: Without dead ends: 17194 [2025-04-13 18:51:39,769 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:51:39,770 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 202 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:39,770 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 74 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:51:39,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17194 states. [2025-04-13 18:51:40,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17194 to 12782. [2025-04-13 18:51:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12782 states, 12781 states have (on average 4.369219935842266) internal successors, (55843), 12781 states have internal predecessors, (55843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12782 states to 12782 states and 55843 transitions. [2025-04-13 18:51:40,786 INFO L79 Accepts]: Start accepts. Automaton has 12782 states and 55843 transitions. Word has length 29 [2025-04-13 18:51:40,786 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:40,786 INFO L485 AbstractCegarLoop]: Abstraction has 12782 states and 55843 transitions. [2025-04-13 18:51:40,786 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:40,786 INFO L278 IsEmpty]: Start isEmpty. Operand 12782 states and 55843 transitions. [2025-04-13 18:51:40,814 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:51:40,815 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:40,815 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] [2025-04-13 18:51:40,815 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 18:51:40,815 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 18:51:40,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:40,815 INFO L85 PathProgramCache]: Analyzing trace with hash 14422340, now seen corresponding path program 3 times [2025-04-13 18:51:40,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:40,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627460548] [2025-04-13 18:51:40,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:51:40,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:40,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:51:40,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:51:40,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:51:40,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:40,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:40,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627460548] [2025-04-13 18:51:40,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627460548] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:40,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:40,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:51:40,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958963130] [2025-04-13 18:51:40,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:40,945 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:51:40,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:40,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:51:40,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:51:40,945 INFO L87 Difference]: Start difference. First operand 12782 states and 55843 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:43,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:43,126 INFO L93 Difference]: Finished difference Result 23005 states and 97022 transitions. [2025-04-13 18:51:43,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:51:43,126 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:51:43,126 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:43,284 INFO L225 Difference]: With dead ends: 23005 [2025-04-13 18:51:43,284 INFO L226 Difference]: Without dead ends: 21831 [2025-04-13 18:51:43,295 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:51:43,295 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 206 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:43,295 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 90 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:51:43,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21831 states. [2025-04-13 18:51:44,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21831 to 14195. [2025-04-13 18:51:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14195 states, 14194 states have (on average 4.4472312244610395) internal successors, (63124), 14194 states have internal predecessors, (63124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14195 states to 14195 states and 63124 transitions. [2025-04-13 18:51:44,569 INFO L79 Accepts]: Start accepts. Automaton has 14195 states and 63124 transitions. Word has length 29 [2025-04-13 18:51:44,569 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:44,569 INFO L485 AbstractCegarLoop]: Abstraction has 14195 states and 63124 transitions. [2025-04-13 18:51:44,569 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:44,569 INFO L278 IsEmpty]: Start isEmpty. Operand 14195 states and 63124 transitions. [2025-04-13 18:51:44,600 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:51:44,600 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:44,600 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] [2025-04-13 18:51:44,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 18:51:44,600 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 18:51:44,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:44,600 INFO L85 PathProgramCache]: Analyzing trace with hash 469377798, now seen corresponding path program 4 times [2025-04-13 18:51:44,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:44,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241689044] [2025-04-13 18:51:44,601 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:51:44,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:44,604 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:51:44,609 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:51:44,609 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:51:44,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:44,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:44,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241689044] [2025-04-13 18:51:44,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241689044] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:44,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:44,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:51:44,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113373149] [2025-04-13 18:51:44,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:44,731 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:51:44,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:44,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:51:44,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:51:44,732 INFO L87 Difference]: Start difference. First operand 14195 states and 63124 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:47,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:47,755 INFO L93 Difference]: Finished difference Result 28485 states and 120780 transitions. [2025-04-13 18:51:47,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:51:47,755 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:51:47,755 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:47,874 INFO L225 Difference]: With dead ends: 28485 [2025-04-13 18:51:47,875 INFO L226 Difference]: Without dead ends: 27693 [2025-04-13 18:51:47,886 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:51:47,886 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 287 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:47,886 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 89 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:51:47,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27693 states. [2025-04-13 18:51:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27693 to 15084. [2025-04-13 18:51:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15084 states, 15083 states have (on average 4.4829277995093815) internal successors, (67616), 15083 states have internal predecessors, (67616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15084 states to 15084 states and 67616 transitions. [2025-04-13 18:51:49,362 INFO L79 Accepts]: Start accepts. Automaton has 15084 states and 67616 transitions. Word has length 29 [2025-04-13 18:51:49,363 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:49,363 INFO L485 AbstractCegarLoop]: Abstraction has 15084 states and 67616 transitions. [2025-04-13 18:51:49,363 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:49,363 INFO L278 IsEmpty]: Start isEmpty. Operand 15084 states and 67616 transitions. [2025-04-13 18:51:49,392 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:51:49,393 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:49,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:51:49,393 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 18:51:49,393 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 18:51:49,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:49,393 INFO L85 PathProgramCache]: Analyzing trace with hash 782305280, now seen corresponding path program 3 times [2025-04-13 18:51:49,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:49,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309865544] [2025-04-13 18:51:49,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:51:49,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:49,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:51:49,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:51:49,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:51:49,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:49,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:49,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:49,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309865544] [2025-04-13 18:51:49,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309865544] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:49,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:49,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:51:49,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668833393] [2025-04-13 18:51:49,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:49,533 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:51:49,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:49,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:51:49,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:51:49,534 INFO L87 Difference]: Start difference. First operand 15084 states and 67616 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:52,432 INFO L93 Difference]: Finished difference Result 26444 states and 114297 transitions. [2025-04-13 18:51:52,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:51:52,432 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:51:52,432 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:52,551 INFO L225 Difference]: With dead ends: 26444 [2025-04-13 18:51:52,551 INFO L226 Difference]: Without dead ends: 24938 [2025-04-13 18:51:52,561 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:51:52,562 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 180 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:52,562 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 85 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:51:52,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24938 states. [2025-04-13 18:51:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24938 to 16256. [2025-04-13 18:51:54,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16256 states, 16255 states have (on average 4.528944940018456) internal successors, (73618), 16255 states have internal predecessors, (73618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16256 states to 16256 states and 73618 transitions. [2025-04-13 18:51:54,305 INFO L79 Accepts]: Start accepts. Automaton has 16256 states and 73618 transitions. Word has length 29 [2025-04-13 18:51:54,306 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:54,306 INFO L485 AbstractCegarLoop]: Abstraction has 16256 states and 73618 transitions. [2025-04-13 18:51:54,306 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:54,306 INFO L278 IsEmpty]: Start isEmpty. Operand 16256 states and 73618 transitions. [2025-04-13 18:51:54,339 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:51:54,339 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:54,339 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] [2025-04-13 18:51:54,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 18:51:54,339 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 18:51:54,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:54,340 INFO L85 PathProgramCache]: Analyzing trace with hash -192770484, now seen corresponding path program 2 times [2025-04-13 18:51:54,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:54,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102339469] [2025-04-13 18:51:54,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:54,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:54,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:51:54,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:51:54,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:51:54,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:54,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:54,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102339469] [2025-04-13 18:51:54,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102339469] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:54,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487864989] [2025-04-13 18:51:54,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:54,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:54,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:54,457 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:51:54,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 18:51:54,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:51:54,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:51:54,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:51:54,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:54,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:51:54,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:54,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:51:54,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487864989] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:54,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:51:54,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2025-04-13 18:51:54,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586387] [2025-04-13 18:51:54,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:54,711 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:51:54,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:54,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:51:54,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:51:54,712 INFO L87 Difference]: Start difference. First operand 16256 states and 73618 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:57,479 INFO L93 Difference]: Finished difference Result 23400 states and 102622 transitions. [2025-04-13 18:51:57,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:51:57,480 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:51:57,480 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:57,592 INFO L225 Difference]: With dead ends: 23400 [2025-04-13 18:51:57,593 INFO L226 Difference]: Without dead ends: 22008 [2025-04-13 18:51:57,603 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:51:57,604 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 83 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:57,604 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 101 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:51:57,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22008 states. [2025-04-13 18:51:59,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22008 to 16568. [2025-04-13 18:51:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16568 states, 16567 states have (on average 4.523872759099414) internal successors, (74947), 16567 states have internal predecessors, (74947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16568 states to 16568 states and 74947 transitions. [2025-04-13 18:51:59,650 INFO L79 Accepts]: Start accepts. Automaton has 16568 states and 74947 transitions. Word has length 29 [2025-04-13 18:51:59,650 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:59,651 INFO L485 AbstractCegarLoop]: Abstraction has 16568 states and 74947 transitions. [2025-04-13 18:51:59,651 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:59,651 INFO L278 IsEmpty]: Start isEmpty. Operand 16568 states and 74947 transitions. [2025-04-13 18:51:59,691 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:51:59,691 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:59,691 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] [2025-04-13 18:51:59,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 18:51:59,892 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 18:51:59,892 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 18:51:59,892 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:59,892 INFO L85 PathProgramCache]: Analyzing trace with hash 252444576, now seen corresponding path program 5 times [2025-04-13 18:51:59,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:59,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141019422] [2025-04-13 18:51:59,893 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:51:59,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:59,902 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:51:59,906 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:51:59,906 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:51:59,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:00,031 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 18:52:00,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:00,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141019422] [2025-04-13 18:52:00,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141019422] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:00,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:00,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:52:00,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221798601] [2025-04-13 18:52:00,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:00,032 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:52:00,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:00,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:52:00,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:52:00,033 INFO L87 Difference]: Start difference. First operand 16568 states and 74947 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:03,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:03,062 INFO L93 Difference]: Finished difference Result 23806 states and 104993 transitions. [2025-04-13 18:52:03,062 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:52:03,062 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:52:03,062 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:03,162 INFO L225 Difference]: With dead ends: 23806 [2025-04-13 18:52:03,162 INFO L226 Difference]: Without dead ends: 22489 [2025-04-13 18:52:03,171 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 18:52:03,172 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 99 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:03,172 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 159 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:52:03,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22489 states. [2025-04-13 18:52:04,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22489 to 16548. [2025-04-13 18:52:04,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16548 states, 16547 states have (on average 4.5100622469329785) internal successors, (74628), 16547 states have internal predecessors, (74628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16548 states to 16548 states and 74628 transitions. [2025-04-13 18:52:05,002 INFO L79 Accepts]: Start accepts. Automaton has 16548 states and 74628 transitions. Word has length 29 [2025-04-13 18:52:05,002 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:05,002 INFO L485 AbstractCegarLoop]: Abstraction has 16548 states and 74628 transitions. [2025-04-13 18:52:05,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:05,002 INFO L278 IsEmpty]: Start isEmpty. Operand 16548 states and 74628 transitions. [2025-04-13 18:52:05,035 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:52:05,035 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:05,035 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] [2025-04-13 18:52:05,035 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 18:52:05,036 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 18:52:05,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:05,036 INFO L85 PathProgramCache]: Analyzing trace with hash -486971548, now seen corresponding path program 4 times [2025-04-13 18:52:05,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:05,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769615633] [2025-04-13 18:52:05,036 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:52:05,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:05,039 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:52:05,042 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:52:05,043 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:52:05,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:05,174 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 18:52:05,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:05,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769615633] [2025-04-13 18:52:05,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769615633] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:05,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:05,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:52:05,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879122849] [2025-04-13 18:52:05,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:05,174 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:52:05,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:05,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:52:05,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:52:05,175 INFO L87 Difference]: Start difference. First operand 16548 states and 74628 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:09,295 INFO L93 Difference]: Finished difference Result 29435 states and 125055 transitions. [2025-04-13 18:52:09,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:52:09,295 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:52:09,296 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:09,433 INFO L225 Difference]: With dead ends: 29435 [2025-04-13 18:52:09,433 INFO L226 Difference]: Without dead ends: 27908 [2025-04-13 18:52:09,444 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:52:09,444 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 239 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:09,444 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 92 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:52:09,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27908 states. [2025-04-13 18:52:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27908 to 16759. [2025-04-13 18:52:11,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16759 states, 16758 states have (on average 4.51390380713689) internal successors, (75644), 16758 states have internal predecessors, (75644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16759 states to 16759 states and 75644 transitions. [2025-04-13 18:52:11,507 INFO L79 Accepts]: Start accepts. Automaton has 16759 states and 75644 transitions. Word has length 29 [2025-04-13 18:52:11,508 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:11,508 INFO L485 AbstractCegarLoop]: Abstraction has 16759 states and 75644 transitions. [2025-04-13 18:52:11,508 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:11,508 INFO L278 IsEmpty]: Start isEmpty. Operand 16759 states and 75644 transitions. [2025-04-13 18:52:11,541 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:52:11,541 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:11,542 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] [2025-04-13 18:52:11,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 18:52:11,542 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 18:52:11,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:11,542 INFO L85 PathProgramCache]: Analyzing trace with hash -36691762, now seen corresponding path program 5 times [2025-04-13 18:52:11,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:11,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420908574] [2025-04-13 18:52:11,542 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:52:11,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:11,545 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:52:11,549 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:52:11,549 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:52:11,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:11,662 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 18:52:11,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:11,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420908574] [2025-04-13 18:52:11,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420908574] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:11,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:11,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:52:11,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183037817] [2025-04-13 18:52:11,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:11,663 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:52:11,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:11,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:52:11,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:52:11,663 INFO L87 Difference]: Start difference. First operand 16759 states and 75644 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:16,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:16,289 INFO L93 Difference]: Finished difference Result 27176 states and 117815 transitions. [2025-04-13 18:52:16,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:52:16,292 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:52:16,292 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:16,422 INFO L225 Difference]: With dead ends: 27176 [2025-04-13 18:52:16,422 INFO L226 Difference]: Without dead ends: 26506 [2025-04-13 18:52:16,433 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:52:16,433 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 198 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:16,434 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 94 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:52:16,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26506 states. [2025-04-13 18:52:18,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26506 to 16773. [2025-04-13 18:52:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16773 states, 16772 states have (on average 4.52271643214882) internal successors, (75855), 16772 states have internal predecessors, (75855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16773 states to 16773 states and 75855 transitions. [2025-04-13 18:52:18,595 INFO L79 Accepts]: Start accepts. Automaton has 16773 states and 75855 transitions. Word has length 29 [2025-04-13 18:52:18,595 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:18,595 INFO L485 AbstractCegarLoop]: Abstraction has 16773 states and 75855 transitions. [2025-04-13 18:52:18,595 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:18,595 INFO L278 IsEmpty]: Start isEmpty. Operand 16773 states and 75855 transitions. [2025-04-13 18:52:18,632 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:52:18,632 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:18,632 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] [2025-04-13 18:52:18,632 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 18:52:18,632 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 18:52:18,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:18,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1457958966, now seen corresponding path program 6 times [2025-04-13 18:52:18,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:18,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080336965] [2025-04-13 18:52:18,633 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:52:18,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:18,636 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:52:18,639 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:52:18,640 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:52:18,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:18,747 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 18:52:18,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:18,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080336965] [2025-04-13 18:52:18,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080336965] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:18,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:18,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:52:18,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103907063] [2025-04-13 18:52:18,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:18,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:52:18,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:18,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:52:18,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:52:18,748 INFO L87 Difference]: Start difference. First operand 16773 states and 75855 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:21,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:21,840 INFO L93 Difference]: Finished difference Result 19952 states and 88533 transitions. [2025-04-13 18:52:21,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:52:21,840 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:52:21,840 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:21,917 INFO L225 Difference]: With dead ends: 19952 [2025-04-13 18:52:21,917 INFO L226 Difference]: Without dead ends: 19098 [2025-04-13 18:52:21,925 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:52:21,926 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 103 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:21,926 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 50 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:52:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19098 states. [2025-04-13 18:52:23,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19098 to 16823. [2025-04-13 18:52:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16823 states, 16822 states have (on average 4.513613125668767) internal successors, (75928), 16822 states have internal predecessors, (75928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16823 states to 16823 states and 75928 transitions. [2025-04-13 18:52:23,891 INFO L79 Accepts]: Start accepts. Automaton has 16823 states and 75928 transitions. Word has length 29 [2025-04-13 18:52:23,892 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:23,892 INFO L485 AbstractCegarLoop]: Abstraction has 16823 states and 75928 transitions. [2025-04-13 18:52:23,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:23,892 INFO L278 IsEmpty]: Start isEmpty. Operand 16823 states and 75928 transitions. [2025-04-13 18:52:24,000 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:52:24,000 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:24,000 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] [2025-04-13 18:52:24,001 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 18:52:24,001 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 18:52:24,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:24,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1248196792, now seen corresponding path program 3 times [2025-04-13 18:52:24,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:24,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979076705] [2025-04-13 18:52:24,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:52:24,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:24,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:52:24,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:52:24,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:52:24,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:52:24,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:24,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979076705] [2025-04-13 18:52:24,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979076705] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:24,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:24,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:52:24,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998850376] [2025-04-13 18:52:24,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:24,114 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:52:24,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:24,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:52:24,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:52:24,115 INFO L87 Difference]: Start difference. First operand 16823 states and 75928 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:27,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:27,815 INFO L93 Difference]: Finished difference Result 24005 states and 106253 transitions. [2025-04-13 18:52:27,815 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:52:27,815 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:52:27,815 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:27,923 INFO L225 Difference]: With dead ends: 24005 [2025-04-13 18:52:27,924 INFO L226 Difference]: Without dead ends: 23016 [2025-04-13 18:52:27,933 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:52:27,933 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 96 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:27,933 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 69 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:52:27,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23016 states. [2025-04-13 18:52:30,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23016 to 18011. [2025-04-13 18:52:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18011 states, 18010 states have (on average 4.525930038867296) internal successors, (81512), 18010 states have internal predecessors, (81512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18011 states to 18011 states and 81512 transitions. [2025-04-13 18:52:30,326 INFO L79 Accepts]: Start accepts. Automaton has 18011 states and 81512 transitions. Word has length 29 [2025-04-13 18:52:30,327 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:30,327 INFO L485 AbstractCegarLoop]: Abstraction has 18011 states and 81512 transitions. [2025-04-13 18:52:30,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:30,327 INFO L278 IsEmpty]: Start isEmpty. Operand 18011 states and 81512 transitions. [2025-04-13 18:52:30,360 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:52:30,360 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:30,360 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] [2025-04-13 18:52:30,360 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 18:52:30,360 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 18:52:30,361 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:30,361 INFO L85 PathProgramCache]: Analyzing trace with hash 994094328, now seen corresponding path program 4 times [2025-04-13 18:52:30,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:30,361 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583067198] [2025-04-13 18:52:30,361 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:52:30,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:30,363 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:52:30,366 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:52:30,366 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:52:30,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:52:30,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:30,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583067198] [2025-04-13 18:52:30,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583067198] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:30,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:30,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:52:30,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767786035] [2025-04-13 18:52:30,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:30,481 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:52:30,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:30,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:52:30,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:52:30,481 INFO L87 Difference]: Start difference. First operand 18011 states and 81512 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:35,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:35,479 INFO L93 Difference]: Finished difference Result 29674 states and 129139 transitions. [2025-04-13 18:52:35,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:52:35,479 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:52:35,479 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:35,626 INFO L225 Difference]: With dead ends: 29674 [2025-04-13 18:52:35,626 INFO L226 Difference]: Without dead ends: 28189 [2025-04-13 18:52:35,636 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:52:35,636 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 132 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:35,637 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 83 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:52:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28189 states. [2025-04-13 18:52:38,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28189 to 18835. [2025-04-13 18:52:38,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18835 states, 18834 states have (on average 4.512052670701922) internal successors, (84980), 18834 states have internal predecessors, (84980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18835 states to 18835 states and 84980 transitions. [2025-04-13 18:52:38,351 INFO L79 Accepts]: Start accepts. Automaton has 18835 states and 84980 transitions. Word has length 29 [2025-04-13 18:52:38,351 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:38,351 INFO L485 AbstractCegarLoop]: Abstraction has 18835 states and 84980 transitions. [2025-04-13 18:52:38,351 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:38,352 INFO L278 IsEmpty]: Start isEmpty. Operand 18835 states and 84980 transitions. [2025-04-13 18:52:38,395 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:52:38,395 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:38,395 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] [2025-04-13 18:52:38,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 18:52:38,395 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 18:52:38,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:38,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1306181048, now seen corresponding path program 5 times [2025-04-13 18:52:38,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:38,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168145816] [2025-04-13 18:52:38,396 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:52:38,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:38,398 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:52:38,401 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:52:38,401 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:52:38,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:38,518 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 18:52:38,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:38,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168145816] [2025-04-13 18:52:38,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168145816] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:38,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:38,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:52:38,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546077707] [2025-04-13 18:52:38,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:38,518 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:52:38,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:38,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:52:38,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:52:38,519 INFO L87 Difference]: Start difference. First operand 18835 states and 84980 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:45,521 INFO L93 Difference]: Finished difference Result 36421 states and 159381 transitions. [2025-04-13 18:52:45,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:52:45,521 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:52:45,522 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:45,682 INFO L225 Difference]: With dead ends: 36421 [2025-04-13 18:52:45,682 INFO L226 Difference]: Without dead ends: 34852 [2025-04-13 18:52:45,696 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:52:45,697 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 204 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:45,697 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 106 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:52:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34852 states. [2025-04-13 18:52:48,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34852 to 18257. [2025-04-13 18:52:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18257 states, 18256 states have (on average 4.524813759859772) internal successors, (82605), 18256 states have internal predecessors, (82605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18257 states to 18257 states and 82605 transitions. [2025-04-13 18:52:48,520 INFO L79 Accepts]: Start accepts. Automaton has 18257 states and 82605 transitions. Word has length 29 [2025-04-13 18:52:48,520 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:48,520 INFO L485 AbstractCegarLoop]: Abstraction has 18257 states and 82605 transitions. [2025-04-13 18:52:48,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:48,520 INFO L278 IsEmpty]: Start isEmpty. Operand 18257 states and 82605 transitions. [2025-04-13 18:52:48,557 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:52:48,557 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:48,557 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] [2025-04-13 18:52:48,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 18:52:48,557 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 18:52:48,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:48,558 INFO L85 PathProgramCache]: Analyzing trace with hash 136438724, now seen corresponding path program 6 times [2025-04-13 18:52:48,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:48,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552836279] [2025-04-13 18:52:48,558 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:52:48,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:48,561 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:52:48,564 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:52:48,564 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:52:48,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:52:48,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:48,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552836279] [2025-04-13 18:52:48,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552836279] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:48,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:48,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:52:48,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894570030] [2025-04-13 18:52:48,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:48,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:52:48,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:48,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:52:48,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:52:48,635 INFO L87 Difference]: Start difference. First operand 18257 states and 82605 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:53,438 INFO L93 Difference]: Finished difference Result 26671 states and 114665 transitions. [2025-04-13 18:52:53,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:52:53,439 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:52:53,439 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:53,541 INFO L225 Difference]: With dead ends: 26671 [2025-04-13 18:52:53,542 INFO L226 Difference]: Without dead ends: 23641 [2025-04-13 18:52:53,553 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:52:53,554 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 72 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:53,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 108 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:52:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23641 states. [2025-04-13 18:52:56,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23641 to 19009. [2025-04-13 18:52:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19009 states, 19008 states have (on average 4.541561447811448) internal successors, (86326), 19008 states have internal predecessors, (86326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:56,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19009 states to 19009 states and 86326 transitions. [2025-04-13 18:52:56,467 INFO L79 Accepts]: Start accepts. Automaton has 19009 states and 86326 transitions. Word has length 29 [2025-04-13 18:52:56,467 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:56,467 INFO L485 AbstractCegarLoop]: Abstraction has 19009 states and 86326 transitions. [2025-04-13 18:52:56,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:56,467 INFO L278 IsEmpty]: Start isEmpty. Operand 19009 states and 86326 transitions. [2025-04-13 18:52:56,505 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:52:56,505 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:56,506 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] [2025-04-13 18:52:56,506 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 18:52:56,506 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 18:52:56,506 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:56,506 INFO L85 PathProgramCache]: Analyzing trace with hash -405935068, now seen corresponding path program 7 times [2025-04-13 18:52:56,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:56,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221539947] [2025-04-13 18:52:56,506 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:52:56,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:56,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:52:56,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:52:56,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:52:56,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:56,593 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 18:52:56,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:56,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221539947] [2025-04-13 18:52:56,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221539947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:52:56,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:52:56,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:52:56,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588855152] [2025-04-13 18:52:56,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:52:56,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:52:56,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:56,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:52:56,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:52:56,594 INFO L87 Difference]: Start difference. First operand 19009 states and 86326 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:01,170 INFO L93 Difference]: Finished difference Result 25446 states and 109875 transitions. [2025-04-13 18:53:01,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:53:01,170 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:53:01,170 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:01,277 INFO L225 Difference]: With dead ends: 25446 [2025-04-13 18:53:01,277 INFO L226 Difference]: Without dead ends: 22890 [2025-04-13 18:53:01,290 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 18:53:01,290 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 63 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:01,290 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 88 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:53:01,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22890 states. [2025-04-13 18:53:04,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22890 to 18855. [2025-04-13 18:53:04,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18855 states, 18854 states have (on average 4.546144054312082) internal successors, (85713), 18854 states have internal predecessors, (85713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18855 states to 18855 states and 85713 transitions. [2025-04-13 18:53:04,237 INFO L79 Accepts]: Start accepts. Automaton has 18855 states and 85713 transitions. Word has length 29 [2025-04-13 18:53:04,237 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:04,237 INFO L485 AbstractCegarLoop]: Abstraction has 18855 states and 85713 transitions. [2025-04-13 18:53:04,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:04,237 INFO L278 IsEmpty]: Start isEmpty. Operand 18855 states and 85713 transitions. [2025-04-13 18:53:04,276 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:53:04,276 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:04,276 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] [2025-04-13 18:53:04,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 18:53:04,277 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:53:04,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:04,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1124862082, now seen corresponding path program 8 times [2025-04-13 18:53:04,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:04,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441177749] [2025-04-13 18:53:04,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:53:04,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:04,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:53:04,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:53:04,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:53:04,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:04,362 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 18:53:04,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:04,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441177749] [2025-04-13 18:53:04,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441177749] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:04,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:04,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:53:04,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881637604] [2025-04-13 18:53:04,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:04,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:53:04,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:04,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:53:04,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:53:04,363 INFO L87 Difference]: Start difference. First operand 18855 states and 85713 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:10,056 INFO L93 Difference]: Finished difference Result 29870 states and 131492 transitions. [2025-04-13 18:53:10,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:53:10,056 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:53:10,056 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:10,195 INFO L225 Difference]: With dead ends: 29870 [2025-04-13 18:53:10,196 INFO L226 Difference]: Without dead ends: 27484 [2025-04-13 18:53:10,210 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:53:10,211 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 103 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:10,211 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 178 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:53:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27484 states. [2025-04-13 18:53:13,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27484 to 21595. [2025-04-13 18:53:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21595 states, 21594 states have (on average 4.5772899879596185) internal successors, (98842), 21594 states have internal predecessors, (98842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21595 states to 21595 states and 98842 transitions. [2025-04-13 18:53:13,777 INFO L79 Accepts]: Start accepts. Automaton has 21595 states and 98842 transitions. Word has length 29 [2025-04-13 18:53:13,777 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:13,777 INFO L485 AbstractCegarLoop]: Abstraction has 21595 states and 98842 transitions. [2025-04-13 18:53:13,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:13,777 INFO L278 IsEmpty]: Start isEmpty. Operand 21595 states and 98842 transitions. [2025-04-13 18:53:13,827 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:53:13,827 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:13,827 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] [2025-04-13 18:53:13,827 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 18:53:13,827 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:53:13,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:13,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1528892772, now seen corresponding path program 5 times [2025-04-13 18:53:13,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:13,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305529951] [2025-04-13 18:53:13,828 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:53:13,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:13,831 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:53:13,838 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:53:13,838 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:53:13,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:53:13,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:13,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305529951] [2025-04-13 18:53:13,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305529951] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:13,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:13,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:53:13,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626512502] [2025-04-13 18:53:13,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:13,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:53:13,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:13,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:53:13,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:53:13,973 INFO L87 Difference]: Start difference. First operand 21595 states and 98842 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:19,913 INFO L93 Difference]: Finished difference Result 28794 states and 128469 transitions. [2025-04-13 18:53:19,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:53:19,913 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:53:19,913 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:20,050 INFO L225 Difference]: With dead ends: 28794 [2025-04-13 18:53:20,050 INFO L226 Difference]: Without dead ends: 26001 [2025-04-13 18:53:20,066 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:53:20,067 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 141 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:20,067 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 109 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:53:20,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26001 states. [2025-04-13 18:53:23,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26001 to 22061. [2025-04-13 18:53:23,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22061 states, 22060 states have (on average 4.589619220308251) internal successors, (101247), 22060 states have internal predecessors, (101247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22061 states to 22061 states and 101247 transitions. [2025-04-13 18:53:23,865 INFO L79 Accepts]: Start accepts. Automaton has 22061 states and 101247 transitions. Word has length 29 [2025-04-13 18:53:23,865 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:23,865 INFO L485 AbstractCegarLoop]: Abstraction has 22061 states and 101247 transitions. [2025-04-13 18:53:23,865 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:23,866 INFO L278 IsEmpty]: Start isEmpty. Operand 22061 states and 101247 transitions. [2025-04-13 18:53:23,915 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:53:23,915 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:23,915 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] [2025-04-13 18:53:23,915 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 18:53:23,915 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:53:23,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:23,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1716353260, now seen corresponding path program 6 times [2025-04-13 18:53:23,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:23,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334980053] [2025-04-13 18:53:23,916 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:53:23,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:23,919 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:53:23,922 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:53:23,922 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:53:23,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:53:24,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:24,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334980053] [2025-04-13 18:53:24,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334980053] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:24,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:24,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:53:24,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76874924] [2025-04-13 18:53:24,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:24,031 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:53:24,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:24,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:53:24,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:53:24,032 INFO L87 Difference]: Start difference. First operand 22061 states and 101247 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:31,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:31,951 INFO L93 Difference]: Finished difference Result 32732 states and 144622 transitions. [2025-04-13 18:53:31,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:53:31,952 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:53:31,952 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:32,115 INFO L225 Difference]: With dead ends: 32732 [2025-04-13 18:53:32,115 INFO L226 Difference]: Without dead ends: 30942 [2025-04-13 18:53:32,127 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:53:32,128 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 129 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:32,128 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 87 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:53:32,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30942 states. [2025-04-13 18:53:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30942 to 23211. [2025-04-13 18:53:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23211 states, 23210 states have (on average 4.5853942266264545) internal successors, (106427), 23210 states have internal predecessors, (106427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:36,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23211 states to 23211 states and 106427 transitions. [2025-04-13 18:53:36,535 INFO L79 Accepts]: Start accepts. Automaton has 23211 states and 106427 transitions. Word has length 29 [2025-04-13 18:53:36,535 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:36,535 INFO L485 AbstractCegarLoop]: Abstraction has 23211 states and 106427 transitions. [2025-04-13 18:53:36,535 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:36,535 INFO L278 IsEmpty]: Start isEmpty. Operand 23211 states and 106427 transitions. [2025-04-13 18:53:36,584 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:53:36,584 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:36,584 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] [2025-04-13 18:53:36,584 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 18:53:36,584 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:53:36,584 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:36,585 INFO L85 PathProgramCache]: Analyzing trace with hash 453885924, now seen corresponding path program 6 times [2025-04-13 18:53:36,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:36,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936339527] [2025-04-13 18:53:36,585 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:53:36,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:36,589 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:53:36,592 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:53:36,592 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:53:36,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:53:36,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:36,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936339527] [2025-04-13 18:53:36,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936339527] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:36,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:36,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:53:36,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535694009] [2025-04-13 18:53:36,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:36,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:53:36,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:36,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:53:36,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:53:36,647 INFO L87 Difference]: Start difference. First operand 23211 states and 106427 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:43,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:43,479 INFO L93 Difference]: Finished difference Result 29717 states and 133455 transitions. [2025-04-13 18:53:43,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:53:43,479 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:53:43,479 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:43,625 INFO L225 Difference]: With dead ends: 29717 [2025-04-13 18:53:43,625 INFO L226 Difference]: Without dead ends: 26926 [2025-04-13 18:53:43,639 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:53:43,639 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 62 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:43,640 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 84 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:53:43,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26926 states. [2025-04-13 18:53:48,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26926 to 23746. [2025-04-13 18:53:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23746 states, 23745 states have (on average 4.622994314592546) internal successors, (109773), 23745 states have internal predecessors, (109773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23746 states to 23746 states and 109773 transitions. [2025-04-13 18:53:48,196 INFO L79 Accepts]: Start accepts. Automaton has 23746 states and 109773 transitions. Word has length 29 [2025-04-13 18:53:48,196 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:48,196 INFO L485 AbstractCegarLoop]: Abstraction has 23746 states and 109773 transitions. [2025-04-13 18:53:48,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:48,197 INFO L278 IsEmpty]: Start isEmpty. Operand 23746 states and 109773 transitions. [2025-04-13 18:53:48,245 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:53:48,245 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:48,245 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] [2025-04-13 18:53:48,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 18:53:48,245 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:53:48,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:48,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1383944168, now seen corresponding path program 7 times [2025-04-13 18:53:48,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:48,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7656538] [2025-04-13 18:53:48,246 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:53:48,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:48,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:53:48,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:53:48,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:53:48,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:48,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:53:48,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:48,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7656538] [2025-04-13 18:53:48,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7656538] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:53:48,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652890224] [2025-04-13 18:53:48,334 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:53:48,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:48,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:53:48,336 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:53:48,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 18:53:48,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:53:48,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:53:48,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:53:48,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:48,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:53:48,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:53:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:53:48,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:53:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:53:48,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652890224] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:53:48,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:53:48,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-04-13 18:53:48,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488317732] [2025-04-13 18:53:48,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:53:48,864 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:53:48,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:48,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:53:48,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:53:48,864 INFO L87 Difference]: Start difference. First operand 23746 states and 109773 transitions. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:00,819 INFO L93 Difference]: Finished difference Result 44834 states and 195634 transitions. [2025-04-13 18:54:00,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:54:00,819 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 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 29 [2025-04-13 18:54:00,819 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:01,024 INFO L225 Difference]: With dead ends: 44834 [2025-04-13 18:54:01,024 INFO L226 Difference]: Without dead ends: 42448 [2025-04-13 18:54:01,041 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=269, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:54:01,042 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 298 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:01,042 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 424 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:54:01,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42448 states. [2025-04-13 18:54:05,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42448 to 23856. [2025-04-13 18:54:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23856 states, 23855 states have (on average 4.622762523579962) internal successors, (110276), 23855 states have internal predecessors, (110276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23856 states to 23856 states and 110276 transitions. [2025-04-13 18:54:06,138 INFO L79 Accepts]: Start accepts. Automaton has 23856 states and 110276 transitions. Word has length 29 [2025-04-13 18:54:06,138 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:06,139 INFO L485 AbstractCegarLoop]: Abstraction has 23856 states and 110276 transitions. [2025-04-13 18:54:06,139 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:06,139 INFO L278 IsEmpty]: Start isEmpty. Operand 23856 states and 110276 transitions. [2025-04-13 18:54:06,189 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:54:06,189 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:06,189 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] [2025-04-13 18:54:06,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 18:54:06,389 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:54:06,390 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:54:06,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:06,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1066782604, now seen corresponding path program 9 times [2025-04-13 18:54:06,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:06,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467098769] [2025-04-13 18:54:06,390 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:54:06,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:06,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:54:06,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:54:06,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:54:06,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:06,521 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 18:54:06,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:06,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467098769] [2025-04-13 18:54:06,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467098769] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:06,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:06,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:54:06,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292605828] [2025-04-13 18:54:06,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:06,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:54:06,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:06,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:54:06,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:54:06,522 INFO L87 Difference]: Start difference. First operand 23856 states and 110276 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:14,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:14,974 INFO L93 Difference]: Finished difference Result 32835 states and 148771 transitions. [2025-04-13 18:54:14,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:54:14,974 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:54:14,974 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:15,143 INFO L225 Difference]: With dead ends: 32835 [2025-04-13 18:54:15,143 INFO L226 Difference]: Without dead ends: 30960 [2025-04-13 18:54:15,158 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:54:15,158 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 83 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:15,159 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 142 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:54:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30960 states. [2025-04-13 18:54:18,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30960 to 17710. [2025-04-13 18:54:18,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17710 states, 17709 states have (on average 4.542153707154554) internal successors, (80437), 17709 states have internal predecessors, (80437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17710 states to 17710 states and 80437 transitions. [2025-04-13 18:54:18,984 INFO L79 Accepts]: Start accepts. Automaton has 17710 states and 80437 transitions. Word has length 29 [2025-04-13 18:54:18,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:18,984 INFO L485 AbstractCegarLoop]: Abstraction has 17710 states and 80437 transitions. [2025-04-13 18:54:18,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:18,985 INFO L278 IsEmpty]: Start isEmpty. Operand 17710 states and 80437 transitions. [2025-04-13 18:54:19,020 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:54:19,020 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:19,020 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] [2025-04-13 18:54:19,020 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 18:54:19,020 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:54:19,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:19,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1206775428, now seen corresponding path program 10 times [2025-04-13 18:54:19,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:19,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600479672] [2025-04-13 18:54:19,021 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:54:19,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:19,024 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:54:19,029 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:54:19,029 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:54:19,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:19,135 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 18:54:19,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:19,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600479672] [2025-04-13 18:54:19,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600479672] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:19,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:19,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:54:19,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149562814] [2025-04-13 18:54:19,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:19,135 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:54:19,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:19,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:54:19,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:54:19,136 INFO L87 Difference]: Start difference. First operand 17710 states and 80437 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:27,706 INFO L93 Difference]: Finished difference Result 28222 states and 121550 transitions. [2025-04-13 18:54:27,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:54:27,706 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:54:27,706 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:27,837 INFO L225 Difference]: With dead ends: 28222 [2025-04-13 18:54:27,838 INFO L226 Difference]: Without dead ends: 26723 [2025-04-13 18:54:27,848 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:54:27,849 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 187 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:27,849 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 81 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:54:27,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26723 states. [2025-04-13 18:54:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26723 to 18381. [2025-04-13 18:54:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18381 states, 18380 states have (on average 4.52170837867247) internal successors, (83109), 18380 states have internal predecessors, (83109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18381 states to 18381 states and 83109 transitions. [2025-04-13 18:54:31,984 INFO L79 Accepts]: Start accepts. Automaton has 18381 states and 83109 transitions. Word has length 29 [2025-04-13 18:54:31,985 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:31,985 INFO L485 AbstractCegarLoop]: Abstraction has 18381 states and 83109 transitions. [2025-04-13 18:54:31,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:31,985 INFO L278 IsEmpty]: Start isEmpty. Operand 18381 states and 83109 transitions. [2025-04-13 18:54:32,020 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:54:32,020 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:32,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] [2025-04-13 18:54:32,021 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 18:54:32,021 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:54:32,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:32,021 INFO L85 PathProgramCache]: Analyzing trace with hash -800770680, now seen corresponding path program 7 times [2025-04-13 18:54:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:32,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99730005] [2025-04-13 18:54:32,021 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:54:32,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:32,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:54:32,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:54:32,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:54:32,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:54:32,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:32,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99730005] [2025-04-13 18:54:32,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99730005] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:32,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:32,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:54:32,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337461085] [2025-04-13 18:54:32,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:32,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:54:32,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:32,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:54:32,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:54:32,100 INFO L87 Difference]: Start difference. First operand 18381 states and 83109 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:39,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:39,825 INFO L93 Difference]: Finished difference Result 26840 states and 117716 transitions. [2025-04-13 18:54:39,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:54:39,826 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:54:39,826 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:39,952 INFO L225 Difference]: With dead ends: 26840 [2025-04-13 18:54:39,952 INFO L226 Difference]: Without dead ends: 24643 [2025-04-13 18:54:39,963 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 18:54:39,964 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 64 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:39,964 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 87 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:54:39,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24643 states. [2025-04-13 18:54:44,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24643 to 20155. [2025-04-13 18:54:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20155 states, 20154 states have (on average 4.545003473255929) internal successors, (91600), 20154 states have internal predecessors, (91600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20155 states to 20155 states and 91600 transitions. [2025-04-13 18:54:44,637 INFO L79 Accepts]: Start accepts. Automaton has 20155 states and 91600 transitions. Word has length 29 [2025-04-13 18:54:44,638 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:44,638 INFO L485 AbstractCegarLoop]: Abstraction has 20155 states and 91600 transitions. [2025-04-13 18:54:44,638 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:44,638 INFO L278 IsEmpty]: Start isEmpty. Operand 20155 states and 91600 transitions. [2025-04-13 18:54:44,677 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:54:44,677 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:44,677 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] [2025-04-13 18:54:44,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 18:54:44,678 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:54:44,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:44,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1147593086, now seen corresponding path program 8 times [2025-04-13 18:54:44,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:44,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736363063] [2025-04-13 18:54:44,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:54:44,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:44,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:54:44,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:54:44,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:54:44,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:54:44,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:44,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736363063] [2025-04-13 18:54:44,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736363063] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:44,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:44,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:54:44,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364006933] [2025-04-13 18:54:44,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:44,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:54:44,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:44,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:54:44,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:54:44,826 INFO L87 Difference]: Start difference. First operand 20155 states and 91600 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:54,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:54,679 INFO L93 Difference]: Finished difference Result 28996 states and 124245 transitions. [2025-04-13 18:54:54,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:54:54,679 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:54:54,679 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:54,813 INFO L225 Difference]: With dead ends: 28996 [2025-04-13 18:54:54,813 INFO L226 Difference]: Without dead ends: 28722 [2025-04-13 18:54:54,823 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:54:54,823 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 238 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:54,823 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 102 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:54:54,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28722 states. [2025-04-13 18:54:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28722 to 20048. [2025-04-13 18:54:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20048 states, 20047 states have (on average 4.550356661844665) internal successors, (91221), 20047 states have internal predecessors, (91221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20048 states to 20048 states and 91221 transitions. [2025-04-13 18:54:59,530 INFO L79 Accepts]: Start accepts. Automaton has 20048 states and 91221 transitions. Word has length 29 [2025-04-13 18:54:59,530 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:59,530 INFO L485 AbstractCegarLoop]: Abstraction has 20048 states and 91221 transitions. [2025-04-13 18:54:59,530 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:59,530 INFO L278 IsEmpty]: Start isEmpty. Operand 20048 states and 91221 transitions. [2025-04-13 18:54:59,569 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:54:59,569 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:59,569 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] [2025-04-13 18:54:59,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 18:54:59,569 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:54:59,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:59,570 INFO L85 PathProgramCache]: Analyzing trace with hash -130791786, now seen corresponding path program 11 times [2025-04-13 18:54:59,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:59,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865523475] [2025-04-13 18:54:59,570 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:54:59,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:59,573 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:54:59,575 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:54:59,575 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:54:59,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:59,683 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 18:54:59,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:59,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865523475] [2025-04-13 18:54:59,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865523475] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:54:59,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:54:59,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:54:59,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111215641] [2025-04-13 18:54:59,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:54:59,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:54:59,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:59,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:54:59,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:54:59,685 INFO L87 Difference]: Start difference. First operand 20048 states and 91221 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:12,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:12,556 INFO L93 Difference]: Finished difference Result 37312 states and 165073 transitions. [2025-04-13 18:55:12,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:55:12,556 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:55:12,556 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:12,728 INFO L225 Difference]: With dead ends: 37312 [2025-04-13 18:55:12,728 INFO L226 Difference]: Without dead ends: 34685 [2025-04-13 18:55:12,741 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:55:12,742 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 193 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:12,742 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 102 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:55:12,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34685 states. [2025-04-13 18:55:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34685 to 19297. [2025-04-13 18:55:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19297 states, 19296 states have (on average 4.57405679933665) internal successors, (88261), 19296 states have internal predecessors, (88261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19297 states to 19297 states and 88261 transitions. [2025-04-13 18:55:17,568 INFO L79 Accepts]: Start accepts. Automaton has 19297 states and 88261 transitions. Word has length 29 [2025-04-13 18:55:17,569 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:17,569 INFO L485 AbstractCegarLoop]: Abstraction has 19297 states and 88261 transitions. [2025-04-13 18:55:17,569 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:17,569 INFO L278 IsEmpty]: Start isEmpty. Operand 19297 states and 88261 transitions. [2025-04-13 18:55:17,608 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:55:17,608 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:17,609 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] [2025-04-13 18:55:17,609 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 18:55:17,609 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:17,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:17,609 INFO L85 PathProgramCache]: Analyzing trace with hash 105913066, now seen corresponding path program 7 times [2025-04-13 18:55:17,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:17,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713445288] [2025-04-13 18:55:17,609 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:55:17,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:17,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:55:17,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:55:17,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:55:17,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:55:17,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:17,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713445288] [2025-04-13 18:55:17,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713445288] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:17,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:17,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:55:17,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061475640] [2025-04-13 18:55:17,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:17,733 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:55:17,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:17,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:55:17,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:55:17,734 INFO L87 Difference]: Start difference. First operand 19297 states and 88261 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:25,872 INFO L93 Difference]: Finished difference Result 22848 states and 101760 transitions. [2025-04-13 18:55:25,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:55:25,872 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:55:25,872 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:25,986 INFO L225 Difference]: With dead ends: 22848 [2025-04-13 18:55:25,986 INFO L226 Difference]: Without dead ends: 22425 [2025-04-13 18:55:25,993 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:55:25,994 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 84 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:25,994 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 58 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:55:26,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22425 states. [2025-04-13 18:55:30,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22425 to 19243. [2025-04-13 18:55:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19243 states, 19242 states have (on average 4.573848872258601) internal successors, (88010), 19242 states have internal predecessors, (88010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19243 states to 19243 states and 88010 transitions. [2025-04-13 18:55:30,810 INFO L79 Accepts]: Start accepts. Automaton has 19243 states and 88010 transitions. Word has length 29 [2025-04-13 18:55:30,810 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:30,810 INFO L485 AbstractCegarLoop]: Abstraction has 19243 states and 88010 transitions. [2025-04-13 18:55:30,810 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:30,810 INFO L278 IsEmpty]: Start isEmpty. Operand 19243 states and 88010 transitions. [2025-04-13 18:55:30,847 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:55:30,847 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:30,847 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] [2025-04-13 18:55:30,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 18:55:30,848 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:30,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:30,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1428320676, now seen corresponding path program 8 times [2025-04-13 18:55:30,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:30,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453967479] [2025-04-13 18:55:30,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:55:30,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:30,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:55:30,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:55:30,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:55:30,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:30,954 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 18:55:30,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:30,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453967479] [2025-04-13 18:55:30,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453967479] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:30,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:30,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:55:30,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748432608] [2025-04-13 18:55:30,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:30,955 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:55:30,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:30,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:55:30,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:55:30,955 INFO L87 Difference]: Start difference. First operand 19243 states and 88010 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:39,723 INFO L93 Difference]: Finished difference Result 23726 states and 106233 transitions. [2025-04-13 18:55:39,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:55:39,723 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:55:39,723 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:39,838 INFO L225 Difference]: With dead ends: 23726 [2025-04-13 18:55:39,838 INFO L226 Difference]: Without dead ends: 23229 [2025-04-13 18:55:39,845 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:55:39,846 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 93 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:39,846 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 74 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:55:39,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23229 states. [2025-04-13 18:55:44,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23229 to 19185. [2025-04-13 18:55:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19185 states, 19184 states have (on average 4.569380733944954) internal successors, (87659), 19184 states have internal predecessors, (87659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:44,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19185 states to 19185 states and 87659 transitions. [2025-04-13 18:55:44,562 INFO L79 Accepts]: Start accepts. Automaton has 19185 states and 87659 transitions. Word has length 29 [2025-04-13 18:55:44,562 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:44,562 INFO L485 AbstractCegarLoop]: Abstraction has 19185 states and 87659 transitions. [2025-04-13 18:55:44,562 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:44,562 INFO L278 IsEmpty]: Start isEmpty. Operand 19185 states and 87659 transitions. [2025-04-13 18:55:44,600 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:55:44,601 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:44,601 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] [2025-04-13 18:55:44,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 18:55:44,601 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:44,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:44,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1211484910, now seen corresponding path program 9 times [2025-04-13 18:55:44,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:44,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782668784] [2025-04-13 18:55:44,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:55:44,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:44,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:55:44,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:55:44,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:55:44,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:44,797 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 18:55:44,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:44,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782668784] [2025-04-13 18:55:44,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782668784] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:44,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:44,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:55:44,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951925466] [2025-04-13 18:55:44,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:44,798 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:55:44,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:44,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:55:44,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:55:44,798 INFO L87 Difference]: Start difference. First operand 19185 states and 87659 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:53,589 INFO L93 Difference]: Finished difference Result 24390 states and 109745 transitions. [2025-04-13 18:55:53,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:55:53,589 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:55:53,589 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:53,708 INFO L225 Difference]: With dead ends: 24390 [2025-04-13 18:55:53,708 INFO L226 Difference]: Without dead ends: 23529 [2025-04-13 18:55:53,716 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:55:53,717 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 104 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:53,718 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 88 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:55:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23529 states. [2025-04-13 18:55:58,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23529 to 19035. [2025-04-13 18:55:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19035 states, 19034 states have (on average 4.557476095408217) internal successors, (86747), 19034 states have internal predecessors, (86747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19035 states to 19035 states and 86747 transitions. [2025-04-13 18:55:58,502 INFO L79 Accepts]: Start accepts. Automaton has 19035 states and 86747 transitions. Word has length 29 [2025-04-13 18:55:58,502 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:55:58,502 INFO L485 AbstractCegarLoop]: Abstraction has 19035 states and 86747 transitions. [2025-04-13 18:55:58,502 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:58,502 INFO L278 IsEmpty]: Start isEmpty. Operand 19035 states and 86747 transitions. [2025-04-13 18:55:58,542 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:55:58,542 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:55:58,542 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] [2025-04-13 18:55:58,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 18:55:58,542 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:55:58,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:55:58,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1087113784, now seen corresponding path program 8 times [2025-04-13 18:55:58,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:55:58,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501032619] [2025-04-13 18:55:58,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:55:58,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:55:58,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:55:58,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:55:58,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:55:58,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:55:58,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:55:58,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:55:58,622 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501032619] [2025-04-13 18:55:58,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501032619] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:55:58,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:55:58,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:55:58,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970263012] [2025-04-13 18:55:58,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:55:58,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:55:58,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:55:58,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:55:58,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:55:58,623 INFO L87 Difference]: Start difference. First operand 19035 states and 86747 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:06,875 INFO L93 Difference]: Finished difference Result 24020 states and 106471 transitions. [2025-04-13 18:56:06,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:56:06,876 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:56:06,876 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:06,981 INFO L225 Difference]: With dead ends: 24020 [2025-04-13 18:56:06,981 INFO L226 Difference]: Without dead ends: 23186 [2025-04-13 18:56:06,989 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:56:06,989 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 110 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:06,989 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 66 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:56:07,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23186 states. [2025-04-13 18:56:11,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23186 to 19911. [2025-04-13 18:56:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19911 states, 19910 states have (on average 4.585886489201406) internal successors, (91305), 19910 states have internal predecessors, (91305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19911 states to 19911 states and 91305 transitions. [2025-04-13 18:56:12,000 INFO L79 Accepts]: Start accepts. Automaton has 19911 states and 91305 transitions. Word has length 29 [2025-04-13 18:56:12,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:12,001 INFO L485 AbstractCegarLoop]: Abstraction has 19911 states and 91305 transitions. [2025-04-13 18:56:12,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:12,001 INFO L278 IsEmpty]: Start isEmpty. Operand 19911 states and 91305 transitions. [2025-04-13 18:56:12,040 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:56:12,041 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:12,041 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] [2025-04-13 18:56:12,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 18:56:12,041 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:12,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:12,041 INFO L85 PathProgramCache]: Analyzing trace with hash -634104902, now seen corresponding path program 12 times [2025-04-13 18:56:12,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:12,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252599929] [2025-04-13 18:56:12,041 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:56:12,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:12,044 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:56:12,046 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:56:12,046 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:56:12,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:12,114 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 18:56:12,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:12,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252599929] [2025-04-13 18:56:12,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252599929] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:12,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:12,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:56:12,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290189970] [2025-04-13 18:56:12,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:12,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:56:12,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:12,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:56:12,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:56:12,115 INFO L87 Difference]: Start difference. First operand 19911 states and 91305 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:20,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:20,400 INFO L93 Difference]: Finished difference Result 23325 states and 103949 transitions. [2025-04-13 18:56:20,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:56:20,400 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:56:20,400 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:20,526 INFO L225 Difference]: With dead ends: 23325 [2025-04-13 18:56:20,526 INFO L226 Difference]: Without dead ends: 22624 [2025-04-13 18:56:20,535 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:56:20,536 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 100 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:20,536 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 78 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:56:20,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22624 states. [2025-04-13 18:56:25,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22624 to 19608. [2025-04-13 18:56:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19608 states, 19607 states have (on average 4.5940225429693475) internal successors, (90075), 19607 states have internal predecessors, (90075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19608 states to 19608 states and 90075 transitions. [2025-04-13 18:56:25,700 INFO L79 Accepts]: Start accepts. Automaton has 19608 states and 90075 transitions. Word has length 29 [2025-04-13 18:56:25,700 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:25,700 INFO L485 AbstractCegarLoop]: Abstraction has 19608 states and 90075 transitions. [2025-04-13 18:56:25,700 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:25,700 INFO L278 IsEmpty]: Start isEmpty. Operand 19608 states and 90075 transitions. [2025-04-13 18:56:25,745 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:56:25,745 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:25,745 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] [2025-04-13 18:56:25,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 18:56:25,745 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:25,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:25,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1162813332, now seen corresponding path program 9 times [2025-04-13 18:56:25,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:25,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871471331] [2025-04-13 18:56:25,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:56:25,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:25,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:56:25,751 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:56:25,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:56:25,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:56:25,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:25,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871471331] [2025-04-13 18:56:25,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871471331] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:56:25,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106792092] [2025-04-13 18:56:25,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:56:25,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:56:25,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:56:25,815 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:56:25,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 18:56:25,844 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:56:25,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:56:25,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:56:25,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:25,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:56:25,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:56:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:56:25,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:56:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:56:26,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106792092] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:56:26,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:56:26,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-04-13 18:56:26,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098794065] [2025-04-13 18:56:26,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:56:26,161 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:56:26,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:26,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:56:26,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:56:26,162 INFO L87 Difference]: Start difference. First operand 19608 states and 90075 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:48,187 INFO L93 Difference]: Finished difference Result 51384 states and 220855 transitions. [2025-04-13 18:56:48,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-13 18:56:48,188 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 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 29 [2025-04-13 18:56:48,188 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:48,409 INFO L225 Difference]: With dead ends: 51384 [2025-04-13 18:56:48,409 INFO L226 Difference]: Without dead ends: 46447 [2025-04-13 18:56:48,430 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2176 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1223, Invalid=4783, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 18:56:48,431 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 519 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 2741 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 2777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:48,431 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 889 Invalid, 2777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2741 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:56:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46447 states. [2025-04-13 18:56:53,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46447 to 18908. [2025-04-13 18:56:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18908 states, 18907 states have (on average 4.555244089490665) internal successors, (86126), 18907 states have internal predecessors, (86126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18908 states to 18908 states and 86126 transitions. [2025-04-13 18:56:54,107 INFO L79 Accepts]: Start accepts. Automaton has 18908 states and 86126 transitions. Word has length 29 [2025-04-13 18:56:54,107 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:54,107 INFO L485 AbstractCegarLoop]: Abstraction has 18908 states and 86126 transitions. [2025-04-13 18:56:54,107 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:54,108 INFO L278 IsEmpty]: Start isEmpty. Operand 18908 states and 86126 transitions. [2025-04-13 18:56:54,145 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:56:54,145 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:54,146 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] [2025-04-13 18:56:54,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 18:56:54,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 18:56:54,346 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:56:54,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:54,346 INFO L85 PathProgramCache]: Analyzing trace with hash 334189502, now seen corresponding path program 9 times [2025-04-13 18:56:54,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:54,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352026255] [2025-04-13 18:56:54,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:56:54,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:54,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:56:54,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:56:54,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:56:54,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:54,419 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 18:56:54,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:54,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352026255] [2025-04-13 18:56:54,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352026255] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:56:54,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:56:54,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:56:54,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530553713] [2025-04-13 18:56:54,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:56:54,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:56:54,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:54,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:56:54,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:56:54,421 INFO L87 Difference]: Start difference. First operand 18908 states and 86126 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:05,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:05,043 INFO L93 Difference]: Finished difference Result 28643 states and 125516 transitions. [2025-04-13 18:57:05,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:57:05,043 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:57:05,043 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:05,178 INFO L225 Difference]: With dead ends: 28643 [2025-04-13 18:57:05,178 INFO L226 Difference]: Without dead ends: 26533 [2025-04-13 18:57:05,188 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:57:05,188 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 186 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:05,188 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 83 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:57:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26533 states. [2025-04-13 18:57:11,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26533 to 20092. [2025-04-13 18:57:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20092 states, 20091 states have (on average 4.56582549400229) internal successors, (91732), 20091 states have internal predecessors, (91732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20092 states to 20092 states and 91732 transitions. [2025-04-13 18:57:11,231 INFO L79 Accepts]: Start accepts. Automaton has 20092 states and 91732 transitions. Word has length 29 [2025-04-13 18:57:11,231 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:11,231 INFO L485 AbstractCegarLoop]: Abstraction has 20092 states and 91732 transitions. [2025-04-13 18:57:11,231 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:11,231 INFO L278 IsEmpty]: Start isEmpty. Operand 20092 states and 91732 transitions. [2025-04-13 18:57:11,271 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:57:11,272 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:11,272 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] [2025-04-13 18:57:11,272 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 18:57:11,272 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:11,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:11,273 INFO L85 PathProgramCache]: Analyzing trace with hash -950446600, now seen corresponding path program 13 times [2025-04-13 18:57:11,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:11,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775640725] [2025-04-13 18:57:11,274 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:57:11,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:11,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:57:11,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:57:11,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:57:11,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:11,394 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 18:57:11,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:11,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775640725] [2025-04-13 18:57:11,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775640725] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:11,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:11,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:57:11,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137437771] [2025-04-13 18:57:11,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:11,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:57:11,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:11,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:57:11,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:57:11,399 INFO L87 Difference]: Start difference. First operand 20092 states and 91732 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:22,159 INFO L93 Difference]: Finished difference Result 27751 states and 121830 transitions. [2025-04-13 18:57:22,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:57:22,160 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:57:22,160 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:22,298 INFO L225 Difference]: With dead ends: 27751 [2025-04-13 18:57:22,298 INFO L226 Difference]: Without dead ends: 26129 [2025-04-13 18:57:22,308 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:57:22,308 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 173 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:22,308 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 80 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:57:22,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26129 states. [2025-04-13 18:57:28,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26129 to 19775. [2025-04-13 18:57:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19775 states, 19774 states have (on average 4.578436330535046) internal successors, (90534), 19774 states have internal predecessors, (90534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19775 states to 19775 states and 90534 transitions. [2025-04-13 18:57:28,290 INFO L79 Accepts]: Start accepts. Automaton has 19775 states and 90534 transitions. Word has length 29 [2025-04-13 18:57:28,291 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:28,291 INFO L485 AbstractCegarLoop]: Abstraction has 19775 states and 90534 transitions. [2025-04-13 18:57:28,291 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:28,291 INFO L278 IsEmpty]: Start isEmpty. Operand 19775 states and 90534 transitions. [2025-04-13 18:57:28,332 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:57:28,333 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:28,333 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] [2025-04-13 18:57:28,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 18:57:28,333 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:57:28,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:28,333 INFO L85 PathProgramCache]: Analyzing trace with hash -990599142, now seen corresponding path program 10 times [2025-04-13 18:57:28,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:28,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751045292] [2025-04-13 18:57:28,333 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:57:28,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:28,336 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:57:28,339 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:57:28,339 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:57:28,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:28,441 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 18:57:28,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:28,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751045292] [2025-04-13 18:57:28,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751045292] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:28,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:28,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:57:28,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091848366] [2025-04-13 18:57:28,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:28,442 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:57:28,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:28,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:57:28,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:57:28,442 INFO L87 Difference]: Start difference. First operand 19775 states and 90534 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:42,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:57:42,270 INFO L93 Difference]: Finished difference Result 32528 states and 143490 transitions. [2025-04-13 18:57:42,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:57:42,271 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:57:42,271 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:57:42,425 INFO L225 Difference]: With dead ends: 32528 [2025-04-13 18:57:42,426 INFO L226 Difference]: Without dead ends: 31189 [2025-04-13 18:57:42,436 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:57:42,437 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 223 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:57:42,437 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 75 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:57:42,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31189 states. [2025-04-13 18:57:48,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31189 to 19475. [2025-04-13 18:57:48,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19475 states, 19474 states have (on average 4.57112046831673) internal successors, (89018), 19474 states have internal predecessors, (89018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:48,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19475 states to 19475 states and 89018 transitions. [2025-04-13 18:57:48,435 INFO L79 Accepts]: Start accepts. Automaton has 19475 states and 89018 transitions. Word has length 29 [2025-04-13 18:57:48,436 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:57:48,436 INFO L485 AbstractCegarLoop]: Abstraction has 19475 states and 89018 transitions. [2025-04-13 18:57:48,436 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:57:48,436 INFO L278 IsEmpty]: Start isEmpty. Operand 19475 states and 89018 transitions. [2025-04-13 18:57:48,475 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:57:48,475 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:57:48,475 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] [2025-04-13 18:57:48,475 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-13 18:57:48,475 INFO L403 AbstractCegarLoop]: === Iteration 43 === 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 18:57:48,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:57:48,476 INFO L85 PathProgramCache]: Analyzing trace with hash 500191974, now seen corresponding path program 11 times [2025-04-13 18:57:48,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:57:48,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831952726] [2025-04-13 18:57:48,476 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:57:48,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:57:48,479 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:57:48,481 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:57:48,481 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:57:48,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:57:48,561 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 18:57:48,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:57:48,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831952726] [2025-04-13 18:57:48,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831952726] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:57:48,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:57:48,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:57:48,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179806771] [2025-04-13 18:57:48,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:57:48,561 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:57:48,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:57:48,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:57:48,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:57:48,562 INFO L87 Difference]: Start difference. First operand 19475 states and 89018 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:06,583 INFO L93 Difference]: Finished difference Result 37142 states and 163062 transitions. [2025-04-13 18:58:06,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:58:06,583 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:58:06,583 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:06,760 INFO L225 Difference]: With dead ends: 37142 [2025-04-13 18:58:06,760 INFO L226 Difference]: Without dead ends: 35956 [2025-04-13 18:58:06,772 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:58:06,773 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 287 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:06,773 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 96 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:58:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35956 states. [2025-04-13 18:58:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35956 to 17630. [2025-04-13 18:58:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17630 states, 17629 states have (on average 4.53752339894492) internal successors, (79992), 17629 states have internal predecessors, (79992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17630 states to 17630 states and 79992 transitions. [2025-04-13 18:58:12,530 INFO L79 Accepts]: Start accepts. Automaton has 17630 states and 79992 transitions. Word has length 29 [2025-04-13 18:58:12,530 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:12,530 INFO L485 AbstractCegarLoop]: Abstraction has 17630 states and 79992 transitions. [2025-04-13 18:58:12,530 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:12,530 INFO L278 IsEmpty]: Start isEmpty. Operand 17630 states and 79992 transitions. [2025-04-13 18:58:12,572 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:58:12,573 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:12,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:58:12,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 18:58:12,573 INFO L403 AbstractCegarLoop]: === Iteration 44 === 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 18:58:12,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:12,573 INFO L85 PathProgramCache]: Analyzing trace with hash 746798344, now seen corresponding path program 14 times [2025-04-13 18:58:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:12,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993259563] [2025-04-13 18:58:12,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:58:12,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:12,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:58:12,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:58:12,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:58:12,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:12,672 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 18:58:12,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:12,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993259563] [2025-04-13 18:58:12,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993259563] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:12,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:12,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:58:12,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155467176] [2025-04-13 18:58:12,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:12,673 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:58:12,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:12,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:58:12,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:58:12,673 INFO L87 Difference]: Start difference. First operand 17630 states and 79992 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:25,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:25,567 INFO L93 Difference]: Finished difference Result 27293 states and 118484 transitions. [2025-04-13 18:58:25,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:58:25,567 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:58:25,567 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:25,696 INFO L225 Difference]: With dead ends: 27293 [2025-04-13 18:58:25,696 INFO L226 Difference]: Without dead ends: 26717 [2025-04-13 18:58:25,703 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:58:25,704 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 202 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:25,704 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 86 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:58:25,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26717 states. [2025-04-13 18:58:31,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26717 to 17511. [2025-04-13 18:58:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17511 states, 17510 states have (on average 4.5379782981153625) internal successors, (79460), 17510 states have internal predecessors, (79460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17511 states to 17511 states and 79460 transitions. [2025-04-13 18:58:31,313 INFO L79 Accepts]: Start accepts. Automaton has 17511 states and 79460 transitions. Word has length 29 [2025-04-13 18:58:31,314 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:31,314 INFO L485 AbstractCegarLoop]: Abstraction has 17511 states and 79460 transitions. [2025-04-13 18:58:31,314 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:31,314 INFO L278 IsEmpty]: Start isEmpty. Operand 17511 states and 79460 transitions. [2025-04-13 18:58:31,348 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:58:31,348 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:31,348 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] [2025-04-13 18:58:31,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-13 18:58:31,348 INFO L403 AbstractCegarLoop]: === Iteration 45 === 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 18:58:31,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:31,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1909514626, now seen corresponding path program 15 times [2025-04-13 18:58:31,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:31,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463683189] [2025-04-13 18:58:31,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:58:31,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:31,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:58:31,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:58:31,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:58:31,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:31,451 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 18:58:31,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:31,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463683189] [2025-04-13 18:58:31,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463683189] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:31,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:31,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:58:31,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855452682] [2025-04-13 18:58:31,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:31,453 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:58:31,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:31,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:58:31,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:58:31,453 INFO L87 Difference]: Start difference. First operand 17511 states and 79460 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:45,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:58:45,371 INFO L93 Difference]: Finished difference Result 28932 states and 126006 transitions. [2025-04-13 18:58:45,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:58:45,371 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:58:45,371 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:58:45,510 INFO L225 Difference]: With dead ends: 28932 [2025-04-13 18:58:45,511 INFO L226 Difference]: Without dead ends: 27937 [2025-04-13 18:58:45,520 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:58:45,521 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 201 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:45,521 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 90 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:58:45,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27937 states. [2025-04-13 18:58:51,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27937 to 18286. [2025-04-13 18:58:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18286 states, 18285 states have (on average 4.577796007656549) internal successors, (83705), 18285 states have internal predecessors, (83705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18286 states to 18286 states and 83705 transitions. [2025-04-13 18:58:51,599 INFO L79 Accepts]: Start accepts. Automaton has 18286 states and 83705 transitions. Word has length 29 [2025-04-13 18:58:51,600 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:58:51,600 INFO L485 AbstractCegarLoop]: Abstraction has 18286 states and 83705 transitions. [2025-04-13 18:58:51,600 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:58:51,600 INFO L278 IsEmpty]: Start isEmpty. Operand 18286 states and 83705 transitions. [2025-04-13 18:58:51,633 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:58:51,634 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:58:51,634 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] [2025-04-13 18:58:51,634 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 18:58:51,634 INFO L403 AbstractCegarLoop]: === Iteration 46 === 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 18:58:51,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:58:51,634 INFO L85 PathProgramCache]: Analyzing trace with hash 140591892, now seen corresponding path program 16 times [2025-04-13 18:58:51,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:58:51,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940510211] [2025-04-13 18:58:51,634 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:58:51,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:58:51,638 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:58:51,640 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:58:51,640 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:58:51,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:58:51,722 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 18:58:51,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:58:51,723 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940510211] [2025-04-13 18:58:51,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940510211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:58:51,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:58:51,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:58:51,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313603233] [2025-04-13 18:58:51,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:58:51,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:58:51,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:58:51,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:58:51,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:58:51,723 INFO L87 Difference]: Start difference. First operand 18286 states and 83705 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:07,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:07,802 INFO L93 Difference]: Finished difference Result 32311 states and 142862 transitions. [2025-04-13 18:59:07,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:59:07,803 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:59:07,803 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:07,959 INFO L225 Difference]: With dead ends: 32311 [2025-04-13 18:59:07,959 INFO L226 Difference]: Without dead ends: 31587 [2025-04-13 18:59:07,968 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:59:07,969 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 253 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:07,969 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 109 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:59:07,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31587 states. [2025-04-13 18:59:13,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31587 to 16690. [2025-04-13 18:59:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16690 states, 16689 states have (on average 4.5191443465755885) internal successors, (75420), 16689 states have internal predecessors, (75420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:13,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16690 states to 16690 states and 75420 transitions. [2025-04-13 18:59:13,403 INFO L79 Accepts]: Start accepts. Automaton has 16690 states and 75420 transitions. Word has length 29 [2025-04-13 18:59:13,404 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:13,404 INFO L485 AbstractCegarLoop]: Abstraction has 16690 states and 75420 transitions. [2025-04-13 18:59:13,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:13,404 INFO L278 IsEmpty]: Start isEmpty. Operand 16690 states and 75420 transitions. [2025-04-13 18:59:13,437 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:59:13,437 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:13,437 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] [2025-04-13 18:59:13,437 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-13 18:59:13,437 INFO L403 AbstractCegarLoop]: === Iteration 47 === 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 18:59:13,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:13,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1312211426, now seen corresponding path program 10 times [2025-04-13 18:59:13,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:13,437 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108689817] [2025-04-13 18:59:13,437 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:59:13,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:13,440 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:59:13,443 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:59:13,443 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:59:13,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:59:13,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:13,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108689817] [2025-04-13 18:59:13,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108689817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:13,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:13,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:59:13,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237883716] [2025-04-13 18:59:13,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:13,509 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:59:13,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:13,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:59:13,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:59:13,509 INFO L87 Difference]: Start difference. First operand 16690 states and 75420 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:23,901 INFO L93 Difference]: Finished difference Result 22361 states and 98445 transitions. [2025-04-13 18:59:23,901 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:59:23,901 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:59:23,901 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:23,998 INFO L225 Difference]: With dead ends: 22361 [2025-04-13 18:59:23,998 INFO L226 Difference]: Without dead ends: 20689 [2025-04-13 18:59:24,005 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:59:24,005 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 70 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:24,005 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 119 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:59:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20689 states. [2025-04-13 18:59:29,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20689 to 16989. [2025-04-13 18:59:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16989 states, 16988 states have (on average 4.548799152342831) internal successors, (77275), 16988 states have internal predecessors, (77275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16989 states to 16989 states and 77275 transitions. [2025-04-13 18:59:29,499 INFO L79 Accepts]: Start accepts. Automaton has 16989 states and 77275 transitions. Word has length 29 [2025-04-13 18:59:29,499 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:29,499 INFO L485 AbstractCegarLoop]: Abstraction has 16989 states and 77275 transitions. [2025-04-13 18:59:29,499 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:29,499 INFO L278 IsEmpty]: Start isEmpty. Operand 16989 states and 77275 transitions. [2025-04-13 18:59:29,530 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:59:29,530 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:29,530 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] [2025-04-13 18:59:29,530 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-13 18:59:29,530 INFO L403 AbstractCegarLoop]: === Iteration 48 === 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 18:59:29,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:29,530 INFO L85 PathProgramCache]: Analyzing trace with hash 632617908, now seen corresponding path program 11 times [2025-04-13 18:59:29,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:29,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297718287] [2025-04-13 18:59:29,530 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:59:29,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:29,533 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:59:29,535 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:59:29,535 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:59:29,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:59:29,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:29,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297718287] [2025-04-13 18:59:29,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297718287] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:29,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:29,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:59:29,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489910658] [2025-04-13 18:59:29,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:29,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:59:29,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:29,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:59:29,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:59:29,741 INFO L87 Difference]: Start difference. First operand 16989 states and 77275 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:39,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:39,150 INFO L93 Difference]: Finished difference Result 19172 states and 86363 transitions. [2025-04-13 18:59:39,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:59:39,150 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 18:59:39,150 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:39,242 INFO L225 Difference]: With dead ends: 19172 [2025-04-13 18:59:39,242 INFO L226 Difference]: Without dead ends: 18993 [2025-04-13 18:59:39,247 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:59:39,248 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 99 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:39,248 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 52 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:59:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18993 states. [2025-04-13 18:59:44,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18993 to 16942. [2025-04-13 18:59:44,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16942 states, 16941 states have (on average 4.552741868838911) internal successors, (77128), 16941 states have internal predecessors, (77128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:44,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16942 states to 16942 states and 77128 transitions. [2025-04-13 18:59:44,806 INFO L79 Accepts]: Start accepts. Automaton has 16942 states and 77128 transitions. Word has length 29 [2025-04-13 18:59:44,806 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:44,806 INFO L485 AbstractCegarLoop]: Abstraction has 16942 states and 77128 transitions. [2025-04-13 18:59:44,806 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:44,807 INFO L278 IsEmpty]: Start isEmpty. Operand 16942 states and 77128 transitions. [2025-04-13 18:59:44,837 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:59:44,838 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:44,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:59:44,838 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-13 18:59:44,838 INFO L403 AbstractCegarLoop]: === Iteration 49 === 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 18:59:44,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:44,838 INFO L85 PathProgramCache]: Analyzing trace with hash -247141772, now seen corresponding path program 12 times [2025-04-13 18:59:44,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:44,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559188517] [2025-04-13 18:59:44,838 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:59:44,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:44,841 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:59:44,843 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:59:44,843 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:59:44,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:59:44,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:44,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559188517] [2025-04-13 18:59:44,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559188517] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:59:44,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046484576] [2025-04-13 18:59:44,934 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:59:44,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:59:44,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:59:44,936 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:59:44,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 18:59:44,964 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:59:44,977 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:59:44,977 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:59:44,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:44,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:59:44,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:59:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:59:45,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:59:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:59:45,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046484576] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:59:45,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:59:45,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2025-04-13 18:59:45,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545379536] [2025-04-13 18:59:45,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:59:45,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:59:45,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:45,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:59:45,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:59:45,275 INFO L87 Difference]: Start difference. First operand 16942 states and 77128 transitions. Second operand has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 18 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:07,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:07,177 INFO L93 Difference]: Finished difference Result 37803 states and 165544 transitions. [2025-04-13 19:00:07,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 19:00:07,178 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 18 states have internal predecessors, (80), 0 states have call successors, (0), 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 29 [2025-04-13 19:00:07,178 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:07,342 INFO L225 Difference]: With dead ends: 37803 [2025-04-13 19:00:07,342 INFO L226 Difference]: Without dead ends: 37231 [2025-04-13 19:00:07,353 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=578, Invalid=1774, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 19:00:07,353 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 694 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:07,353 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 339 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 19:00:07,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37231 states. [2025-04-13 19:00:13,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37231 to 16940. [2025-04-13 19:00:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16940 states, 16939 states have (on average 4.552748096109569) internal successors, (77119), 16939 states have internal predecessors, (77119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16940 states to 16940 states and 77119 transitions. [2025-04-13 19:00:13,344 INFO L79 Accepts]: Start accepts. Automaton has 16940 states and 77119 transitions. Word has length 29 [2025-04-13 19:00:13,344 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:13,344 INFO L485 AbstractCegarLoop]: Abstraction has 16940 states and 77119 transitions. [2025-04-13 19:00:13,344 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 18 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:13,344 INFO L278 IsEmpty]: Start isEmpty. Operand 16940 states and 77119 transitions. [2025-04-13 19:00:13,375 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 19:00:13,375 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:13,375 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] [2025-04-13 19:00:13,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 19:00:13,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-13 19:00:13,576 INFO L403 AbstractCegarLoop]: === Iteration 50 === 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 19:00:13,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:13,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1939958442, now seen corresponding path program 13 times [2025-04-13 19:00:13,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:13,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130487078] [2025-04-13 19:00:13,576 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:00:13,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:13,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:00:13,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:00:13,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:00:13,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:13,684 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 19:00:13,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:13,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130487078] [2025-04-13 19:00:13,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130487078] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:00:13,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:00:13,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:00:13,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119237597] [2025-04-13 19:00:13,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:00:13,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:00:13,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:13,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:00:13,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:00:13,685 INFO L87 Difference]: Start difference. First operand 16940 states and 77119 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:25,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:00:25,075 INFO L93 Difference]: Finished difference Result 21014 states and 94481 transitions. [2025-04-13 19:00:25,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 19:00:25,075 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-04-13 19:00:25,075 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:00:25,176 INFO L225 Difference]: With dead ends: 21014 [2025-04-13 19:00:25,176 INFO L226 Difference]: Without dead ends: 20371 [2025-04-13 19:00:25,182 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-04-13 19:00:25,182 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 115 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 19:00:25,182 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 107 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 19:00:25,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20371 states. [2025-04-13 19:00:30,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20371 to 16495. [2025-04-13 19:00:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16495 states, 16494 states have (on average 4.5524433127197765) internal successors, (75088), 16494 states have internal predecessors, (75088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16495 states to 16495 states and 75088 transitions. [2025-04-13 19:00:30,959 INFO L79 Accepts]: Start accepts. Automaton has 16495 states and 75088 transitions. Word has length 29 [2025-04-13 19:00:30,959 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:00:30,959 INFO L485 AbstractCegarLoop]: Abstraction has 16495 states and 75088 transitions. [2025-04-13 19:00:30,959 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:00:30,959 INFO L278 IsEmpty]: Start isEmpty. Operand 16495 states and 75088 transitions. [2025-04-13 19:00:30,991 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 19:00:30,991 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:00:30,991 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] [2025-04-13 19:00:30,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-04-13 19:00:30,991 INFO L403 AbstractCegarLoop]: === Iteration 51 === 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 19:00:30,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:00:30,992 INFO L85 PathProgramCache]: Analyzing trace with hash 869909008, now seen corresponding path program 1 times [2025-04-13 19:00:30,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:00:30,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371704370] [2025-04-13 19:00:30,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:00:30,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:00:30,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 19:00:30,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 19:00:30,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:00:30,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:31,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:00:31,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371704370] [2025-04-13 19:00:31,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371704370] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:00:31,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812519037] [2025-04-13 19:00:31,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:00:31,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:00:31,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:00:31,135 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:00:31,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 19:00:31,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 19:00:31,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 19:00:31,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:00:31,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:00:31,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 19:00:31,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:00:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:31,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:00:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:00:31,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812519037] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:00:31,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:00:31,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2025-04-13 19:00:31,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570380336] [2025-04-13 19:00:31,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:00:31,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 19:00:31,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:00:31,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 19:00:31,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2025-04-13 19:00:31,989 INFO L87 Difference]: Start difference. First operand 16495 states and 75088 transitions. Second operand has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:32,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 19:02:32,887 INFO L93 Difference]: Finished difference Result 160533 states and 707811 transitions. [2025-04-13 19:02:32,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 287 states. [2025-04-13 19:02:32,888 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 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 32 [2025-04-13 19:02:32,888 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 19:02:33,898 INFO L225 Difference]: With dead ends: 160533 [2025-04-13 19:02:33,898 INFO L226 Difference]: Without dead ends: 153107 [2025-04-13 19:02:33,958 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39432 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=11020, Invalid=77486, Unknown=0, NotChecked=0, Total=88506 [2025-04-13 19:02:33,959 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 2034 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 8710 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2034 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 8961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 8710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-04-13 19:02:33,959 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2034 Valid, 2040 Invalid, 8961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 8710 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-04-13 19:02:34,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153107 states. [2025-04-13 19:02:50,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153107 to 32892. [2025-04-13 19:02:51,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32892 states, 32891 states have (on average 4.60217080660363) internal successors, (151370), 32891 states have internal predecessors, (151370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32892 states to 32892 states and 151370 transitions. [2025-04-13 19:02:51,371 INFO L79 Accepts]: Start accepts. Automaton has 32892 states and 151370 transitions. Word has length 32 [2025-04-13 19:02:51,371 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 19:02:51,371 INFO L485 AbstractCegarLoop]: Abstraction has 32892 states and 151370 transitions. [2025-04-13 19:02:51,372 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:02:51,372 INFO L278 IsEmpty]: Start isEmpty. Operand 32892 states and 151370 transitions. [2025-04-13 19:02:51,441 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 19:02:51,442 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 19:02:51,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:02:51,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 19:02:51,642 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:02:51,642 INFO L403 AbstractCegarLoop]: === Iteration 52 === 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 19:02:51,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:02:51,643 INFO L85 PathProgramCache]: Analyzing trace with hash -702123382, now seen corresponding path program 2 times [2025-04-13 19:02:51,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:02:51,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450896091] [2025-04-13 19:02:51,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:02:51,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:02:51,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 19:02:51,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 19:02:51,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:02:51,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:51,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:02:51,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450896091] [2025-04-13 19:02:51,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450896091] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:02:51,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870448807] [2025-04-13 19:02:51,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:02:51,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:02:51,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:02:51,784 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:02:51,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 19:02:51,812 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 19:02:51,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 19:02:51,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:02:51,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:02:51,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 19:02:51,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:02:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:52,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:02:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:02:52,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870448807] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:02:52,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:02:52,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-04-13 19:02:52,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069296092] [2025-04-13 19:02:52,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:02:52,263 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 19:02:52,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:02:52,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 19:02:52,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-04-13 19:02:52,263 INFO L87 Difference]: Start difference. First operand 32892 states and 151370 transitions. Second operand has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2025-04-13 19:04:33,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 457 states. [2025-04-13 19:04:33,417 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 19:04:33,417 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 19:04:33,428 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 463 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100848 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=25013, Invalid=190747, Unknown=0, NotChecked=0, Total=215760 [2025-04-13 19:04:33,436 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 2563 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 6576 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2563 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 6904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 6576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 19:04:33,436 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2563 Valid, 1222 Invalid, 6904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 6576 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 19:04:33,438 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 19:04:33,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 19:04:33,639 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:04:33,639 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (32892states) and FLOYD_HOARE automaton (currently 457 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (100355 states constructed, input type IntersectNwa). [2025-04-13 19:04:33,644 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 19:04:33,644 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 19:04:33,644 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 19:04:33,644 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 19:04:33,652 INFO L422 BasicCegarLoop]: Path program histogram: [16, 13, 11, 9, 2, 1] [2025-04-13 19:04:33,663 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:04:33,663 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:04:33,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:04:33 BasicIcfg [2025-04-13 19:04:33,666 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:04:33,671 INFO L158 Benchmark]: Toolchain (without parser) took 795946.98ms. Allocated memory was 155.2MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 108.1MB in the beginning and 1.1GB in the end (delta: -953.4MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2025-04-13 19:04:33,672 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:04:33,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.57ms. Allocated memory is still 155.2MB. Free memory was 108.1MB in the beginning and 93.0MB in the end (delta: 15.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 19:04:33,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.75ms. Allocated memory is still 155.2MB. Free memory was 93.0MB in the beginning and 91.4MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:04:33,672 INFO L158 Benchmark]: Boogie Preprocessor took 42.82ms. Allocated memory is still 155.2MB. Free memory was 91.4MB in the beginning and 89.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:04:33,673 INFO L158 Benchmark]: RCFGBuilder took 405.53ms. Allocated memory is still 155.2MB. Free memory was 89.5MB in the beginning and 52.4MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-13 19:04:33,673 INFO L158 Benchmark]: TraceAbstraction took 795208.27ms. Allocated memory was 155.2MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 51.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-04-13 19:04:33,678 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.23ms. Allocated memory is still 159.4MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.57ms. Allocated memory is still 155.2MB. Free memory was 108.1MB in the beginning and 93.0MB in the end (delta: 15.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.75ms. Allocated memory is still 155.2MB. Free memory was 93.0MB in the beginning and 91.4MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.82ms. Allocated memory is still 155.2MB. Free memory was 91.4MB in the beginning and 89.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 405.53ms. Allocated memory is still 155.2MB. Free memory was 89.5MB in the beginning and 52.4MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 795208.27ms. Allocated memory was 155.2MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 51.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (32892states) and FLOYD_HOARE automaton (currently 457 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (100355 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 130]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (32892states) and FLOYD_HOARE automaton (currently 457 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (100355 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (32892states) and FLOYD_HOARE automaton (currently 457 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (100355 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 132]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (32892states) and FLOYD_HOARE automaton (currently 457 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (100355 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 131]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (32892states) and FLOYD_HOARE automaton (currently 457 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (100355 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 68 locations, 75 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 795.1s, OverallIterations: 52, TraceHistogramMax: 1, PathProgramHistogramMax: 16, EmptinessCheckTime: 1.9s, AutomataDifference: 591.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13105 SdHoareTripleChecker+Valid, 19.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13105 mSDsluCounter, 9364 SdHoareTripleChecker+Invalid, 15.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7510 mSDsCounter, 1341 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33700 IncrementalHoareTripleChecker+Invalid, 35041 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1341 mSolverCounterUnsat, 1854 mSDtfsCounter, 33700 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1823 GetRequests, 500 SyntacticMatches, 5 SemanticMatches, 1318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144030 ImplicationChecksByTransitivity, 23.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32892occurred in iteration=51, InterpolantAutomatonStates: 847, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 188.3s AutomataMinimizationTime, 51 MinimizatonAttempts, 507643 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 1720 NumberOfCodeBlocks, 1720 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 1863 ConstructedInterpolants, 8 QuantifiedInterpolants, 14027 SizeOfPredicates, 43 NumberOfNonLiveVariables, 1212 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 66 InterpolantComputations, 46 PerfectInterpolantSequences, 19/45 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown