/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/popl20-more-buffer-mult3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:23:45,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:23:45,434 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:23:45,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:23:45,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:23:45,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:23:45,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:23:45,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:23:45,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:23:45,456 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:23:45,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:23:45,456 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:23:45,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:23:45,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:23:45,458 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:23:45,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:23:45,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:23:45,459 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:23:45,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:23:45,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:23:45,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:23:45,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:23:45,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:23:45,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:23:45,459 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:23:45,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:23:45,459 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:23:45,460 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:23:45,460 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:23:45,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:23:45,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:23:45,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:23:45,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:23:45,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:23:45,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:23:45,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:23:45,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:23:45,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:23:45,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:23:45,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:23:45,461 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:23:45,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:23:45,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:23:45,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:23:45,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:23:45,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:23:45,461 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:23:45,461 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 18:23:45,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:23:45,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:23:45,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:23:45,685 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:23:45,687 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:23:45,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult3.wvr.c [2025-04-13 18:23:46,924 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df905da9c/f5f0f3d37f4c48f39d1c4c19bcf53628/FLAG55aadd820 [2025-04-13 18:23:47,137 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:23:47,137 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult3.wvr.c [2025-04-13 18:23:47,146 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df905da9c/f5f0f3d37f4c48f39d1c4c19bcf53628/FLAG55aadd820 [2025-04-13 18:23:47,925 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df905da9c/f5f0f3d37f4c48f39d1c4c19bcf53628 [2025-04-13 18:23:47,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:23:47,930 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:23:47,931 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:23:47,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:23:47,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:23:47,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:23:47" (1/1) ... [2025-04-13 18:23:47,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf4bb81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:47, skipping insertion in model container [2025-04-13 18:23:47,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:23:47" (1/1) ... [2025-04-13 18:23:47,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:23:48,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult3.wvr.c[4270,4283] [2025-04-13 18:23:48,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:23:48,167 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:23:48,206 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult3.wvr.c[4270,4283] [2025-04-13 18:23:48,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:23:48,226 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:23:48,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:48 WrapperNode [2025-04-13 18:23:48,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:23:48,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:23:48,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:23:48,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:23:48,233 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:23:48" (1/1) ... [2025-04-13 18:23:48,242 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:23:48" (1/1) ... [2025-04-13 18:23:48,273 INFO L138 Inliner]: procedures = 26, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 278 [2025-04-13 18:23:48,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:23:48,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:23:48,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:23:48,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:23:48,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:48" (1/1) ... [2025-04-13 18:23:48,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:48" (1/1) ... [2025-04-13 18:23:48,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:48" (1/1) ... [2025-04-13 18:23:48,299 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 18:23:48,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:48" (1/1) ... [2025-04-13 18:23:48,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:48" (1/1) ... [2025-04-13 18:23:48,304 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:48" (1/1) ... [2025-04-13 18:23:48,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:48" (1/1) ... [2025-04-13 18:23:48,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:48" (1/1) ... [2025-04-13 18:23:48,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:48" (1/1) ... [2025-04-13 18:23:48,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:48" (1/1) ... [2025-04-13 18:23:48,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:23:48,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:23:48,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:23:48,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:23:48,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:48" (1/1) ... [2025-04-13 18:23:48,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:23:48,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:48,340 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:23:48,342 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:23:48,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:23:48,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:23:48,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:23:48,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:23:48,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:23:48,363 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:23:48,363 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:23:48,363 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:23:48,363 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:23:48,363 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:23:48,363 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:23:48,363 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 18:23:48,363 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 18:23:48,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:23:48,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:23:48,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 18:23:48,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 18:23:48,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:23:48,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:23:48,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:23:48,365 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:23:48,465 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:23:48,467 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:23:48,786 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:23:48,787 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:23:48,787 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:23:49,090 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:23:49,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:23:49 BoogieIcfgContainer [2025-04-13 18:23:49,090 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:23:49,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:23:49,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:23:49,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:23:49,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:23:47" (1/3) ... [2025-04-13 18:23:49,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ac6ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:23:49, skipping insertion in model container [2025-04-13 18:23:49,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:48" (2/3) ... [2025-04-13 18:23:49,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ac6ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:23:49, skipping insertion in model container [2025-04-13 18:23:49,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:23:49" (3/3) ... [2025-04-13 18:23:49,099 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult3.wvr.c [2025-04-13 18:23:49,110 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:23:49,112 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult3.wvr.c that has 5 procedures, 44 locations, 45 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 18:23:49,112 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:23:49,163 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 18:23:49,185 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 49 transitions, 126 flow [2025-04-13 18:23:49,432 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4528 states, 4527 states have (on average 4.34857521537442) internal successors, (19686), 4527 states have internal predecessors, (19686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:49,454 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:23:49,462 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;@16d96a75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:23:49,463 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 18:23:49,480 INFO L278 IsEmpty]: Start isEmpty. Operand has 4528 states, 4527 states have (on average 4.34857521537442) internal successors, (19686), 4527 states have internal predecessors, (19686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:49,524 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:23:49,525 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:49,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:49,526 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:23:49,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:49,530 INFO L85 PathProgramCache]: Analyzing trace with hash 677386531, now seen corresponding path program 1 times [2025-04-13 18:23:49,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:49,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020612847] [2025-04-13 18:23:49,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:23:49,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:49,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:23:49,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:23:49,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:49,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:49,869 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:23:49,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:49,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020612847] [2025-04-13 18:23:49,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020612847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:49,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:49,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 18:23:49,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647640151] [2025-04-13 18:23:49,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:49,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:23:49,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:49,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:23:49,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:23:49,908 INFO L87 Difference]: Start difference. First operand has 4528 states, 4527 states have (on average 4.34857521537442) internal successors, (19686), 4527 states have internal predecessors, (19686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:50,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:50,182 INFO L93 Difference]: Finished difference Result 7055 states and 30786 transitions. [2025-04-13 18:23:50,183 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:23:50,184 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:23:50,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:50,278 INFO L225 Difference]: With dead ends: 7055 [2025-04-13 18:23:50,278 INFO L226 Difference]: Without dead ends: 6946 [2025-04-13 18:23:50,286 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:23:50,290 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:50,290 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 32 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:23:50,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2025-04-13 18:23:50,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 5893. [2025-04-13 18:23:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5893 states, 5892 states have (on average 4.356415478615071) internal successors, (25668), 5892 states have internal predecessors, (25668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5893 states to 5893 states and 25668 transitions. [2025-04-13 18:23:50,706 INFO L79 Accepts]: Start accepts. Automaton has 5893 states and 25668 transitions. Word has length 28 [2025-04-13 18:23:50,707 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:50,707 INFO L485 AbstractCegarLoop]: Abstraction has 5893 states and 25668 transitions. [2025-04-13 18:23:50,707 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:50,708 INFO L278 IsEmpty]: Start isEmpty. Operand 5893 states and 25668 transitions. [2025-04-13 18:23:50,729 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:23:50,729 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:50,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:50,730 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:23:50,730 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:23:50,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:50,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1318031571, now seen corresponding path program 1 times [2025-04-13 18:23:50,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:50,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635085180] [2025-04-13 18:23:50,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:23:50,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:50,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 18:23:50,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:23:50,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:50,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:50,902 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:23:50,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:50,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635085180] [2025-04-13 18:23:50,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635085180] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:50,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:50,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:23:50,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887313560] [2025-04-13 18:23:50,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:50,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:23:50,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:50,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:23:50,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:23:50,904 INFO L87 Difference]: Start difference. First operand 5893 states and 25668 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:51,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:51,273 INFO L93 Difference]: Finished difference Result 11194 states and 48773 transitions. [2025-04-13 18:23:51,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:23:51,274 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-13 18:23:51,274 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:51,339 INFO L225 Difference]: With dead ends: 11194 [2025-04-13 18:23:51,339 INFO L226 Difference]: Without dead ends: 8038 [2025-04-13 18:23:51,352 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:23:51,352 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:51,352 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 27 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:23:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8038 states. [2025-04-13 18:23:51,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8038 to 7525. [2025-04-13 18:23:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7525 states, 7524 states have (on average 4.330940988835725) internal successors, (32586), 7524 states have internal predecessors, (32586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7525 states to 7525 states and 32586 transitions. [2025-04-13 18:23:51,671 INFO L79 Accepts]: Start accepts. Automaton has 7525 states and 32586 transitions. Word has length 31 [2025-04-13 18:23:51,671 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:51,672 INFO L485 AbstractCegarLoop]: Abstraction has 7525 states and 32586 transitions. [2025-04-13 18:23:51,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:51,672 INFO L278 IsEmpty]: Start isEmpty. Operand 7525 states and 32586 transitions. [2025-04-13 18:23:51,694 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:23:51,694 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:51,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:51,695 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:23:51,695 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:23:51,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2067831343, now seen corresponding path program 1 times [2025-04-13 18:23:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:51,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80816032] [2025-04-13 18:23:51,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:23:51,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:51,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 18:23:51,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:23:51,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:51,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:51,821 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:23:51,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:51,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80816032] [2025-04-13 18:23:51,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80816032] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:51,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:51,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:23:51,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104084572] [2025-04-13 18:23:51,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:51,822 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:23:51,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:51,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:23:51,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:23:51,822 INFO L87 Difference]: Start difference. First operand 7525 states and 32586 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:52,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:52,245 INFO L93 Difference]: Finished difference Result 13704 states and 59375 transitions. [2025-04-13 18:23:52,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:23:52,245 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-13 18:23:52,246 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:52,308 INFO L225 Difference]: With dead ends: 13704 [2025-04-13 18:23:52,309 INFO L226 Difference]: Without dead ends: 10092 [2025-04-13 18:23:52,319 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:23:52,320 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:52,320 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:23:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10092 states. [2025-04-13 18:23:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10092 to 9614. [2025-04-13 18:23:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9614 states, 9613 states have (on average 4.281077707271403) internal successors, (41154), 9613 states have internal predecessors, (41154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:52,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 41154 transitions. [2025-04-13 18:23:52,792 INFO L79 Accepts]: Start accepts. Automaton has 9614 states and 41154 transitions. Word has length 31 [2025-04-13 18:23:52,792 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:52,792 INFO L485 AbstractCegarLoop]: Abstraction has 9614 states and 41154 transitions. [2025-04-13 18:23:52,793 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:52,794 INFO L278 IsEmpty]: Start isEmpty. Operand 9614 states and 41154 transitions. [2025-04-13 18:23:52,823 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 18:23:52,823 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:52,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:52,823 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:23:52,823 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:23:52,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:52,824 INFO L85 PathProgramCache]: Analyzing trace with hash 589230440, now seen corresponding path program 1 times [2025-04-13 18:23:52,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:52,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666451331] [2025-04-13 18:23:52,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:23:52,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:52,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 18:23:52,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:23:52,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:52,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:52,992 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:23:52,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:52,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666451331] [2025-04-13 18:23:52,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666451331] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:52,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:52,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:23:52,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447233617] [2025-04-13 18:23:52,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:52,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:23:52,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:52,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:23:52,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:23:52,994 INFO L87 Difference]: Start difference. First operand 9614 states and 41154 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:53,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:53,434 INFO L93 Difference]: Finished difference Result 19689 states and 83804 transitions. [2025-04-13 18:23:53,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:23:53,434 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 18:23:53,434 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:53,498 INFO L225 Difference]: With dead ends: 19689 [2025-04-13 18:23:53,499 INFO L226 Difference]: Without dead ends: 12043 [2025-04-13 18:23:53,516 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:23:53,517 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:53,517 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 48 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:23:53,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12043 states. [2025-04-13 18:23:53,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12043 to 11243. [2025-04-13 18:23:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11243 states, 11242 states have (on average 4.2466642946095) internal successors, (47741), 11242 states have internal predecessors, (47741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11243 states to 11243 states and 47741 transitions. [2025-04-13 18:23:53,952 INFO L79 Accepts]: Start accepts. Automaton has 11243 states and 47741 transitions. Word has length 35 [2025-04-13 18:23:53,952 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:53,952 INFO L485 AbstractCegarLoop]: Abstraction has 11243 states and 47741 transitions. [2025-04-13 18:23:53,952 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:53,952 INFO L278 IsEmpty]: Start isEmpty. Operand 11243 states and 47741 transitions. [2025-04-13 18:23:53,978 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 18:23:53,979 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:53,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:53,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:23:53,979 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:23:53,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:53,979 INFO L85 PathProgramCache]: Analyzing trace with hash -176719858, now seen corresponding path program 1 times [2025-04-13 18:23:53,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:53,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70377803] [2025-04-13 18:23:53,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:23:53,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:53,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 18:23:53,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:23:53,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:53,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:54,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:54,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70377803] [2025-04-13 18:23:54,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70377803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:54,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:54,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:23:54,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008559921] [2025-04-13 18:23:54,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:54,103 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:23:54,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:54,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:23:54,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:23:54,104 INFO L87 Difference]: Start difference. First operand 11243 states and 47741 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:54,612 INFO L93 Difference]: Finished difference Result 22844 states and 96682 transitions. [2025-04-13 18:23:54,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:23:54,613 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 18:23:54,613 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:54,697 INFO L225 Difference]: With dead ends: 22844 [2025-04-13 18:23:54,697 INFO L226 Difference]: Without dead ends: 13692 [2025-04-13 18:23:54,716 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:23:54,716 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:54,716 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 48 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:23:54,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13692 states. [2025-04-13 18:23:55,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13692 to 13060. [2025-04-13 18:23:55,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13060 states, 13059 states have (on average 4.216249329964009) internal successors, (55060), 13059 states have internal predecessors, (55060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:55,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13060 states to 13060 states and 55060 transitions. [2025-04-13 18:23:55,331 INFO L79 Accepts]: Start accepts. Automaton has 13060 states and 55060 transitions. Word has length 35 [2025-04-13 18:23:55,331 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:55,331 INFO L485 AbstractCegarLoop]: Abstraction has 13060 states and 55060 transitions. [2025-04-13 18:23:55,331 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:55,332 INFO L278 IsEmpty]: Start isEmpty. Operand 13060 states and 55060 transitions. [2025-04-13 18:23:55,369 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:23:55,369 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:55,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:55,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:23:55,370 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:23:55,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:55,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1306667276, now seen corresponding path program 1 times [2025-04-13 18:23:55,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:55,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952004896] [2025-04-13 18:23:55,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:23:55,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:55,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:23:55,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:23:55,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:55,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:55,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:55,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952004896] [2025-04-13 18:23:55,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952004896] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:55,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:55,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:23:55,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237360891] [2025-04-13 18:23:55,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:55,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:23:55,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:55,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:23:55,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:23:55,866 INFO L87 Difference]: Start difference. First operand 13060 states and 55060 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:57,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:57,032 INFO L93 Difference]: Finished difference Result 19285 states and 80737 transitions. [2025-04-13 18:23:57,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:23:57,033 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:23:57,033 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:57,126 INFO L225 Difference]: With dead ends: 19285 [2025-04-13 18:23:57,126 INFO L226 Difference]: Without dead ends: 17347 [2025-04-13 18:23:57,137 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:23:57,138 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 125 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:57,138 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 85 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:23:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17347 states. [2025-04-13 18:23:57,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17347 to 13933. [2025-04-13 18:23:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13933 states, 13932 states have (on average 4.225667527993109) internal successors, (58872), 13932 states have internal predecessors, (58872), 0 states have call successors, (0), 0 states have 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:23:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13933 states to 13933 states and 58872 transitions. [2025-04-13 18:23:57,910 INFO L79 Accepts]: Start accepts. Automaton has 13933 states and 58872 transitions. Word has length 36 [2025-04-13 18:23:57,910 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:57,910 INFO L485 AbstractCegarLoop]: Abstraction has 13933 states and 58872 transitions. [2025-04-13 18:23:57,910 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:57,910 INFO L278 IsEmpty]: Start isEmpty. Operand 13933 states and 58872 transitions. [2025-04-13 18:23:57,941 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:23:57,941 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:57,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:57,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:23:57,942 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:23:57,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:57,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1775680522, now seen corresponding path program 2 times [2025-04-13 18:23:57,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:57,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967826708] [2025-04-13 18:23:57,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:23:57,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:57,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:23:57,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 18:23:57,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:23:57,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:58,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:58,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967826708] [2025-04-13 18:23:58,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967826708] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:58,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:58,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:23:58,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343913509] [2025-04-13 18:23:58,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:58,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:23:58,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:58,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:23:58,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:23:58,214 INFO L87 Difference]: Start difference. First operand 13933 states and 58872 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:59,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:59,489 INFO L93 Difference]: Finished difference Result 18433 states and 77873 transitions. [2025-04-13 18:23:59,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:23:59,489 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:23:59,489 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:59,570 INFO L225 Difference]: With dead ends: 18433 [2025-04-13 18:23:59,571 INFO L226 Difference]: Without dead ends: 15963 [2025-04-13 18:23:59,582 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:23:59,583 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 129 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:59,583 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 118 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:23:59,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15963 states. [2025-04-13 18:24:00,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15963 to 12589. [2025-04-13 18:24:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12589 states, 12588 states have (on average 4.232761360025421) internal successors, (53282), 12588 states have internal predecessors, (53282), 0 states have call successors, (0), 0 states have 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:24:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12589 states to 12589 states and 53282 transitions. [2025-04-13 18:24:00,513 INFO L79 Accepts]: Start accepts. Automaton has 12589 states and 53282 transitions. Word has length 36 [2025-04-13 18:24:00,513 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:00,513 INFO L485 AbstractCegarLoop]: Abstraction has 12589 states and 53282 transitions. [2025-04-13 18:24:00,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:00,513 INFO L278 IsEmpty]: Start isEmpty. Operand 12589 states and 53282 transitions. [2025-04-13 18:24:00,544 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:24:00,545 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:00,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:00,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:24:00,545 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:24:00,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash -874101776, now seen corresponding path program 3 times [2025-04-13 18:24:00,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:00,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112760007] [2025-04-13 18:24:00,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:24:00,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:00,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:24:00,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 18:24:00,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:24:00,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:00,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:00,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:00,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112760007] [2025-04-13 18:24:00,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112760007] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:00,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:00,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:24:00,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658250531] [2025-04-13 18:24:00,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:00,906 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:24:00,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:00,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:24:00,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:24:00,906 INFO L87 Difference]: Start difference. First operand 12589 states and 53282 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:02,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:02,178 INFO L93 Difference]: Finished difference Result 19686 states and 81684 transitions. [2025-04-13 18:24:02,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:24:02,179 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:24:02,179 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:02,364 INFO L225 Difference]: With dead ends: 19686 [2025-04-13 18:24:02,364 INFO L226 Difference]: Without dead ends: 18366 [2025-04-13 18:24:02,370 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:24:02,371 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 147 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:02,371 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 110 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:24:02,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18366 states. [2025-04-13 18:24:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18366 to 12701. [2025-04-13 18:24:02,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12701 states, 12700 states have (on average 4.242992125984252) internal successors, (53886), 12700 states have internal predecessors, (53886), 0 states have call successors, (0), 0 states have 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:24:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12701 states to 12701 states and 53886 transitions. [2025-04-13 18:24:03,005 INFO L79 Accepts]: Start accepts. Automaton has 12701 states and 53886 transitions. Word has length 36 [2025-04-13 18:24:03,005 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:03,005 INFO L485 AbstractCegarLoop]: Abstraction has 12701 states and 53886 transitions. [2025-04-13 18:24:03,005 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:03,005 INFO L278 IsEmpty]: Start isEmpty. Operand 12701 states and 53886 transitions. [2025-04-13 18:24:03,030 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:24:03,030 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:03,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:03,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 18:24:03,030 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:24:03,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:03,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1202184624, now seen corresponding path program 4 times [2025-04-13 18:24:03,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:03,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137147042] [2025-04-13 18:24:03,031 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:24:03,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:03,038 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:24:03,053 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:24:03,054 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:24:03,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:03,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:03,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137147042] [2025-04-13 18:24:03,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137147042] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:03,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:03,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:24:03,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117913253] [2025-04-13 18:24:03,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:03,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:24:03,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:03,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:24:03,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:24:03,294 INFO L87 Difference]: Start difference. First operand 12701 states and 53886 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:04,913 INFO L93 Difference]: Finished difference Result 20971 states and 86314 transitions. [2025-04-13 18:24:04,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:24:04,914 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:24:04,914 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:05,013 INFO L225 Difference]: With dead ends: 20971 [2025-04-13 18:24:05,013 INFO L226 Difference]: Without dead ends: 20059 [2025-04-13 18:24:05,024 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:24:05,024 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 159 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:05,024 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 103 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:24:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20059 states. [2025-04-13 18:24:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20059 to 12841. [2025-04-13 18:24:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12841 states, 12840 states have (on average 4.260747663551402) internal successors, (54708), 12840 states have internal predecessors, (54708), 0 states have call successors, (0), 0 states have 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:24:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12841 states to 12841 states and 54708 transitions. [2025-04-13 18:24:05,949 INFO L79 Accepts]: Start accepts. Automaton has 12841 states and 54708 transitions. Word has length 36 [2025-04-13 18:24:05,949 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:05,949 INFO L485 AbstractCegarLoop]: Abstraction has 12841 states and 54708 transitions. [2025-04-13 18:24:05,949 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:05,949 INFO L278 IsEmpty]: Start isEmpty. Operand 12841 states and 54708 transitions. [2025-04-13 18:24:05,975 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:24:05,975 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:05,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:05,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:24:05,975 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:24:05,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:05,975 INFO L85 PathProgramCache]: Analyzing trace with hash 995942946, now seen corresponding path program 5 times [2025-04-13 18:24:05,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:05,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811074070] [2025-04-13 18:24:05,976 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:24:05,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:05,982 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:24:05,989 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:24:05,989 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:24:05,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:06,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:06,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811074070] [2025-04-13 18:24:06,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811074070] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:06,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:06,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:24:06,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010687278] [2025-04-13 18:24:06,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:06,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:24:06,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:06,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:24:06,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:24:06,255 INFO L87 Difference]: Start difference. First operand 12841 states and 54708 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:07,349 INFO L93 Difference]: Finished difference Result 15157 states and 62824 transitions. [2025-04-13 18:24:07,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:24:07,349 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:24:07,349 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:07,419 INFO L225 Difference]: With dead ends: 15157 [2025-04-13 18:24:07,419 INFO L226 Difference]: Without dead ends: 14610 [2025-04-13 18:24:07,429 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:24:07,429 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 150 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:07,429 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 61 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:24:07,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14610 states. [2025-04-13 18:24:08,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14610 to 12941. [2025-04-13 18:24:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12941 states, 12940 states have (on average 4.247140649149923) internal successors, (54958), 12940 states have internal predecessors, (54958), 0 states have call successors, (0), 0 states have 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:24:08,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12941 states to 12941 states and 54958 transitions. [2025-04-13 18:24:08,252 INFO L79 Accepts]: Start accepts. Automaton has 12941 states and 54958 transitions. Word has length 36 [2025-04-13 18:24:08,252 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:08,252 INFO L485 AbstractCegarLoop]: Abstraction has 12941 states and 54958 transitions. [2025-04-13 18:24:08,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:08,252 INFO L278 IsEmpty]: Start isEmpty. Operand 12941 states and 54958 transitions. [2025-04-13 18:24:08,282 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:24:08,282 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:08,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:08,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 18:24:08,282 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:24:08,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:08,283 INFO L85 PathProgramCache]: Analyzing trace with hash 444985416, now seen corresponding path program 6 times [2025-04-13 18:24:08,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:08,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902903137] [2025-04-13 18:24:08,283 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:24:08,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:08,289 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:24:08,302 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 32 of 36 statements. [2025-04-13 18:24:08,302 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:24:08,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:24:08,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:08,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902903137] [2025-04-13 18:24:08,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902903137] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:08,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:08,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:24:08,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774117262] [2025-04-13 18:24:08,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:08,532 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:24:08,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:08,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:24:08,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:24:08,532 INFO L87 Difference]: Start difference. First operand 12941 states and 54958 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:10,010 INFO L93 Difference]: Finished difference Result 15767 states and 64718 transitions. [2025-04-13 18:24:10,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:24:10,010 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:24:10,010 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:10,090 INFO L225 Difference]: With dead ends: 15767 [2025-04-13 18:24:10,090 INFO L226 Difference]: Without dead ends: 14535 [2025-04-13 18:24:10,098 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:24:10,098 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 115 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:10,098 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 86 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:24:10,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14535 states. [2025-04-13 18:24:11,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14535 to 12779. [2025-04-13 18:24:11,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12779 states, 12778 states have (on average 4.24307403349507) internal successors, (54218), 12778 states have internal predecessors, (54218), 0 states have call successors, (0), 0 states have 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:24:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12779 states to 12779 states and 54218 transitions. [2025-04-13 18:24:11,230 INFO L79 Accepts]: Start accepts. Automaton has 12779 states and 54218 transitions. Word has length 36 [2025-04-13 18:24:11,230 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:11,230 INFO L485 AbstractCegarLoop]: Abstraction has 12779 states and 54218 transitions. [2025-04-13 18:24:11,230 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:11,230 INFO L278 IsEmpty]: Start isEmpty. Operand 12779 states and 54218 transitions. [2025-04-13 18:24:11,254 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:24:11,254 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:11,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:11,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 18:24:11,255 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:24:11,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:11,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1777411726, now seen corresponding path program 7 times [2025-04-13 18:24:11,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:11,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121338951] [2025-04-13 18:24:11,255 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:24:11,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:11,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:24:11,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:24:11,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:24:11,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:11,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:11,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121338951] [2025-04-13 18:24:11,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121338951] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:11,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:11,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:24:11,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135184652] [2025-04-13 18:24:11,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:11,457 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:24:11,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:11,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:24:11,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:24:11,458 INFO L87 Difference]: Start difference. First operand 12779 states and 54218 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:12,452 INFO L93 Difference]: Finished difference Result 13265 states and 55664 transitions. [2025-04-13 18:24:12,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:24:12,452 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:24:12,452 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:12,518 INFO L225 Difference]: With dead ends: 13265 [2025-04-13 18:24:12,519 INFO L226 Difference]: Without dead ends: 12955 [2025-04-13 18:24:12,524 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:24:12,525 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 50 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:12,525 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 80 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:24:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12955 states. [2025-04-13 18:24:13,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12955 to 12739. [2025-04-13 18:24:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12739 states, 12738 states have (on average 4.2378709373528025) internal successors, (53982), 12738 states have internal predecessors, (53982), 0 states have call successors, (0), 0 states have 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:24:13,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12739 states to 12739 states and 53982 transitions. [2025-04-13 18:24:13,271 INFO L79 Accepts]: Start accepts. Automaton has 12739 states and 53982 transitions. Word has length 36 [2025-04-13 18:24:13,271 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:13,271 INFO L485 AbstractCegarLoop]: Abstraction has 12739 states and 53982 transitions. [2025-04-13 18:24:13,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:13,271 INFO L278 IsEmpty]: Start isEmpty. Operand 12739 states and 53982 transitions. [2025-04-13 18:24:13,296 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:24:13,296 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:13,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:13,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 18:24:13,297 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:24:13,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:13,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2048243698, now seen corresponding path program 8 times [2025-04-13 18:24:13,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:13,297 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558304824] [2025-04-13 18:24:13,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:24:13,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:13,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:24:13,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 18:24:13,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:24:13,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:13,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:13,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:13,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558304824] [2025-04-13 18:24:13,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558304824] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:13,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:13,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:24:13,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537276970] [2025-04-13 18:24:13,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:13,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:24:13,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:13,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:24:13,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:24:13,554 INFO L87 Difference]: Start difference. First operand 12739 states and 53982 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:15,157 INFO L93 Difference]: Finished difference Result 18546 states and 77206 transitions. [2025-04-13 18:24:15,157 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:24:15,157 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:24:15,157 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:15,240 INFO L225 Difference]: With dead ends: 18546 [2025-04-13 18:24:15,240 INFO L226 Difference]: Without dead ends: 17528 [2025-04-13 18:24:15,250 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:24:15,251 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 158 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:15,251 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 103 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:24:15,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17528 states. [2025-04-13 18:24:16,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17528 to 13147. [2025-04-13 18:24:16,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13147 states, 13146 states have (on average 4.23961661341853) internal successors, (55734), 13146 states have internal predecessors, (55734), 0 states have call successors, (0), 0 states have 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:24:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13147 states to 13147 states and 55734 transitions. [2025-04-13 18:24:16,290 INFO L79 Accepts]: Start accepts. Automaton has 13147 states and 55734 transitions. Word has length 36 [2025-04-13 18:24:16,290 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:16,290 INFO L485 AbstractCegarLoop]: Abstraction has 13147 states and 55734 transitions. [2025-04-13 18:24:16,290 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:16,290 INFO L278 IsEmpty]: Start isEmpty. Operand 13147 states and 55734 transitions. [2025-04-13 18:24:16,314 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:24:16,315 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:16,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:16,315 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 18:24:16,315 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:24:16,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:16,315 INFO L85 PathProgramCache]: Analyzing trace with hash -353357208, now seen corresponding path program 9 times [2025-04-13 18:24:16,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:16,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977469365] [2025-04-13 18:24:16,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:24:16,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:16,321 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:24:16,325 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 36 statements. [2025-04-13 18:24:16,325 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:24:16,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:24:16,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:16,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977469365] [2025-04-13 18:24:16,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977469365] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:16,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:16,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:24:16,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140874141] [2025-04-13 18:24:16,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:16,497 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:24:16,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:16,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:24:16,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:24:16,498 INFO L87 Difference]: Start difference. First operand 13147 states and 55734 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:18,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:18,089 INFO L93 Difference]: Finished difference Result 16839 states and 70737 transitions. [2025-04-13 18:24:18,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:24:18,089 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:24:18,089 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:18,167 INFO L225 Difference]: With dead ends: 16839 [2025-04-13 18:24:18,168 INFO L226 Difference]: Without dead ends: 16509 [2025-04-13 18:24:18,173 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:24:18,173 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 141 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:18,173 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 74 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:24:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16509 states. [2025-04-13 18:24:19,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16509 to 13047. [2025-04-13 18:24:19,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13047 states, 13046 states have (on average 4.2451326076958456) internal successors, (55382), 13046 states have internal predecessors, (55382), 0 states have call successors, (0), 0 states have 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:24:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13047 states to 13047 states and 55382 transitions. [2025-04-13 18:24:19,112 INFO L79 Accepts]: Start accepts. Automaton has 13047 states and 55382 transitions. Word has length 36 [2025-04-13 18:24:19,112 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:19,112 INFO L485 AbstractCegarLoop]: Abstraction has 13047 states and 55382 transitions. [2025-04-13 18:24:19,112 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:19,112 INFO L278 IsEmpty]: Start isEmpty. Operand 13047 states and 55382 transitions. [2025-04-13 18:24:19,136 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:24:19,136 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:19,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:19,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 18:24:19,137 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:24:19,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:19,137 INFO L85 PathProgramCache]: Analyzing trace with hash 335489652, now seen corresponding path program 10 times [2025-04-13 18:24:19,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:19,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220886971] [2025-04-13 18:24:19,137 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:24:19,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:19,142 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:24:19,151 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:24:19,151 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:24:19,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:19,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:19,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220886971] [2025-04-13 18:24:19,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220886971] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:19,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:19,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:24:19,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738433744] [2025-04-13 18:24:19,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:19,504 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:24:19,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:19,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:24:19,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:24:19,505 INFO L87 Difference]: Start difference. First operand 13047 states and 55382 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:21,696 INFO L93 Difference]: Finished difference Result 20630 states and 86724 transitions. [2025-04-13 18:24:21,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:24:21,696 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:24:21,696 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:21,779 INFO L225 Difference]: With dead ends: 20630 [2025-04-13 18:24:21,779 INFO L226 Difference]: Without dead ends: 19792 [2025-04-13 18:24:21,790 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:24:21,790 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 123 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:21,790 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 104 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:24:21,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19792 states. [2025-04-13 18:24:22,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19792 to 13244. [2025-04-13 18:24:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13244 states, 13243 states have (on average 4.265876312013894) internal successors, (56493), 13243 states have internal predecessors, (56493), 0 states have call successors, (0), 0 states have 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:24:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13244 states to 13244 states and 56493 transitions. [2025-04-13 18:24:22,932 INFO L79 Accepts]: Start accepts. Automaton has 13244 states and 56493 transitions. Word has length 36 [2025-04-13 18:24:22,932 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:22,932 INFO L485 AbstractCegarLoop]: Abstraction has 13244 states and 56493 transitions. [2025-04-13 18:24:22,932 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:22,932 INFO L278 IsEmpty]: Start isEmpty. Operand 13244 states and 56493 transitions. [2025-04-13 18:24:22,958 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:24:22,958 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:22,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:22,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 18:24:22,958 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:24:22,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:22,958 INFO L85 PathProgramCache]: Analyzing trace with hash -137311618, now seen corresponding path program 11 times [2025-04-13 18:24:22,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:22,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553987846] [2025-04-13 18:24:22,959 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:24:22,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:22,964 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:24:22,971 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:24:22,971 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:24:22,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:24:23,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:23,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553987846] [2025-04-13 18:24:23,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553987846] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:23,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:23,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:24:23,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838354936] [2025-04-13 18:24:23,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:23,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:24:23,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:23,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:24:23,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:24:23,150 INFO L87 Difference]: Start difference. First operand 13244 states and 56493 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:25,185 INFO L93 Difference]: Finished difference Result 17774 states and 74463 transitions. [2025-04-13 18:24:25,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:24:25,185 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:24:25,185 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:25,260 INFO L225 Difference]: With dead ends: 17774 [2025-04-13 18:24:25,260 INFO L226 Difference]: Without dead ends: 16882 [2025-04-13 18:24:25,269 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:24:25,270 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 116 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:25,270 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 75 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:24:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16882 states. [2025-04-13 18:24:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16882 to 12847. [2025-04-13 18:24:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12847 states, 12846 states have (on average 4.25035030359645) internal successors, (54600), 12846 states have internal predecessors, (54600), 0 states have call successors, (0), 0 states have 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:24:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12847 states to 12847 states and 54600 transitions. [2025-04-13 18:24:26,418 INFO L79 Accepts]: Start accepts. Automaton has 12847 states and 54600 transitions. Word has length 36 [2025-04-13 18:24:26,418 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:26,418 INFO L485 AbstractCegarLoop]: Abstraction has 12847 states and 54600 transitions. [2025-04-13 18:24:26,419 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:26,419 INFO L278 IsEmpty]: Start isEmpty. Operand 12847 states and 54600 transitions. [2025-04-13 18:24:26,444 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:24:26,444 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:26,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:26,444 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 18:24:26,444 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:24:26,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:26,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1986641130, now seen corresponding path program 12 times [2025-04-13 18:24:26,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:26,444 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750264610] [2025-04-13 18:24:26,444 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:24:26,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:26,450 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:24:26,457 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 18:24:26,457 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:24:26,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:26,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:26,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750264610] [2025-04-13 18:24:26,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750264610] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:26,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:26,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:24:26,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905171712] [2025-04-13 18:24:26,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:26,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:24:26,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:26,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:24:26,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:24:26,659 INFO L87 Difference]: Start difference. First operand 12847 states and 54600 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:28,954 INFO L93 Difference]: Finished difference Result 18267 states and 76665 transitions. [2025-04-13 18:24:28,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:24:28,955 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:24:28,955 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:29,042 INFO L225 Difference]: With dead ends: 18267 [2025-04-13 18:24:29,042 INFO L226 Difference]: Without dead ends: 17321 [2025-04-13 18:24:29,051 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:24:29,052 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 96 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:29,052 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 82 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:24:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17321 states. [2025-04-13 18:24:30,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17321 to 12787. [2025-04-13 18:24:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12787 states, 12786 states have (on average 4.249491631471923) internal successors, (54334), 12786 states have internal predecessors, (54334), 0 states have call successors, (0), 0 states have 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:24:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12787 states to 12787 states and 54334 transitions. [2025-04-13 18:24:30,239 INFO L79 Accepts]: Start accepts. Automaton has 12787 states and 54334 transitions. Word has length 36 [2025-04-13 18:24:30,239 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:30,239 INFO L485 AbstractCegarLoop]: Abstraction has 12787 states and 54334 transitions. [2025-04-13 18:24:30,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:30,240 INFO L278 IsEmpty]: Start isEmpty. Operand 12787 states and 54334 transitions. [2025-04-13 18:24:30,266 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:24:30,266 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:30,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:30,266 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 18:24:30,266 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:24:30,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:30,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1005851108, now seen corresponding path program 13 times [2025-04-13 18:24:30,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:30,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463647970] [2025-04-13 18:24:30,266 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:24:30,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:30,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:24:30,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:24:30,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:24:30,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:30,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:30,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:30,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463647970] [2025-04-13 18:24:30,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463647970] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:30,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:30,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:24:30,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106508575] [2025-04-13 18:24:30,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:30,401 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:24:30,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:30,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:24:30,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:24:30,402 INFO L87 Difference]: Start difference. First operand 12787 states and 54334 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:32,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:32,185 INFO L93 Difference]: Finished difference Result 16476 states and 69513 transitions. [2025-04-13 18:24:32,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:24:32,185 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:24:32,185 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:32,264 INFO L225 Difference]: With dead ends: 16476 [2025-04-13 18:24:32,264 INFO L226 Difference]: Without dead ends: 15722 [2025-04-13 18:24:32,273 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:24:32,273 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 138 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:32,273 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 110 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:24:32,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15722 states. [2025-04-13 18:24:33,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15722 to 12419. [2025-04-13 18:24:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12419 states, 12418 states have (on average 4.257207279755194) internal successors, (52866), 12418 states have internal predecessors, (52866), 0 states have call successors, (0), 0 states have 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:24:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12419 states to 12419 states and 52866 transitions. [2025-04-13 18:24:33,428 INFO L79 Accepts]: Start accepts. Automaton has 12419 states and 52866 transitions. Word has length 36 [2025-04-13 18:24:33,428 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:33,428 INFO L485 AbstractCegarLoop]: Abstraction has 12419 states and 52866 transitions. [2025-04-13 18:24:33,428 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:33,428 INFO L278 IsEmpty]: Start isEmpty. Operand 12419 states and 52866 transitions. [2025-04-13 18:24:33,452 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:24:33,453 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:33,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:33,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 18:24:33,453 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:24:33,453 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:33,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1199674200, now seen corresponding path program 14 times [2025-04-13 18:24:33,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:33,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238089929] [2025-04-13 18:24:33,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:24:33,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:33,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:24:33,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 18:24:33,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:24:33,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:33,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:33,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238089929] [2025-04-13 18:24:33,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238089929] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:33,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:33,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:24:33,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601458185] [2025-04-13 18:24:33,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:33,616 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:24:33,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:33,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:24:33,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:24:33,616 INFO L87 Difference]: Start difference. First operand 12419 states and 52866 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:35,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:35,165 INFO L93 Difference]: Finished difference Result 14218 states and 59817 transitions. [2025-04-13 18:24:35,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:24:35,165 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:24:35,165 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:35,236 INFO L225 Difference]: With dead ends: 14218 [2025-04-13 18:24:35,236 INFO L226 Difference]: Without dead ends: 14099 [2025-04-13 18:24:35,241 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:24:35,241 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 67 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:35,241 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 80 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:24:35,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14099 states. [2025-04-13 18:24:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14099 to 12407. [2025-04-13 18:24:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12407 states, 12406 states have (on average 4.258584555860068) internal successors, (52832), 12406 states have internal predecessors, (52832), 0 states have call successors, (0), 0 states have 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:24:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12407 states to 12407 states and 52832 transitions. [2025-04-13 18:24:36,265 INFO L79 Accepts]: Start accepts. Automaton has 12407 states and 52832 transitions. Word has length 36 [2025-04-13 18:24:36,265 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:36,265 INFO L485 AbstractCegarLoop]: Abstraction has 12407 states and 52832 transitions. [2025-04-13 18:24:36,265 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:36,265 INFO L278 IsEmpty]: Start isEmpty. Operand 12407 states and 52832 transitions. [2025-04-13 18:24:36,287 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:24:36,287 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:36,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:36,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 18:24:36,287 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:24:36,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:36,288 INFO L85 PathProgramCache]: Analyzing trace with hash 164492904, now seen corresponding path program 15 times [2025-04-13 18:24:36,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:36,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984542257] [2025-04-13 18:24:36,288 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:24:36,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:36,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:24:36,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 36 statements. [2025-04-13 18:24:36,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:24:36,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:36,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:36,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984542257] [2025-04-13 18:24:36,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984542257] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:36,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:36,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:24:36,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102029063] [2025-04-13 18:24:36,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:36,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:24:36,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:36,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:24:36,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:24:36,446 INFO L87 Difference]: Start difference. First operand 12407 states and 52832 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:38,316 INFO L93 Difference]: Finished difference Result 15423 states and 64461 transitions. [2025-04-13 18:24:38,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:24:38,317 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:24:38,317 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:38,382 INFO L225 Difference]: With dead ends: 15423 [2025-04-13 18:24:38,382 INFO L226 Difference]: Without dead ends: 15316 [2025-04-13 18:24:38,388 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:24:38,389 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 104 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:38,389 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 97 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:24:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15316 states. [2025-04-13 18:24:39,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15316 to 12423. [2025-04-13 18:24:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12423 states, 12422 states have (on average 4.259056512638867) internal successors, (52906), 12422 states have internal predecessors, (52906), 0 states have call successors, (0), 0 states have 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:24:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12423 states to 12423 states and 52906 transitions. [2025-04-13 18:24:39,517 INFO L79 Accepts]: Start accepts. Automaton has 12423 states and 52906 transitions. Word has length 36 [2025-04-13 18:24:39,518 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:39,518 INFO L485 AbstractCegarLoop]: Abstraction has 12423 states and 52906 transitions. [2025-04-13 18:24:39,518 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:39,518 INFO L278 IsEmpty]: Start isEmpty. Operand 12423 states and 52906 transitions. [2025-04-13 18:24:39,540 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:24:39,540 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:39,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:39,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 18:24:39,540 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:24:39,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:39,541 INFO L85 PathProgramCache]: Analyzing trace with hash 296618020, now seen corresponding path program 16 times [2025-04-13 18:24:39,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:39,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118949655] [2025-04-13 18:24:39,541 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:24:39,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:39,546 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:24:39,556 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:24:39,556 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:24:39,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:39,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:39,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118949655] [2025-04-13 18:24:39,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118949655] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:39,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:39,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:24:39,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031599471] [2025-04-13 18:24:39,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:39,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:24:39,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:39,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:24:39,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:24:39,717 INFO L87 Difference]: Start difference. First operand 12423 states and 52906 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:41,917 INFO L93 Difference]: Finished difference Result 17239 states and 70993 transitions. [2025-04-13 18:24:41,918 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:24:41,918 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:24:41,918 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:41,994 INFO L225 Difference]: With dead ends: 17239 [2025-04-13 18:24:41,994 INFO L226 Difference]: Without dead ends: 16522 [2025-04-13 18:24:42,003 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:24:42,003 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 159 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:42,003 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 92 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:24:42,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16522 states. [2025-04-13 18:24:43,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16522 to 12609. [2025-04-13 18:24:43,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12609 states, 12608 states have (on average 4.274825507614213) internal successors, (53897), 12608 states have internal predecessors, (53897), 0 states have call successors, (0), 0 states have 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:24:43,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12609 states to 12609 states and 53897 transitions. [2025-04-13 18:24:43,274 INFO L79 Accepts]: Start accepts. Automaton has 12609 states and 53897 transitions. Word has length 36 [2025-04-13 18:24:43,274 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:43,274 INFO L485 AbstractCegarLoop]: Abstraction has 12609 states and 53897 transitions. [2025-04-13 18:24:43,274 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:43,275 INFO L278 IsEmpty]: Start isEmpty. Operand 12609 states and 53897 transitions. [2025-04-13 18:24:43,301 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:24:43,301 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:43,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:43,301 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 18:24:43,301 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:24:43,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:43,302 INFO L85 PathProgramCache]: Analyzing trace with hash -408380418, now seen corresponding path program 17 times [2025-04-13 18:24:43,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:43,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937225082] [2025-04-13 18:24:43,302 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:24:43,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:43,310 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:24:43,317 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:24:43,317 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:24:43,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:43,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:43,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937225082] [2025-04-13 18:24:43,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937225082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:43,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:43,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:24:43,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655004646] [2025-04-13 18:24:43,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:43,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:24:43,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:43,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:24:43,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:24:43,545 INFO L87 Difference]: Start difference. First operand 12609 states and 53897 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:45,858 INFO L93 Difference]: Finished difference Result 17727 states and 74749 transitions. [2025-04-13 18:24:45,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:24:45,859 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:24:45,859 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:45,942 INFO L225 Difference]: With dead ends: 17727 [2025-04-13 18:24:45,942 INFO L226 Difference]: Without dead ends: 17169 [2025-04-13 18:24:45,951 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:24:45,952 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 148 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:45,952 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 108 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:24:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17169 states. [2025-04-13 18:24:47,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17169 to 12814. [2025-04-13 18:24:47,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12814 states, 12813 states have (on average 4.301178490595489) internal successors, (55111), 12813 states have internal predecessors, (55111), 0 states have call successors, (0), 0 states have 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:24:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12814 states to 12814 states and 55111 transitions. [2025-04-13 18:24:47,249 INFO L79 Accepts]: Start accepts. Automaton has 12814 states and 55111 transitions. Word has length 36 [2025-04-13 18:24:47,250 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:47,250 INFO L485 AbstractCegarLoop]: Abstraction has 12814 states and 55111 transitions. [2025-04-13 18:24:47,250 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:47,250 INFO L278 IsEmpty]: Start isEmpty. Operand 12814 states and 55111 transitions. [2025-04-13 18:24:47,277 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:24:47,278 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:47,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:47,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 18:24:47,278 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:24:47,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:47,278 INFO L85 PathProgramCache]: Analyzing trace with hash -562179404, now seen corresponding path program 18 times [2025-04-13 18:24:47,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:47,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273445687] [2025-04-13 18:24:47,278 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:24:47,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:47,284 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:24:47,290 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:24:47,290 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:24:47,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:24:47,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:47,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273445687] [2025-04-13 18:24:47,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273445687] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:24:47,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411239868] [2025-04-13 18:24:47,447 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:24:47,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:24:47,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:24:47,449 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:24:47,452 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:24:47,520 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:24:47,548 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:24:47,549 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:24:47,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:47,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:24:47,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:24:47,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:24:47,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:24:48,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:24:48,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411239868] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:24:48,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:24:48,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 18 [2025-04-13 18:24:48,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835555931] [2025-04-13 18:24:48,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:24:48,040 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:24:48,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:48,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:24:48,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:24:48,040 INFO L87 Difference]: Start difference. First operand 12814 states and 55111 transitions. Second operand has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:58,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:58,955 INFO L93 Difference]: Finished difference Result 58495 states and 247728 transitions. [2025-04-13 18:24:58,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2025-04-13 18:24:58,955 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:24:58,955 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:59,271 INFO L225 Difference]: With dead ends: 58495 [2025-04-13 18:24:59,271 INFO L226 Difference]: Without dead ends: 56469 [2025-04-13 18:24:59,304 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7748 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3484, Invalid=16822, Unknown=0, NotChecked=0, Total=20306 [2025-04-13 18:24:59,304 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 1185 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 4089 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 4174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 4089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:59,305 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 747 Invalid, 4174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 4089 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 18:24:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56469 states. [2025-04-13 18:25:02,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56469 to 18491. [2025-04-13 18:25:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18491 states, 18490 states have (on average 4.38085451595457) internal successors, (81002), 18490 states have internal predecessors, (81002), 0 states have call successors, (0), 0 states have 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:25:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18491 states to 18491 states and 81002 transitions. [2025-04-13 18:25:02,411 INFO L79 Accepts]: Start accepts. Automaton has 18491 states and 81002 transitions. Word has length 36 [2025-04-13 18:25:02,411 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:02,411 INFO L485 AbstractCegarLoop]: Abstraction has 18491 states and 81002 transitions. [2025-04-13 18:25:02,411 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:02,411 INFO L278 IsEmpty]: Start isEmpty. Operand 18491 states and 81002 transitions. [2025-04-13 18:25:02,448 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:25:02,449 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:02,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:02,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 18:25:02,649 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-13 18:25:02,649 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:25:02,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:02,650 INFO L85 PathProgramCache]: Analyzing trace with hash 174711948, now seen corresponding path program 19 times [2025-04-13 18:25:02,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:02,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096347188] [2025-04-13 18:25:02,650 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:25:02,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:02,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:25:02,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:25:02,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:02,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:25:02,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:02,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096347188] [2025-04-13 18:25:02,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096347188] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:02,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:02,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:25:02,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502506303] [2025-04-13 18:25:02,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:02,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:25:02,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:02,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:25:02,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:25:02,851 INFO L87 Difference]: Start difference. First operand 18491 states and 81002 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:06,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:06,422 INFO L93 Difference]: Finished difference Result 20516 states and 88585 transitions. [2025-04-13 18:25:06,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:25:06,422 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:25:06,422 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:06,526 INFO L225 Difference]: With dead ends: 20516 [2025-04-13 18:25:06,527 INFO L226 Difference]: Without dead ends: 20459 [2025-04-13 18:25:06,536 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:25:06,537 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 67 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:06,537 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 59 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:25:06,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20459 states. [2025-04-13 18:25:08,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20459 to 18497. [2025-04-13 18:25:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18497 states, 18496 states have (on average 4.379919982698962) internal successors, (81011), 18496 states have internal predecessors, (81011), 0 states have call successors, (0), 0 states have 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:25:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18497 states to 18497 states and 81011 transitions. [2025-04-13 18:25:09,069 INFO L79 Accepts]: Start accepts. Automaton has 18497 states and 81011 transitions. Word has length 36 [2025-04-13 18:25:09,070 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:09,070 INFO L485 AbstractCegarLoop]: Abstraction has 18497 states and 81011 transitions. [2025-04-13 18:25:09,070 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:09,070 INFO L278 IsEmpty]: Start isEmpty. Operand 18497 states and 81011 transitions. [2025-04-13 18:25:09,103 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:25:09,103 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:09,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:09,104 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 18:25:09,104 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:25:09,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:09,104 INFO L85 PathProgramCache]: Analyzing trace with hash -86753658, now seen corresponding path program 20 times [2025-04-13 18:25:09,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:09,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493166635] [2025-04-13 18:25:09,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:25:09,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:09,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:25:09,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 36 statements. [2025-04-13 18:25:09,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:25:09,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:25:09,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:09,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493166635] [2025-04-13 18:25:09,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493166635] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:09,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:09,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:25:09,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143222171] [2025-04-13 18:25:09,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:09,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:25:09,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:09,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:25:09,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:25:09,235 INFO L87 Difference]: Start difference. First operand 18497 states and 81011 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:12,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:12,240 INFO L93 Difference]: Finished difference Result 19989 states and 86244 transitions. [2025-04-13 18:25:12,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:25:12,241 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:25:12,241 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:12,346 INFO L225 Difference]: With dead ends: 19989 [2025-04-13 18:25:12,346 INFO L226 Difference]: Without dead ends: 19733 [2025-04-13 18:25:12,355 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:25:12,356 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 134 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:12,356 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 61 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:25:12,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19733 states. [2025-04-13 18:25:14,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19733 to 18348. [2025-04-13 18:25:14,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18348 states, 18347 states have (on average 4.393361312476154) internal successors, (80605), 18347 states have internal predecessors, (80605), 0 states have call successors, (0), 0 states have 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:25:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18348 states to 18348 states and 80605 transitions. [2025-04-13 18:25:14,730 INFO L79 Accepts]: Start accepts. Automaton has 18348 states and 80605 transitions. Word has length 36 [2025-04-13 18:25:14,731 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:14,731 INFO L485 AbstractCegarLoop]: Abstraction has 18348 states and 80605 transitions. [2025-04-13 18:25:14,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:14,731 INFO L278 IsEmpty]: Start isEmpty. Operand 18348 states and 80605 transitions. [2025-04-13 18:25:14,764 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:25:14,764 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:14,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:14,764 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 18:25:14,764 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:25:14,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:14,764 INFO L85 PathProgramCache]: Analyzing trace with hash 2088012805, now seen corresponding path program 1 times [2025-04-13 18:25:14,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:14,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380077494] [2025-04-13 18:25:14,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:25:14,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:14,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:25:14,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:25:14,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:14,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:25:14,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:14,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380077494] [2025-04-13 18:25:14,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380077494] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:14,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:14,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:25:14,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716798915] [2025-04-13 18:25:14,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:14,888 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:25:14,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:14,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:25:14,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:25:14,888 INFO L87 Difference]: Start difference. First operand 18348 states and 80605 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:18,733 INFO L93 Difference]: Finished difference Result 22882 states and 97906 transitions. [2025-04-13 18:25:18,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:25:18,733 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:25:18,734 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:18,842 INFO L225 Difference]: With dead ends: 22882 [2025-04-13 18:25:18,842 INFO L226 Difference]: Without dead ends: 20572 [2025-04-13 18:25:18,850 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 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:25:18,851 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 100 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:18,852 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 82 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:25:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20572 states. [2025-04-13 18:25:21,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20572 to 18416. [2025-04-13 18:25:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18416 states, 18415 states have (on average 4.3878903068150965) internal successors, (80803), 18415 states have internal predecessors, (80803), 0 states have call successors, (0), 0 states have 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:25:21,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18416 states to 18416 states and 80803 transitions. [2025-04-13 18:25:21,238 INFO L79 Accepts]: Start accepts. Automaton has 18416 states and 80803 transitions. Word has length 36 [2025-04-13 18:25:21,238 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:21,238 INFO L485 AbstractCegarLoop]: Abstraction has 18416 states and 80803 transitions. [2025-04-13 18:25:21,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:21,238 INFO L278 IsEmpty]: Start isEmpty. Operand 18416 states and 80803 transitions. [2025-04-13 18:25:21,276 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:25:21,276 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:21,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, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:21,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 18:25:21,277 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:25:21,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:21,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1203992651, now seen corresponding path program 2 times [2025-04-13 18:25:21,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:21,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893698446] [2025-04-13 18:25:21,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:25:21,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:21,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:25:21,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:25:21,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:25:21,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:25:21,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:21,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893698446] [2025-04-13 18:25:21,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893698446] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:21,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:21,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:25:21,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723150714] [2025-04-13 18:25:21,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:21,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:25:21,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:21,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:25:21,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:25:21,406 INFO L87 Difference]: Start difference. First operand 18416 states and 80803 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:24,540 INFO L93 Difference]: Finished difference Result 20069 states and 86724 transitions. [2025-04-13 18:25:24,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:25:24,541 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:25:24,541 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:24,645 INFO L225 Difference]: With dead ends: 20069 [2025-04-13 18:25:24,645 INFO L226 Difference]: Without dead ends: 19298 [2025-04-13 18:25:24,652 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:25:24,652 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 104 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:24,653 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 69 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:25:24,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19298 states. [2025-04-13 18:25:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19298 to 18326. [2025-04-13 18:25:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18326 states, 18325 states have (on average 4.387394270122783) internal successors, (80399), 18325 states have internal predecessors, (80399), 0 states have call successors, (0), 0 states have 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:25:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18326 states to 18326 states and 80399 transitions. [2025-04-13 18:25:27,054 INFO L79 Accepts]: Start accepts. Automaton has 18326 states and 80399 transitions. Word has length 36 [2025-04-13 18:25:27,054 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:27,055 INFO L485 AbstractCegarLoop]: Abstraction has 18326 states and 80399 transitions. [2025-04-13 18:25:27,055 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:27,055 INFO L278 IsEmpty]: Start isEmpty. Operand 18326 states and 80399 transitions. [2025-04-13 18:25:27,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:25:27,089 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:27,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:27,089 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 18:25:27,089 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:25:27,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:27,090 INFO L85 PathProgramCache]: Analyzing trace with hash 787585989, now seen corresponding path program 3 times [2025-04-13 18:25:27,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:27,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136044885] [2025-04-13 18:25:27,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:25:27,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:27,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:25:27,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:25:27,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:25:27,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:25:27,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:27,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136044885] [2025-04-13 18:25:27,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136044885] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:27,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:27,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:25:27,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004149851] [2025-04-13 18:25:27,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:27,251 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:25:27,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:27,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:25:27,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:25:27,251 INFO L87 Difference]: Start difference. First operand 18326 states and 80399 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:30,662 INFO L93 Difference]: Finished difference Result 20710 states and 88890 transitions. [2025-04-13 18:25:30,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:25:30,663 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:25:30,663 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:30,767 INFO L225 Difference]: With dead ends: 20710 [2025-04-13 18:25:30,767 INFO L226 Difference]: Without dead ends: 20029 [2025-04-13 18:25:30,775 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:25:30,776 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 142 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:30,776 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 84 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:25:30,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20029 states. [2025-04-13 18:25:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20029 to 18650. [2025-04-13 18:25:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18650 states, 18649 states have (on average 4.363611989919031) internal successors, (81377), 18649 states have internal predecessors, (81377), 0 states have call successors, (0), 0 states have 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:25:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18650 states to 18650 states and 81377 transitions. [2025-04-13 18:25:33,255 INFO L79 Accepts]: Start accepts. Automaton has 18650 states and 81377 transitions. Word has length 36 [2025-04-13 18:25:33,255 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:33,255 INFO L485 AbstractCegarLoop]: Abstraction has 18650 states and 81377 transitions. [2025-04-13 18:25:33,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:33,255 INFO L278 IsEmpty]: Start isEmpty. Operand 18650 states and 81377 transitions. [2025-04-13 18:25:33,295 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:25:33,295 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:33,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:33,295 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 18:25:33,295 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:25:33,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:33,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2092461781, now seen corresponding path program 4 times [2025-04-13 18:25:33,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:33,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471640948] [2025-04-13 18:25:33,296 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:25:33,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:33,300 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:25:33,305 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:25:33,305 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:25:33,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:25:33,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:33,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471640948] [2025-04-13 18:25:33,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471640948] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:33,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722378904] [2025-04-13 18:25:33,433 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:25:33,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:33,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:33,435 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:25:33,437 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:25:33,485 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:25:33,505 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:25:33,505 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:25:33,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:33,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 18:25:33,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:25:33,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:25:33,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722378904] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:33,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:25:33,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2025-04-13 18:25:33,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623679375] [2025-04-13 18:25:33,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:33,665 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:25:33,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:33,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:25:33,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:25:33,665 INFO L87 Difference]: Start difference. First operand 18650 states and 81377 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:38,792 INFO L93 Difference]: Finished difference Result 27734 states and 116143 transitions. [2025-04-13 18:25:38,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:25:38,793 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:25:38,793 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:38,922 INFO L225 Difference]: With dead ends: 27734 [2025-04-13 18:25:38,923 INFO L226 Difference]: Without dead ends: 26150 [2025-04-13 18:25:38,935 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:25:38,935 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 219 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:38,935 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 78 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:25:38,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26150 states. [2025-04-13 18:25:42,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26150 to 21508. [2025-04-13 18:25:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21508 states, 21507 states have (on average 4.393360301297252) internal successors, (94488), 21507 states have internal predecessors, (94488), 0 states have call successors, (0), 0 states have 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:25:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21508 states to 21508 states and 94488 transitions. [2025-04-13 18:25:42,360 INFO L79 Accepts]: Start accepts. Automaton has 21508 states and 94488 transitions. Word has length 36 [2025-04-13 18:25:42,360 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:42,360 INFO L485 AbstractCegarLoop]: Abstraction has 21508 states and 94488 transitions. [2025-04-13 18:25:42,360 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:42,360 INFO L278 IsEmpty]: Start isEmpty. Operand 21508 states and 94488 transitions. [2025-04-13 18:25:42,402 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:25:42,402 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:42,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:42,409 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:25:42,603 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,SelfDestructingSolverStorable28 [2025-04-13 18:25:42,603 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:25:42,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:42,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1124452475, now seen corresponding path program 5 times [2025-04-13 18:25:42,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:42,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021016064] [2025-04-13 18:25:42,603 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:25:42,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:42,608 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:25:42,614 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:25:42,614 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:25:42,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:25:42,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:42,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021016064] [2025-04-13 18:25:42,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021016064] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:42,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032513718] [2025-04-13 18:25:42,711 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:25:42,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:42,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:42,713 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:25:42,714 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:25:42,764 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:25:42,785 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:25:42,785 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:25:42,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:42,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:25:42,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:25:42,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:25:43,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:25:43,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032513718] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:43,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:25:43,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5] total 15 [2025-04-13 18:25:43,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388018888] [2025-04-13 18:25:43,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:43,026 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:25:43,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:43,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:25:43,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:25:43,027 INFO L87 Difference]: Start difference. First operand 21508 states and 94488 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:49,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:49,930 INFO L93 Difference]: Finished difference Result 28206 states and 119722 transitions. [2025-04-13 18:25:49,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:25:49,930 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:25:49,930 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:50,070 INFO L225 Difference]: With dead ends: 28206 [2025-04-13 18:25:50,071 INFO L226 Difference]: Without dead ends: 25995 [2025-04-13 18:25:50,083 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:25:50,084 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 530 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:50,084 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 86 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:25:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25995 states. [2025-04-13 18:25:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25995 to 21579. [2025-04-13 18:25:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21579 states, 21578 states have (on average 4.431921401427379) internal successors, (95632), 21578 states have internal predecessors, (95632), 0 states have call successors, (0), 0 states have 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:25:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21579 states to 21579 states and 95632 transitions. [2025-04-13 18:25:53,840 INFO L79 Accepts]: Start accepts. Automaton has 21579 states and 95632 transitions. Word has length 36 [2025-04-13 18:25:53,841 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:53,841 INFO L485 AbstractCegarLoop]: Abstraction has 21579 states and 95632 transitions. [2025-04-13 18:25:53,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:53,841 INFO L278 IsEmpty]: Start isEmpty. Operand 21579 states and 95632 transitions. [2025-04-13 18:25:53,889 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:25:53,889 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:53,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:53,896 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:25:54,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:54,090 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:25:54,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:54,090 INFO L85 PathProgramCache]: Analyzing trace with hash 955288551, now seen corresponding path program 6 times [2025-04-13 18:25:54,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:54,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990866495] [2025-04-13 18:25:54,091 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:25:54,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:54,096 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:25:54,101 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:25:54,101 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:25:54,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:25:54,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:54,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990866495] [2025-04-13 18:25:54,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990866495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:54,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:54,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:25:54,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19032331] [2025-04-13 18:25:54,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:54,231 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:25:54,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:54,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:25:54,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:25:54,232 INFO L87 Difference]: Start difference. First operand 21579 states and 95632 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:26:00,111 INFO L93 Difference]: Finished difference Result 27438 states and 117532 transitions. [2025-04-13 18:26:00,112 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:26:00,112 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:26:00,112 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:26:00,250 INFO L225 Difference]: With dead ends: 27438 [2025-04-13 18:26:00,250 INFO L226 Difference]: Without dead ends: 25085 [2025-04-13 18:26:00,261 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:26:00,261 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 134 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:26:00,261 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 65 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:26:00,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25085 states. [2025-04-13 18:26:03,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25085 to 22853. [2025-04-13 18:26:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22853 states, 22852 states have (on average 4.401321547348154) internal successors, (100579), 22852 states have internal predecessors, (100579), 0 states have call successors, (0), 0 states have 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:26:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22853 states to 22853 states and 100579 transitions. [2025-04-13 18:26:04,140 INFO L79 Accepts]: Start accepts. Automaton has 22853 states and 100579 transitions. Word has length 36 [2025-04-13 18:26:04,141 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:26:04,141 INFO L485 AbstractCegarLoop]: Abstraction has 22853 states and 100579 transitions. [2025-04-13 18:26:04,141 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:04,141 INFO L278 IsEmpty]: Start isEmpty. Operand 22853 states and 100579 transitions. [2025-04-13 18:26:04,186 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:26:04,186 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:26:04,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:26:04,186 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 18:26:04,187 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:26:04,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:26:04,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1039388807, now seen corresponding path program 7 times [2025-04-13 18:26:04,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:26:04,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621900779] [2025-04-13 18:26:04,187 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:26:04,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:26:04,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:26:04,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:26:04,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:26:04,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:26:04,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:26:04,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621900779] [2025-04-13 18:26:04,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621900779] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:26:04,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:26:04,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:26:04,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914616822] [2025-04-13 18:26:04,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:26:04,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:26:04,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:26:04,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:26:04,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:26:04,311 INFO L87 Difference]: Start difference. First operand 22853 states and 100579 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:09,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:26:09,552 INFO L93 Difference]: Finished difference Result 24288 states and 105596 transitions. [2025-04-13 18:26:09,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:26:09,552 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:26:09,552 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:26:09,659 INFO L225 Difference]: With dead ends: 24288 [2025-04-13 18:26:09,659 INFO L226 Difference]: Without dead ends: 23233 [2025-04-13 18:26:09,667 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:26:09,667 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 79 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:26:09,667 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 75 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:26:09,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23233 states. [2025-04-13 18:26:13,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23233 to 22709. [2025-04-13 18:26:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22709 states, 22708 states have (on average 4.4022811344019726) internal successors, (99967), 22708 states have internal predecessors, (99967), 0 states have call successors, (0), 0 states have 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:26:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 99967 transitions. [2025-04-13 18:26:13,592 INFO L79 Accepts]: Start accepts. Automaton has 22709 states and 99967 transitions. Word has length 36 [2025-04-13 18:26:13,592 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:26:13,592 INFO L485 AbstractCegarLoop]: Abstraction has 22709 states and 99967 transitions. [2025-04-13 18:26:13,593 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:13,593 INFO L278 IsEmpty]: Start isEmpty. Operand 22709 states and 99967 transitions. [2025-04-13 18:26:13,637 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:26:13,637 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:26:13,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, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:26:13,637 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 18:26:13,637 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:26:13,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:26:13,637 INFO L85 PathProgramCache]: Analyzing trace with hash -956749913, now seen corresponding path program 8 times [2025-04-13 18:26:13,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:26:13,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723452682] [2025-04-13 18:26:13,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:26:13,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:26:13,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:26:13,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:26:13,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:26:13,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:26:13,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:26:13,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723452682] [2025-04-13 18:26:13,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723452682] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:26:13,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238216985] [2025-04-13 18:26:13,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:26:13,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:26:13,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:26:13,946 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:26:13,947 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:26:13,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:26:14,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:26:14,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:26:14,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:14,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 18:26:14,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:26:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:26:14,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:26:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:26:14,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238216985] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:26:14,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:26:14,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 11] total 21 [2025-04-13 18:26:14,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405175491] [2025-04-13 18:26:14,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:26:14,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 18:26:14,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:26:14,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 18:26:14,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:26:14,505 INFO L87 Difference]: Start difference. First operand 22709 states and 99967 transitions. Second operand has 22 states, 22 states have (on average 4.136363636363637) internal successors, (91), 21 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:26:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:26:53,267 INFO L93 Difference]: Finished difference Result 108364 states and 471694 transitions. [2025-04-13 18:26:53,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 363 states. [2025-04-13 18:26:53,267 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.136363636363637) internal successors, (91), 21 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:26:53,267 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:26:53,831 INFO L225 Difference]: With dead ends: 108364 [2025-04-13 18:26:53,831 INFO L226 Difference]: Without dead ends: 96946 [2025-04-13 18:26:53,891 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63051 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=16880, Invalid=121132, Unknown=0, NotChecked=0, Total=138012 [2025-04-13 18:26:53,891 INFO L437 NwaCegarLoop]: 83 mSDtfsCounter, 1714 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 9516 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 9657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 9516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:26:53,891 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 1319 Invalid, 9657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 9516 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-04-13 18:26:54,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96946 states. [2025-04-13 18:27:02,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96946 to 36815. [2025-04-13 18:27:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36815 states, 36814 states have (on average 4.43086869125876) internal successors, (163118), 36814 states have internal predecessors, (163118), 0 states have call successors, (0), 0 states have 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:27:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36815 states to 36815 states and 163118 transitions. [2025-04-13 18:27:02,520 INFO L79 Accepts]: Start accepts. Automaton has 36815 states and 163118 transitions. Word has length 36 [2025-04-13 18:27:02,520 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:27:02,520 INFO L485 AbstractCegarLoop]: Abstraction has 36815 states and 163118 transitions. [2025-04-13 18:27:02,521 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.136363636363637) internal successors, (91), 21 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:27:02,521 INFO L278 IsEmpty]: Start isEmpty. Operand 36815 states and 163118 transitions. [2025-04-13 18:27:02,612 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:27:02,613 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:27:02,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:27:02,622 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:27:02,813 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:27:02,813 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:27:02,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:27:02,814 INFO L85 PathProgramCache]: Analyzing trace with hash 391051643, now seen corresponding path program 9 times [2025-04-13 18:27:02,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:27:02,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891174487] [2025-04-13 18:27:02,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:27:02,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:27:02,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:27:02,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:27:02,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:27:02,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:02,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:27:02,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:27:02,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891174487] [2025-04-13 18:27:02,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891174487] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:27:02,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:27:02,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:27:02,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196732963] [2025-04-13 18:27:02,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:27:02,965 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:27:02,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:27:02,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:27:02,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:27:02,965 INFO L87 Difference]: Start difference. First operand 36815 states and 163118 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:27:12,258 INFO L93 Difference]: Finished difference Result 38579 states and 169396 transitions. [2025-04-13 18:27:12,259 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:27:12,259 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:27:12,259 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:27:12,563 INFO L225 Difference]: With dead ends: 38579 [2025-04-13 18:27:12,563 INFO L226 Difference]: Without dead ends: 35242 [2025-04-13 18:27:12,578 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:27:12,580 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 92 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:27:12,581 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 64 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:27:12,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35242 states. [2025-04-13 18:27:19,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35242 to 33744. [2025-04-13 18:27:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33744 states, 33743 states have (on average 4.483478054707643) internal successors, (151286), 33743 states have internal predecessors, (151286), 0 states have call successors, (0), 0 states have 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:27:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33744 states to 33744 states and 151286 transitions. [2025-04-13 18:27:20,229 INFO L79 Accepts]: Start accepts. Automaton has 33744 states and 151286 transitions. Word has length 36 [2025-04-13 18:27:20,229 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:27:20,229 INFO L485 AbstractCegarLoop]: Abstraction has 33744 states and 151286 transitions. [2025-04-13 18:27:20,230 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:20,230 INFO L278 IsEmpty]: Start isEmpty. Operand 33744 states and 151286 transitions. [2025-04-13 18:27:20,313 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:27:20,314 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:27:20,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:27:20,314 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 18:27:20,314 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:27:20,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:27:20,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1411009285, now seen corresponding path program 10 times [2025-04-13 18:27:20,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:27:20,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112045302] [2025-04-13 18:27:20,315 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:27:20,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:27:20,320 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:27:20,326 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:27:20,326 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:27:20,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:27:20,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:27:20,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112045302] [2025-04-13 18:27:20,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112045302] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:27:20,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658330719] [2025-04-13 18:27:20,429 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:27:20,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:27:20,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:27:20,432 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:27:20,435 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:27:20,490 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:27:20,515 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:27:20,516 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:27:20,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:20,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 18:27:20,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:27:20,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:27:20,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:27:20,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658330719] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:27:20,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:27:20,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2025-04-13 18:27:20,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977272064] [2025-04-13 18:27:20,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:27:20,687 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:27:20,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:27:20,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:27:20,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:27:20,687 INFO L87 Difference]: Start difference. First operand 33744 states and 151286 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:30,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:27:30,199 INFO L93 Difference]: Finished difference Result 36691 states and 162848 transitions. [2025-04-13 18:27:30,199 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:27:30,199 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:27:30,199 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:27:30,409 INFO L225 Difference]: With dead ends: 36691 [2025-04-13 18:27:30,410 INFO L226 Difference]: Without dead ends: 35593 [2025-04-13 18:27:30,423 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:27:30,423 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 149 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:27:30,423 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 162 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:27:30,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35593 states. [2025-04-13 18:27:38,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35593 to 33612. [2025-04-13 18:27:38,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33612 states, 33611 states have (on average 4.452054386956651) internal successors, (149638), 33611 states have internal predecessors, (149638), 0 states have call successors, (0), 0 states have 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:27:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33612 states to 33612 states and 149638 transitions. [2025-04-13 18:27:38,241 INFO L79 Accepts]: Start accepts. Automaton has 33612 states and 149638 transitions. Word has length 36 [2025-04-13 18:27:38,241 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:27:38,241 INFO L485 AbstractCegarLoop]: Abstraction has 33612 states and 149638 transitions. [2025-04-13 18:27:38,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:38,242 INFO L278 IsEmpty]: Start isEmpty. Operand 33612 states and 149638 transitions. [2025-04-13 18:27:38,319 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:27:38,320 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:27:38,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:27:38,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 18:27:38,520 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,SelfDestructingSolverStorable34 [2025-04-13 18:27:38,520 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:27:38,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:27:38,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1932987497, now seen corresponding path program 11 times [2025-04-13 18:27:38,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:27:38,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633279856] [2025-04-13 18:27:38,521 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:27:38,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:27:38,528 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:27:38,535 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:27:38,536 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:27:38,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:27:38,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:27:38,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633279856] [2025-04-13 18:27:38,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633279856] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:27:38,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:27:38,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:27:38,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119744244] [2025-04-13 18:27:38,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:27:38,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:27:38,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:27:38,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:27:38,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:27:38,669 INFO L87 Difference]: Start difference. First operand 33612 states and 149638 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:50,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:27:50,548 INFO L93 Difference]: Finished difference Result 43808 states and 194924 transitions. [2025-04-13 18:27:50,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:27:50,548 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:27:50,548 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:27:50,814 INFO L225 Difference]: With dead ends: 43808 [2025-04-13 18:27:50,814 INFO L226 Difference]: Without dead ends: 38098 [2025-04-13 18:27:50,835 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:27:50,836 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 127 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:27:50,836 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 90 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:27:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38098 states. [2025-04-13 18:27:56,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38098 to 27312. [2025-04-13 18:27:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27312 states, 27311 states have (on average 4.451686133792245) internal successors, (121580), 27311 states have internal predecessors, (121580), 0 states have call successors, (0), 0 states have 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:27:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27312 states to 27312 states and 121580 transitions. [2025-04-13 18:27:56,731 INFO L79 Accepts]: Start accepts. Automaton has 27312 states and 121580 transitions. Word has length 36 [2025-04-13 18:27:56,731 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:27:56,731 INFO L485 AbstractCegarLoop]: Abstraction has 27312 states and 121580 transitions. [2025-04-13 18:27:56,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:56,731 INFO L278 IsEmpty]: Start isEmpty. Operand 27312 states and 121580 transitions. [2025-04-13 18:27:56,797 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 18:27:56,798 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:27:56,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:27:56,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 18:27:56,798 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:27:56,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:27:56,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1148059082, now seen corresponding path program 1 times [2025-04-13 18:27:56,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:27:56,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880642854] [2025-04-13 18:27:56,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:27:56,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:27:56,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 18:27:56,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 18:27:56,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:27:56,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:27:56,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:27:56,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880642854] [2025-04-13 18:27:56,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880642854] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:27:56,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923520242] [2025-04-13 18:27:56,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:27:56,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:27:56,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:27:56,885 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 18:27:56,886 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 18:27:56,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 18:27:56,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 18:27:56,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:27:56,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:56,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 18:27:56,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:27:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:27:57,083 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:27:57,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923520242] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:27:57,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:27:57,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-04-13 18:27:57,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197840613] [2025-04-13 18:27:57,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:27:57,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:27:57,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:27:57,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:27:57,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:27:57,084 INFO L87 Difference]: Start difference. First operand 27312 states and 121580 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:28:10,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:10,498 INFO L93 Difference]: Finished difference Result 48592 states and 219157 transitions. [2025-04-13 18:28:10,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:28:10,499 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-04-13 18:28:10,499 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:10,854 INFO L225 Difference]: With dead ends: 48592 [2025-04-13 18:28:10,854 INFO L226 Difference]: Without dead ends: 47454 [2025-04-13 18:28:10,873 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:28:10,874 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 199 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:10,874 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 291 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:28:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47454 states. [2025-04-13 18:28:16,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47454 to 21674. [2025-04-13 18:28:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21674 states, 21673 states have (on average 4.407973054030361) internal successors, (95534), 21673 states have internal predecessors, (95534), 0 states have call successors, (0), 0 states have 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:28:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21674 states to 21674 states and 95534 transitions. [2025-04-13 18:28:16,471 INFO L79 Accepts]: Start accepts. Automaton has 21674 states and 95534 transitions. Word has length 41 [2025-04-13 18:28:16,472 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:16,472 INFO L485 AbstractCegarLoop]: Abstraction has 21674 states and 95534 transitions. [2025-04-13 18:28:16,472 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:28:16,472 INFO L278 IsEmpty]: Start isEmpty. Operand 21674 states and 95534 transitions. [2025-04-13 18:28:16,513 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 18:28:16,513 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:16,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:16,519 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 18:28:16,714 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 18:28:16,714 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:28:16,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:16,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1704550264, now seen corresponding path program 2 times [2025-04-13 18:28:16,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:16,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631088005] [2025-04-13 18:28:16,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:28:16,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:16,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 18:28:16,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 18:28:16,756 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:28:16,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 18:28:16,756 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 18:28:16,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 18:28:16,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 18:28:16,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:28:16,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 18:28:16,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 18:28:16,824 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 18:28:16,829 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 18:28:16,836 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 18:28:16,836 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 18:28:16,836 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 18:28:16,836 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 18:28:16,837 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 18:28:16,847 INFO L422 BasicCegarLoop]: Path program histogram: [20, 11, 2, 1, 1, 1, 1, 1] [2025-04-13 18:28:16,999 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:28:16,999 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:28:17,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:28:17 BasicIcfg [2025-04-13 18:28:17,002 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:28:17,002 INFO L158 Benchmark]: Toolchain (without parser) took 269073.00ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 100.2MB in the beginning and 685.5MB in the end (delta: -585.2MB). Peak memory consumption was 612.9MB. Max. memory is 8.0GB. [2025-04-13 18:28:17,002 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 84.4MB in the end (delta: 95.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:28:17,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.46ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 84.2MB in the end (delta: 16.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 18:28:17,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.77ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 81.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:28:17,003 INFO L158 Benchmark]: Boogie Preprocessor took 39.38ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 78.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:28:17,003 INFO L158 Benchmark]: RCFGBuilder took 777.56ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 48.7MB in the end (delta: 30.2MB). Peak memory consumption was 61.4MB. Max. memory is 8.0GB. [2025-04-13 18:28:17,003 INFO L158 Benchmark]: TraceAbstraction took 267909.09ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 48.1MB in the beginning and 685.5MB in the end (delta: -637.4MB). Peak memory consumption was 564.2MB. Max. memory is 8.0GB. [2025-04-13 18:28:17,003 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.22ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 84.4MB in the end (delta: 95.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 296.46ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 84.2MB in the end (delta: 16.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.77ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 81.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.38ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 78.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 777.56ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 48.7MB in the end (delta: 30.2MB). Peak memory consumption was 61.4MB. Max. memory is 8.0GB. * TraceAbstraction took 267909.09ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 48.1MB in the beginning and 685.5MB in the end (delta: -637.4MB). Peak memory consumption was 564.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 152]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int *q1, *q2; [L42] 0 int q1_front, q1_back, q2_front, q2_back, i, j, n1, n2, N, C, total; [L126] 0 pthread_t t1, t2, t3, t4; [L128] 0 C = __VERIFIER_nondet_int() [L129] 0 N = __VERIFIER_nondet_int() [L130] 0 n1 = __VERIFIER_nondet_int() [L131] 0 n2 = __VERIFIER_nondet_int() [L132] 0 q1_front = __VERIFIER_nondet_int() [L133] 0 q1_back = q1_front [L134] 0 q2_front = __VERIFIER_nondet_int() [L135] 0 q2_back = q2_front [L136] CALL, EXPR 0 create_fresh_int_array(n1) [L158] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L158] RET 0 assume_abort_if_not(size >= 0) [L159] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L159] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L161] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L162] 0 int i = 0; VAL [C=-5, N=1, \at(size, Pre)=1, arr={-3:0}, i=0, i=0, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L162] COND TRUE 0 i < size [L163] 0 arr[i] = __VERIFIER_nondet_int() [L162] 0 i++ VAL [C=-5, N=1, \at(size, Pre)=1, arr={-3:0}, i=0, i=1, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L162] COND FALSE 0 !(i < size) [L165] 0 return arr; [L136] RET, EXPR 0 create_fresh_int_array(n1) [L136] 0 q1 = create_fresh_int_array(n1) [L137] CALL, EXPR 0 create_fresh_int_array(n2) [L158] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L158] RET 0 assume_abort_if_not(size >= 0) [L159] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L159] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L161] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L162] 0 int i = 0; VAL [C=-5, N=1, \at(size, Pre)=1, arr={-4:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-3:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L162] COND TRUE 0 i < size [L163] 0 arr[i] = __VERIFIER_nondet_int() [L162] 0 i++ VAL [C=-5, N=1, \at(size, Pre)=1, arr={-4:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L162] COND FALSE 0 !(i < size) [L165] 0 return arr; [L137] RET, EXPR 0 create_fresh_int_array(n2) [L137] 0 q2 = create_fresh_int_array(n2) [L139] CALL 0 assume_abort_if_not(C > -2147483648 && N >= 0) [L38] COND FALSE 0 !(!cond) [L139] RET 0 assume_abort_if_not(C > -2147483648 && N >= 0) [L142] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [C=-5, N=1, i=0, j=0, n1=1, n2=1, q1={-3:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, total=0] [L49] 1 _Bool cond = i < N; VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, i=0, j=0, n1=1, n2=1, q1={-3:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L143] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [C=-5, N=1, i=0, j=0, n1=1, n2=1, q1={-3:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, total=0] [L144] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [C=-5, N=1, i=0, j=0, n1=1, n2=1, q1={-3:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, total=0] [L91] 3 _Bool cond = i < N || q1_front < q1_back; VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, i=0, j=0, n1=1, n2=1, q1={-3:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L93] COND TRUE 3 \read(cond) VAL [C=-5, N=1, i=0, j=0, n1=1, n2=1, q1={-3:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [C=-5, N=1, i=0, j=0, n1=1, n2=1, q1={-3:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L38] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L54] EXPR 1 q1[q1_back] [L54] CALL 1 assume_abort_if_not(q1[q1_back] == C) [L38] COND FALSE 1 !(!cond) [L54] RET 1 assume_abort_if_not(q1[q1_back] == C) [L55] 1 i++ VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L58] 1 q1_back++ VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L95] CALL 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L38] COND FALSE 3 !(!cond) [L95] RET 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L96] EXPR 3 q1[q1_front] [L96] CALL, EXPR 3 plus(total, q1[q1_front]) [L169] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L38] COND FALSE 3 !(!cond) [L169] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L170] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 3 !(!cond) [L170] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L171] 3 return a + b; [L96] RET, EXPR 3 plus(total, q1[q1_front]) [L96] 3 total = plus(total, q1[q1_front]) [L97] 3 q1_front++ VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=0, q2_front=0, total=-5] [L100] 3 cond = i < N || q1_front < q1_back VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=0, q2_front=0, total=-5] [L93] COND FALSE 3 !(\read(cond)) [L104] 3 return 0; [L61] 1 cond = i < N VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=0, q2_front=0, total=-5] [L51] COND FALSE 1 !(\read(cond)) [L65] 1 return 0; [L70] 2 _Bool cond = j < N; VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=0, q2_front=0, total=-5] [L72] COND TRUE 2 \read(cond) VAL [C=-5, N=1, i=1, j=0, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=0, q2_front=0, total=-5] [L74] CALL 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L38] COND FALSE 2 !(!cond) [L74] RET 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L75] EXPR 2 q2[q2_back] [L75] CALL 2 assume_abort_if_not(q2[q2_back] == -C) [L38] COND FALSE 2 !(!cond) [L75] RET 2 assume_abort_if_not(q2[q2_back] == -C) [L76] 2 j++ VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, i=1, j=1, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=0, q2_front=0, total=-5] [L145] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [C=-5, N=1, i=1, j=1, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=-5] [L146] FCALL, JOIN 1 pthread_join(t1, 0) VAL [C=-5, N=1, i=1, j=1, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=0, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=-5] [L109] 4 _Bool cond = j < N || q2_front < q2_back; VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, i=1, j=1, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=0, q2_front=0, total=-5] [L79] 2 q2_back++ VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, i=1, j=1, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, total=-5] [L82] 2 cond = j < N VAL [C=-5, N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, i=1, j=1, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, total=-5] [L111] COND FALSE 4 !(\read(cond)) [L122] 4 return 0; [L72] COND FALSE 2 !(\read(cond)) [L86] 2 return 0; [L147] FCALL, JOIN 2 pthread_join(t2, 0) VAL [C=-5, N=1, i=1, j=1, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=-5] [L148] FCALL, JOIN 3 pthread_join(t3, 0) VAL [C=-5, N=1, i=1, j=1, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=-5] [L149] FCALL, JOIN 4 pthread_join(t4, 0) VAL [C=-5, N=1, i=1, j=1, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=-5] [L151] CALL 0 assume_abort_if_not(total != 0) [L38] COND FALSE 0 !(!cond) [L151] RET 0 assume_abort_if_not(total != 0) [L152] 0 reach_error() VAL [C=-5, N=1, i=1, j=1, n1=1, n2=1, q1={-3:0}, q1_back=1, q1_front=1, q2={-4:0}, q2_back=1, q2_front=0, t1=-2, t2=-1, t3=0, t4=1, total=-5] - UnprovableResult [Line: 142]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 144]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 143]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 74 locations, 83 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 267.7s, OverallIterations: 38, TraceHistogramMax: 1, PathProgramHistogramMax: 20, EmptinessCheckTime: 1.4s, AutomataDifference: 169.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7198 SdHoareTripleChecker+Valid, 14.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7198 mSDsluCounter, 5082 SdHoareTripleChecker+Invalid, 11.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4012 mSDsCounter, 354 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24795 IncrementalHoareTripleChecker+Invalid, 25149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 354 mSolverCounterUnsat, 1070 mSDtfsCounter, 24795 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1148 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 813 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71190 ImplicationChecksByTransitivity, 15.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36815occurred in iteration=33, InterpolantAutomatonStates: 806, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 84.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 223726 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 1579 NumberOfCodeBlocks, 1561 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 1600 ConstructedInterpolants, 0 QuantifiedInterpolants, 12908 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1698 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 46 InterpolantComputations, 35 PerfectInterpolantSequences, 80/92 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 18:28:17,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...