/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:41:27,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:41:27,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 22:41:27,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:41:27,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:41:27,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:41:27,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:41:27,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:41:27,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:41:27,300 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:41:27,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:41:27,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:41:27,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:41:27,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:41:27,302 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:41:27,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:41:27,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:41:27,302 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:41:27,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:41:27,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:41:27,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:41:27,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:41:27,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:41:27,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:41:27,302 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:41:27,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:41:27,302 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:41:27,302 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:41:27,302 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:41:27,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:41:27,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:41:27,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:41:27,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:41:27,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:41:27,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:41:27,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:41:27,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:41:27,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:41:27,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:41:27,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:41:27,303 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:41:27,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:41:27,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:41:27,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:41:27,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:41:27,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:41:27,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:41:27,303 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 22:41:27,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:41:27,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:41:27,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:41:27,506 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:41:27,506 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:41:27,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2025-04-13 22:41:28,873 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100846d6d/e5d8686b5756433b8a94eca667c8d1be/FLAGbaccb13a9 [2025-04-13 22:41:29,090 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:41:29,091 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2025-04-13 22:41:29,099 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100846d6d/e5d8686b5756433b8a94eca667c8d1be/FLAGbaccb13a9 [2025-04-13 22:41:30,074 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100846d6d/e5d8686b5756433b8a94eca667c8d1be [2025-04-13 22:41:30,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:41:30,077 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:41:30,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:41:30,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:41:30,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:41:30,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:41:30" (1/1) ... [2025-04-13 22:41:30,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae73af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:41:30, skipping insertion in model container [2025-04-13 22:41:30,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:41:30" (1/1) ... [2025-04-13 22:41:30,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:41:30,282 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-bad-commit-1.wvr-bad.c[5161,5174] [2025-04-13 22:41:30,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:41:30,300 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:41:30,337 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-bad-commit-1.wvr-bad.c[5161,5174] [2025-04-13 22:41:30,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:41:30,348 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:41:30,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:41:30 WrapperNode [2025-04-13 22:41:30,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:41:30,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:41:30,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:41:30,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:41:30,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:41:30" (1/1) ... [2025-04-13 22:41:30,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:41:30" (1/1) ... [2025-04-13 22:41:30,383 INFO L138 Inliner]: procedures = 24, calls = 53, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 325 [2025-04-13 22:41:30,383 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:41:30,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:41:30,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:41:30,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:41:30,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:41:30" (1/1) ... [2025-04-13 22:41:30,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:41:30" (1/1) ... [2025-04-13 22:41:30,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:41:30" (1/1) ... [2025-04-13 22:41:30,402 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-13 22:41:30,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:41:30" (1/1) ... [2025-04-13 22:41:30,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:41:30" (1/1) ... [2025-04-13 22:41:30,408 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:41:30" (1/1) ... [2025-04-13 22:41:30,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:41:30" (1/1) ... [2025-04-13 22:41:30,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:41:30" (1/1) ... [2025-04-13 22:41:30,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:41:30" (1/1) ... [2025-04-13 22:41:30,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:41:30,418 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:41:30,418 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:41:30,418 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:41:30,419 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:41:30" (1/1) ... [2025-04-13 22:41:30,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:41:30,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:41:30,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 22:41:30,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 22:41:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:41:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:41:30,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:41:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:41:30,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:41:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:41:30,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:41:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:41:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:41:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:41:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:41:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 22:41:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 22:41:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:41:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:41:30,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:41:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:41:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:41:30,469 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 22:41:30,562 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:41:30,564 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:41:30,957 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:41:30,958 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:41:30,958 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:41:31,328 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:41:31,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:41:31 BoogieIcfgContainer [2025-04-13 22:41:31,328 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:41:31,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:41:31,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:41:31,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:41:31,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:41:30" (1/3) ... [2025-04-13 22:41:31,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf204e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:41:31, skipping insertion in model container [2025-04-13 22:41:31,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:41:30" (2/3) ... [2025-04-13 22:41:31,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf204e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:41:31, skipping insertion in model container [2025-04-13 22:41:31,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:41:31" (3/3) ... [2025-04-13 22:41:31,335 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2025-04-13 22:41:31,346 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:41:31,347 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-1.wvr-bad.c that has 4 procedures, 30 locations, 40 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 22:41:31,347 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:41:31,411 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 22:41:31,433 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 43 transitions, 107 flow [2025-04-13 22:41:31,475 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 279 states, 278 states have (on average 4.705035971223022) internal successors, (1308), 278 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:31,494 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:41:31,504 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;@5d8dd7b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:41:31,504 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 22:41:31,507 INFO L278 IsEmpty]: Start isEmpty. Operand has 279 states, 278 states have (on average 4.705035971223022) internal successors, (1308), 278 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:31,516 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 22:41:31,516 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:31,517 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:31,517 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 1 more)] === [2025-04-13 22:41:31,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:31,522 INFO L85 PathProgramCache]: Analyzing trace with hash 48017834, now seen corresponding path program 1 times [2025-04-13 22:41:31,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:31,527 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826317478] [2025-04-13 22:41:31,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:31,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:31,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 22:41:31,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 22:41:31,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:31,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:41:31,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:31,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826317478] [2025-04-13 22:41:31,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826317478] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:41:31,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:41:31,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 22:41:31,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019329570] [2025-04-13 22:41:31,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:41:31,861 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:41:31,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:31,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:41:31,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:31,877 INFO L87 Difference]: Start difference. First operand has 279 states, 278 states have (on average 4.705035971223022) internal successors, (1308), 278 states have internal predecessors, (1308), 0 states have call successors, (0), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:32,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:32,034 INFO L93 Difference]: Finished difference Result 553 states and 2608 transitions. [2025-04-13 22:41:32,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:41:32,036 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-04-13 22:41:32,037 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:32,054 INFO L225 Difference]: With dead ends: 553 [2025-04-13 22:41:32,054 INFO L226 Difference]: Without dead ends: 547 [2025-04-13 22:41:32,057 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:32,059 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:32,059 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-04-13 22:41:32,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 391. [2025-04-13 22:41:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 390 states have (on average 4.869230769230769) internal successors, (1899), 390 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1899 transitions. [2025-04-13 22:41:32,136 INFO L79 Accepts]: Start accepts. Automaton has 391 states and 1899 transitions. Word has length 17 [2025-04-13 22:41:32,136 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:32,136 INFO L485 AbstractCegarLoop]: Abstraction has 391 states and 1899 transitions. [2025-04-13 22:41:32,137 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:32,137 INFO L278 IsEmpty]: Start isEmpty. Operand 391 states and 1899 transitions. [2025-04-13 22:41:32,143 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:41:32,143 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:32,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:32,145 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:41:32,145 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 1 more)] === [2025-04-13 22:41:32,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1615492976, now seen corresponding path program 1 times [2025-04-13 22:41:32,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:32,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797893847] [2025-04-13 22:41:32,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:32,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:32,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 22:41:32,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:41:32,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:32,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:32,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:41:32,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:32,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797893847] [2025-04-13 22:41:32,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797893847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:41:32,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:41:32,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:41:32,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164033499] [2025-04-13 22:41:32,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:41:32,287 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:41:32,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:32,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:41:32,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:32,287 INFO L87 Difference]: Start difference. First operand 391 states and 1899 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:32,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:32,407 INFO L93 Difference]: Finished difference Result 1023 states and 5010 transitions. [2025-04-13 22:41:32,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:41:32,408 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-04-13 22:41:32,408 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:32,417 INFO L225 Difference]: With dead ends: 1023 [2025-04-13 22:41:32,417 INFO L226 Difference]: Without dead ends: 739 [2025-04-13 22:41:32,420 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:32,420 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:32,420 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:32,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-04-13 22:41:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 645. [2025-04-13 22:41:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 5.051242236024844) internal successors, (3253), 644 states have internal predecessors, (3253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 3253 transitions. [2025-04-13 22:41:32,463 INFO L79 Accepts]: Start accepts. Automaton has 645 states and 3253 transitions. Word has length 19 [2025-04-13 22:41:32,464 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:32,464 INFO L485 AbstractCegarLoop]: Abstraction has 645 states and 3253 transitions. [2025-04-13 22:41:32,464 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:32,464 INFO L278 IsEmpty]: Start isEmpty. Operand 645 states and 3253 transitions. [2025-04-13 22:41:32,467 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:41:32,467 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:32,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:32,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:41:32,467 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 1 more)] === [2025-04-13 22:41:32,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:32,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1116934938, now seen corresponding path program 1 times [2025-04-13 22:41:32,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:32,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136693149] [2025-04-13 22:41:32,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:32,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:32,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 22:41:32,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:41:32,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:32,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:41:32,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:32,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136693149] [2025-04-13 22:41:32,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136693149] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:41:32,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:41:32,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:41:32,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610178905] [2025-04-13 22:41:32,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:41:32,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:41:32,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:32,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:41:32,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:32,544 INFO L87 Difference]: Start difference. First operand 645 states and 3253 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:32,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:32,678 INFO L93 Difference]: Finished difference Result 1263 states and 6620 transitions. [2025-04-13 22:41:32,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:41:32,678 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-04-13 22:41:32,678 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:32,687 INFO L225 Difference]: With dead ends: 1263 [2025-04-13 22:41:32,687 INFO L226 Difference]: Without dead ends: 765 [2025-04-13 22:41:32,689 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:32,690 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:32,690 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2025-04-13 22:41:32,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 686. [2025-04-13 22:41:32,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 4.973722627737226) internal successors, (3407), 685 states have internal predecessors, (3407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 3407 transitions. [2025-04-13 22:41:32,733 INFO L79 Accepts]: Start accepts. Automaton has 686 states and 3407 transitions. Word has length 19 [2025-04-13 22:41:32,733 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:32,733 INFO L485 AbstractCegarLoop]: Abstraction has 686 states and 3407 transitions. [2025-04-13 22:41:32,733 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:32,733 INFO L278 IsEmpty]: Start isEmpty. Operand 686 states and 3407 transitions. [2025-04-13 22:41:32,736 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:41:32,736 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:32,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:32,736 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:41:32,736 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 1 more)] === [2025-04-13 22:41:32,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:32,738 INFO L85 PathProgramCache]: Analyzing trace with hash -391861044, now seen corresponding path program 1 times [2025-04-13 22:41:32,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:32,738 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172533314] [2025-04-13 22:41:32,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:32,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:32,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 22:41:32,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:41:32,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:32,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:32,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:41:32,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:32,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172533314] [2025-04-13 22:41:32,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172533314] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:41:32,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:41:32,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:41:32,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577726269] [2025-04-13 22:41:32,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:41:32,812 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:41:32,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:32,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:41:32,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:32,813 INFO L87 Difference]: Start difference. First operand 686 states and 3407 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:32,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:32,970 INFO L93 Difference]: Finished difference Result 1766 states and 8662 transitions. [2025-04-13 22:41:32,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:41:32,971 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-04-13 22:41:32,971 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:32,981 INFO L225 Difference]: With dead ends: 1766 [2025-04-13 22:41:32,981 INFO L226 Difference]: Without dead ends: 1268 [2025-04-13 22:41:32,982 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:32,983 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:32,983 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2025-04-13 22:41:33,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1110. [2025-04-13 22:41:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1109 states have (on average 5.054102795311091) internal successors, (5605), 1109 states have internal predecessors, (5605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 5605 transitions. [2025-04-13 22:41:33,058 INFO L79 Accepts]: Start accepts. Automaton has 1110 states and 5605 transitions. Word has length 19 [2025-04-13 22:41:33,058 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:33,058 INFO L485 AbstractCegarLoop]: Abstraction has 1110 states and 5605 transitions. [2025-04-13 22:41:33,058 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:33,058 INFO L278 IsEmpty]: Start isEmpty. Operand 1110 states and 5605 transitions. [2025-04-13 22:41:33,061 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:41:33,062 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:33,062 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] [2025-04-13 22:41:33,062 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:41:33,062 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 1 more)] === [2025-04-13 22:41:33,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:33,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1368641354, now seen corresponding path program 1 times [2025-04-13 22:41:33,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:33,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339747752] [2025-04-13 22:41:33,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:33,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:33,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:41:33,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:41:33,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:33,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:41:33,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:33,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339747752] [2025-04-13 22:41:33,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339747752] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:41:33,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:41:33,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:41:33,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354027093] [2025-04-13 22:41:33,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:41:33,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:41:33,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:33,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:41:33,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:41:33,178 INFO L87 Difference]: Start difference. First operand 1110 states and 5605 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:33,355 INFO L93 Difference]: Finished difference Result 2316 states and 11509 transitions. [2025-04-13 22:41:33,356 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:41:33,356 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-04-13 22:41:33,356 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:33,366 INFO L225 Difference]: With dead ends: 2316 [2025-04-13 22:41:33,366 INFO L226 Difference]: Without dead ends: 1272 [2025-04-13 22:41:33,370 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:41:33,371 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:33,371 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2025-04-13 22:41:33,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1260. [2025-04-13 22:41:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 1259 states have (on average 4.903097696584591) internal successors, (6173), 1259 states have internal predecessors, (6173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 6173 transitions. [2025-04-13 22:41:33,434 INFO L79 Accepts]: Start accepts. Automaton has 1260 states and 6173 transitions. Word has length 21 [2025-04-13 22:41:33,434 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:33,434 INFO L485 AbstractCegarLoop]: Abstraction has 1260 states and 6173 transitions. [2025-04-13 22:41:33,434 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:33,434 INFO L278 IsEmpty]: Start isEmpty. Operand 1260 states and 6173 transitions. [2025-04-13 22:41:33,438 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:41:33,438 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:33,438 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] [2025-04-13 22:41:33,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:41:33,438 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 1 more)] === [2025-04-13 22:41:33,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:33,439 INFO L85 PathProgramCache]: Analyzing trace with hash -300897710, now seen corresponding path program 1 times [2025-04-13 22:41:33,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:33,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241484234] [2025-04-13 22:41:33,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:33,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:33,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:41:33,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:41:33,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:33,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:41:33,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:33,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241484234] [2025-04-13 22:41:33,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241484234] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:41:33,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:41:33,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:41:33,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762200105] [2025-04-13 22:41:33,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:41:33,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:41:33,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:33,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:41:33,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:33,506 INFO L87 Difference]: Start difference. First operand 1260 states and 6173 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:33,625 INFO L93 Difference]: Finished difference Result 2126 states and 10861 transitions. [2025-04-13 22:41:33,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:41:33,625 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-04-13 22:41:33,625 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:33,633 INFO L225 Difference]: With dead ends: 2126 [2025-04-13 22:41:33,634 INFO L226 Difference]: Without dead ends: 856 [2025-04-13 22:41:33,636 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:33,636 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:33,636 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:33,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-04-13 22:41:33,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 747. [2025-04-13 22:41:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 4.880697050938338) internal successors, (3641), 746 states have internal predecessors, (3641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 3641 transitions. [2025-04-13 22:41:33,675 INFO L79 Accepts]: Start accepts. Automaton has 747 states and 3641 transitions. Word has length 21 [2025-04-13 22:41:33,675 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:33,675 INFO L485 AbstractCegarLoop]: Abstraction has 747 states and 3641 transitions. [2025-04-13 22:41:33,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:33,675 INFO L278 IsEmpty]: Start isEmpty. Operand 747 states and 3641 transitions. [2025-04-13 22:41:33,677 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:41:33,677 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:33,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:33,677 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 22:41:33,677 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 1 more)] === [2025-04-13 22:41:33,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:33,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1212833314, now seen corresponding path program 1 times [2025-04-13 22:41:33,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:33,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531116354] [2025-04-13 22:41:33,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:33,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:33,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:41:33,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:41:33,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:33,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:34,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:41:34,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:34,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531116354] [2025-04-13 22:41:34,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531116354] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:41:34,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280933547] [2025-04-13 22:41:34,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:34,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:34,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:41:34,228 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:41:34,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 22:41:34,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:41:34,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:41:34,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:34,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:34,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 22:41:34,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:41:34,415 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 22:41:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:41:34,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:41:34,763 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-04-13 22:41:34,777 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:41:34,777 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-04-13 22:41:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:41:34,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280933547] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:41:34,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:41:34,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-04-13 22:41:34,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586217153] [2025-04-13 22:41:34,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:41:34,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 22:41:34,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:34,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 22:41:34,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:41:34,819 INFO L87 Difference]: Start difference. First operand 747 states and 3641 transitions. Second operand has 17 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:36,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:36,096 INFO L93 Difference]: Finished difference Result 4165 states and 20310 transitions. [2025-04-13 22:41:36,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:41:36,096 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 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 22 [2025-04-13 22:41:36,096 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:36,127 INFO L225 Difference]: With dead ends: 4165 [2025-04-13 22:41:36,127 INFO L226 Difference]: Without dead ends: 4131 [2025-04-13 22:41:36,129 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:41:36,130 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 556 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:36,130 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 0 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:41:36,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4131 states. [2025-04-13 22:41:36,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4131 to 2054. [2025-04-13 22:41:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 2053 states have (on average 5.572333170969313) internal successors, (11440), 2053 states have internal predecessors, (11440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 11440 transitions. [2025-04-13 22:41:36,320 INFO L79 Accepts]: Start accepts. Automaton has 2054 states and 11440 transitions. Word has length 22 [2025-04-13 22:41:36,320 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:36,320 INFO L485 AbstractCegarLoop]: Abstraction has 2054 states and 11440 transitions. [2025-04-13 22:41:36,320 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:36,321 INFO L278 IsEmpty]: Start isEmpty. Operand 2054 states and 11440 transitions. [2025-04-13 22:41:36,345 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:41:36,345 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:36,345 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] [2025-04-13 22:41:36,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 22:41:36,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:36,550 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 1 more)] === [2025-04-13 22:41:36,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:36,550 INFO L85 PathProgramCache]: Analyzing trace with hash 525451338, now seen corresponding path program 1 times [2025-04-13 22:41:36,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:36,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34776271] [2025-04-13 22:41:36,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:36,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:36,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:41:36,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:41:36,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:36,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:41:36,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:36,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34776271] [2025-04-13 22:41:36,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34776271] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:41:36,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:41:36,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:41:36,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847401855] [2025-04-13 22:41:36,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:41:36,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:41:36,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:36,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:41:36,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:36,604 INFO L87 Difference]: Start difference. First operand 2054 states and 11440 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:36,914 INFO L93 Difference]: Finished difference Result 4028 states and 23179 transitions. [2025-04-13 22:41:36,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:41:36,915 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-04-13 22:41:36,915 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:36,939 INFO L225 Difference]: With dead ends: 4028 [2025-04-13 22:41:36,939 INFO L226 Difference]: Without dead ends: 1999 [2025-04-13 22:41:36,942 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:36,942 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:36,942 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2025-04-13 22:41:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1751. [2025-04-13 22:41:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1751 states, 1750 states have (on average 5.477142857142857) internal successors, (9585), 1750 states have internal predecessors, (9585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 9585 transitions. [2025-04-13 22:41:37,094 INFO L79 Accepts]: Start accepts. Automaton has 1751 states and 9585 transitions. Word has length 22 [2025-04-13 22:41:37,095 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:37,095 INFO L485 AbstractCegarLoop]: Abstraction has 1751 states and 9585 transitions. [2025-04-13 22:41:37,095 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:37,095 INFO L278 IsEmpty]: Start isEmpty. Operand 1751 states and 9585 transitions. [2025-04-13 22:41:37,100 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:41:37,100 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:37,100 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] [2025-04-13 22:41:37,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:41:37,101 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 1 more)] === [2025-04-13 22:41:37,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:37,101 INFO L85 PathProgramCache]: Analyzing trace with hash -2107395046, now seen corresponding path program 1 times [2025-04-13 22:41:37,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:37,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67701941] [2025-04-13 22:41:37,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:37,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:37,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:41:37,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:41:37,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:37,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:41:37,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:37,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67701941] [2025-04-13 22:41:37,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67701941] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:41:37,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:41:37,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:41:37,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86732319] [2025-04-13 22:41:37,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:41:37,154 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:41:37,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:37,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:41:37,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:37,154 INFO L87 Difference]: Start difference. First operand 1751 states and 9585 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:37,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:37,477 INFO L93 Difference]: Finished difference Result 4375 states and 24346 transitions. [2025-04-13 22:41:37,477 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:41:37,478 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-04-13 22:41:37,478 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:37,495 INFO L225 Difference]: With dead ends: 4375 [2025-04-13 22:41:37,495 INFO L226 Difference]: Without dead ends: 2715 [2025-04-13 22:41:37,498 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:37,500 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:37,500 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:37,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2025-04-13 22:41:37,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2473. [2025-04-13 22:41:37,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2472 states have (on average 5.54247572815534) internal successors, (13701), 2472 states have internal predecessors, (13701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 13701 transitions. [2025-04-13 22:41:37,800 INFO L79 Accepts]: Start accepts. Automaton has 2473 states and 13701 transitions. Word has length 22 [2025-04-13 22:41:37,800 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:37,800 INFO L485 AbstractCegarLoop]: Abstraction has 2473 states and 13701 transitions. [2025-04-13 22:41:37,800 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:37,801 INFO L278 IsEmpty]: Start isEmpty. Operand 2473 states and 13701 transitions. [2025-04-13 22:41:37,807 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 22:41:37,807 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:37,807 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:37,807 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:41:37,807 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 1 more)] === [2025-04-13 22:41:37,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:37,808 INFO L85 PathProgramCache]: Analyzing trace with hash -769414968, now seen corresponding path program 1 times [2025-04-13 22:41:37,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:37,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169454501] [2025-04-13 22:41:37,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:37,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:37,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 22:41:37,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 22:41:37,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:37,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:41:38,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:38,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169454501] [2025-04-13 22:41:38,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169454501] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:41:38,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959523811] [2025-04-13 22:41:38,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:38,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:38,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:41:38,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:41:38,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 22:41:38,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 22:41:38,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 22:41:38,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:38,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:38,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 22:41:38,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:41:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:41:38,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:41:38,638 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:41:38,638 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-04-13 22:41:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:41:38,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959523811] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:41:38,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:41:38,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2025-04-13 22:41:38,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021284373] [2025-04-13 22:41:38,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:41:38,659 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:41:38,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:38,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:41:38,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:41:38,659 INFO L87 Difference]: Start difference. First operand 2473 states and 13701 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:39,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:39,277 INFO L93 Difference]: Finished difference Result 3480 states and 18077 transitions. [2025-04-13 22:41:39,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:41:39,277 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 24 [2025-04-13 22:41:39,278 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:39,296 INFO L225 Difference]: With dead ends: 3480 [2025-04-13 22:41:39,296 INFO L226 Difference]: Without dead ends: 3457 [2025-04-13 22:41:39,297 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:41:39,298 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:39,298 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 0 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:41:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2025-04-13 22:41:39,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 2432. [2025-04-13 22:41:39,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2432 states, 2431 states have (on average 5.585355820649938) internal successors, (13578), 2431 states have internal predecessors, (13578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 13578 transitions. [2025-04-13 22:41:39,510 INFO L79 Accepts]: Start accepts. Automaton has 2432 states and 13578 transitions. Word has length 24 [2025-04-13 22:41:39,510 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:39,510 INFO L485 AbstractCegarLoop]: Abstraction has 2432 states and 13578 transitions. [2025-04-13 22:41:39,510 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:39,510 INFO L278 IsEmpty]: Start isEmpty. Operand 2432 states and 13578 transitions. [2025-04-13 22:41:39,518 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 22:41:39,518 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:39,518 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:39,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 22:41:39,718 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,SelfDestructingSolverStorable9 [2025-04-13 22:41:39,719 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 1 more)] === [2025-04-13 22:41:39,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:39,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1500827716, now seen corresponding path program 2 times [2025-04-13 22:41:39,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:39,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960953277] [2025-04-13 22:41:39,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:41:39,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:39,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 22:41:39,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 22:41:39,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:41:39,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:41:39,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:39,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960953277] [2025-04-13 22:41:39,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960953277] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:41:39,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:41:39,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:41:39,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554965113] [2025-04-13 22:41:39,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:41:39,782 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:41:39,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:39,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:41:39,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:39,783 INFO L87 Difference]: Start difference. First operand 2432 states and 13578 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:40,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:40,159 INFO L93 Difference]: Finished difference Result 4782 states and 28145 transitions. [2025-04-13 22:41:40,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:41:40,159 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-04-13 22:41:40,159 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:40,176 INFO L225 Difference]: With dead ends: 4782 [2025-04-13 22:41:40,177 INFO L226 Difference]: Without dead ends: 2484 [2025-04-13 22:41:40,181 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:40,181 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:40,181 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2025-04-13 22:41:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2304. [2025-04-13 22:41:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2304 states, 2303 states have (on average 5.548415110725141) internal successors, (12778), 2303 states have internal predecessors, (12778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 12778 transitions. [2025-04-13 22:41:40,464 INFO L79 Accepts]: Start accepts. Automaton has 2304 states and 12778 transitions. Word has length 24 [2025-04-13 22:41:40,464 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:40,464 INFO L485 AbstractCegarLoop]: Abstraction has 2304 states and 12778 transitions. [2025-04-13 22:41:40,465 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:40,465 INFO L278 IsEmpty]: Start isEmpty. Operand 2304 states and 12778 transitions. [2025-04-13 22:41:40,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:41:40,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:40,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:40,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 22:41:40,470 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 1 more)] === [2025-04-13 22:41:40,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:40,470 INFO L85 PathProgramCache]: Analyzing trace with hash 17573558, now seen corresponding path program 1 times [2025-04-13 22:41:40,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:40,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735999840] [2025-04-13 22:41:40,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:40,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:40,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 22:41:40,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:41:40,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:40,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:41:40,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:40,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735999840] [2025-04-13 22:41:40,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735999840] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:41:40,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:41:40,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:41:40,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773755453] [2025-04-13 22:41:40,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:41:40,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:41:40,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:40,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:41:40,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:40,511 INFO L87 Difference]: Start difference. First operand 2304 states and 12778 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:40,815 INFO L93 Difference]: Finished difference Result 4602 states and 26751 transitions. [2025-04-13 22:41:40,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:41:40,816 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:41:40,816 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:40,832 INFO L225 Difference]: With dead ends: 4602 [2025-04-13 22:41:40,832 INFO L226 Difference]: Without dead ends: 2552 [2025-04-13 22:41:40,836 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:40,837 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:40,837 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:40,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2025-04-13 22:41:40,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1980. [2025-04-13 22:41:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1980 states, 1979 states have (on average 5.408792319353209) internal successors, (10704), 1979 states have internal predecessors, (10704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1980 states and 10704 transitions. [2025-04-13 22:41:40,986 INFO L79 Accepts]: Start accepts. Automaton has 1980 states and 10704 transitions. Word has length 26 [2025-04-13 22:41:40,986 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:40,986 INFO L485 AbstractCegarLoop]: Abstraction has 1980 states and 10704 transitions. [2025-04-13 22:41:40,986 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:40,986 INFO L278 IsEmpty]: Start isEmpty. Operand 1980 states and 10704 transitions. [2025-04-13 22:41:40,989 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:41:40,990 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:40,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:40,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 22:41:40,990 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 1 more)] === [2025-04-13 22:41:40,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:40,990 INFO L85 PathProgramCache]: Analyzing trace with hash -111714698, now seen corresponding path program 1 times [2025-04-13 22:41:40,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:40,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378551724] [2025-04-13 22:41:40,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:40,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:40,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 22:41:41,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:41:41,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:41,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:41:41,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:41,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378551724] [2025-04-13 22:41:41,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378551724] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:41:41,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:41:41,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:41:41,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199267667] [2025-04-13 22:41:41,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:41:41,067 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:41:41,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:41,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:41:41,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:41:41,067 INFO L87 Difference]: Start difference. First operand 1980 states and 10704 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:41,330 INFO L93 Difference]: Finished difference Result 3984 states and 21473 transitions. [2025-04-13 22:41:41,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:41:41,331 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:41:41,331 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:41,342 INFO L225 Difference]: With dead ends: 3984 [2025-04-13 22:41:41,342 INFO L226 Difference]: Without dead ends: 1982 [2025-04-13 22:41:41,345 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:41:41,345 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:41,345 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:41,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2025-04-13 22:41:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1982. [2025-04-13 22:41:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1981 states have (on average 5.404341241797072) internal successors, (10706), 1981 states have internal predecessors, (10706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 10706 transitions. [2025-04-13 22:41:41,481 INFO L79 Accepts]: Start accepts. Automaton has 1982 states and 10706 transitions. Word has length 26 [2025-04-13 22:41:41,481 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:41,481 INFO L485 AbstractCegarLoop]: Abstraction has 1982 states and 10706 transitions. [2025-04-13 22:41:41,482 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:41,482 INFO L278 IsEmpty]: Start isEmpty. Operand 1982 states and 10706 transitions. [2025-04-13 22:41:41,485 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:41:41,485 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:41,485 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] [2025-04-13 22:41:41,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 22:41:41,485 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 1 more)] === [2025-04-13 22:41:41,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:41,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1190708083, now seen corresponding path program 1 times [2025-04-13 22:41:41,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:41,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997932474] [2025-04-13 22:41:41,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:41,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:41,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:41:41,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:41:41,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:41,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:41:41,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:41,585 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997932474] [2025-04-13 22:41:41,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997932474] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:41:41,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842411151] [2025-04-13 22:41:41,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:41,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:41,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:41:41,588 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:41:41,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 22:41:41,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:41:41,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:41:41,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:41,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:41,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 22:41:41,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:41:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:41:41,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:41:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:41:41,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842411151] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:41:41,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:41:41,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 10 [2025-04-13 22:41:41,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918570569] [2025-04-13 22:41:41,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:41:41,791 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:41:41,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:41,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:41:41,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:41:41,791 INFO L87 Difference]: Start difference. First operand 1982 states and 10706 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:42,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:42,275 INFO L93 Difference]: Finished difference Result 4774 states and 24725 transitions. [2025-04-13 22:41:42,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:41:42,276 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 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 27 [2025-04-13 22:41:42,276 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:42,290 INFO L225 Difference]: With dead ends: 4774 [2025-04-13 22:41:42,290 INFO L226 Difference]: Without dead ends: 2782 [2025-04-13 22:41:42,294 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:41:42,294 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 165 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:42,294 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 0 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:41:42,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2025-04-13 22:41:42,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2345. [2025-04-13 22:41:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 2344 states have (on average 5.117320819112628) internal successors, (11995), 2344 states have internal predecessors, (11995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:42,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 11995 transitions. [2025-04-13 22:41:42,425 INFO L79 Accepts]: Start accepts. Automaton has 2345 states and 11995 transitions. Word has length 27 [2025-04-13 22:41:42,425 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:42,426 INFO L485 AbstractCegarLoop]: Abstraction has 2345 states and 11995 transitions. [2025-04-13 22:41:42,426 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:42,426 INFO L278 IsEmpty]: Start isEmpty. Operand 2345 states and 11995 transitions. [2025-04-13 22:41:42,429 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:41:42,429 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:42,429 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] [2025-04-13 22:41:42,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 22:41:42,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:42,629 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 1 more)] === [2025-04-13 22:41:42,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:42,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2009724621, now seen corresponding path program 1 times [2025-04-13 22:41:42,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:42,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336017109] [2025-04-13 22:41:42,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:42,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:42,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:41:42,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:41:42,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:42,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:41:42,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:42,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336017109] [2025-04-13 22:41:42,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336017109] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:41:42,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768768859] [2025-04-13 22:41:42,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:42,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:42,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:41:42,978 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:41:42,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 22:41:43,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:41:43,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:41:43,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:43,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:43,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:41:43,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:41:43,087 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 22:41:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:41:43,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:41:43,336 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-04-13 22:41:43,342 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:41:43,342 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-04-13 22:41:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:41:43,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768768859] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:41:43,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:41:43,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-04-13 22:41:43,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88702367] [2025-04-13 22:41:43,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:41:43,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 22:41:43,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:43,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 22:41:43,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:41:43,375 INFO L87 Difference]: Start difference. First operand 2345 states and 11995 transitions. Second operand has 17 states, 16 states have (on average 4.6875) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:44,868 INFO L93 Difference]: Finished difference Result 11304 states and 55389 transitions. [2025-04-13 22:41:44,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:41:44,869 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.6875) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 22:41:44,869 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:44,915 INFO L225 Difference]: With dead ends: 11304 [2025-04-13 22:41:44,915 INFO L226 Difference]: Without dead ends: 11249 [2025-04-13 22:41:44,919 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:41:44,920 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 387 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:44,920 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 0 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:41:44,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11249 states. [2025-04-13 22:41:45,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11249 to 4127. [2025-04-13 22:41:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4127 states, 4126 states have (on average 5.326951042171594) internal successors, (21979), 4126 states have internal predecessors, (21979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4127 states to 4127 states and 21979 transitions. [2025-04-13 22:41:45,528 INFO L79 Accepts]: Start accepts. Automaton has 4127 states and 21979 transitions. Word has length 27 [2025-04-13 22:41:45,528 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:45,528 INFO L485 AbstractCegarLoop]: Abstraction has 4127 states and 21979 transitions. [2025-04-13 22:41:45,528 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.6875) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:45,528 INFO L278 IsEmpty]: Start isEmpty. Operand 4127 states and 21979 transitions. [2025-04-13 22:41:45,535 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:41:45,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:45,535 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:45,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 22:41:45,740 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 22:41:45,740 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 1 more)] === [2025-04-13 22:41:45,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:45,740 INFO L85 PathProgramCache]: Analyzing trace with hash -489169415, now seen corresponding path program 2 times [2025-04-13 22:41:45,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:45,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319093030] [2025-04-13 22:41:45,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:41:45,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:45,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:41:45,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:41:45,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:41:45,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:45,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:41:45,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:45,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319093030] [2025-04-13 22:41:45,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319093030] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:41:45,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:41:45,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:41:45,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124200537] [2025-04-13 22:41:45,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:41:45,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:41:45,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:45,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:41:45,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:45,802 INFO L87 Difference]: Start difference. First operand 4127 states and 21979 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:46,404 INFO L93 Difference]: Finished difference Result 6623 states and 34846 transitions. [2025-04-13 22:41:46,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:41:46,405 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:41:46,405 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:46,428 INFO L225 Difference]: With dead ends: 6623 [2025-04-13 22:41:46,428 INFO L226 Difference]: Without dead ends: 4669 [2025-04-13 22:41:46,432 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:46,433 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:46,433 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:46,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2025-04-13 22:41:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4127. [2025-04-13 22:41:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4127 states, 4126 states have (on average 5.17644207464857) internal successors, (21358), 4126 states have internal predecessors, (21358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4127 states to 4127 states and 21358 transitions. [2025-04-13 22:41:46,842 INFO L79 Accepts]: Start accepts. Automaton has 4127 states and 21358 transitions. Word has length 29 [2025-04-13 22:41:46,842 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:46,842 INFO L485 AbstractCegarLoop]: Abstraction has 4127 states and 21358 transitions. [2025-04-13 22:41:46,842 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:46,843 INFO L278 IsEmpty]: Start isEmpty. Operand 4127 states and 21358 transitions. [2025-04-13 22:41:46,848 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:41:46,849 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:46,849 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:46,849 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 22:41:46,849 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 1 more)] === [2025-04-13 22:41:46,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:46,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1153499585, now seen corresponding path program 2 times [2025-04-13 22:41:46,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:46,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947256705] [2025-04-13 22:41:46,849 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:41:46,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:46,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:41:46,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:41:46,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:41:46,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:41:46,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:46,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947256705] [2025-04-13 22:41:46,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947256705] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:41:46,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:41:46,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:41:46,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033609647] [2025-04-13 22:41:46,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:41:46,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:41:46,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:46,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:41:46,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:46,904 INFO L87 Difference]: Start difference. First operand 4127 states and 21358 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:47,274 INFO L93 Difference]: Finished difference Result 6333 states and 32431 transitions. [2025-04-13 22:41:47,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:41:47,274 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:41:47,275 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:47,297 INFO L225 Difference]: With dead ends: 6333 [2025-04-13 22:41:47,298 INFO L226 Difference]: Without dead ends: 2324 [2025-04-13 22:41:47,304 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:47,304 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:47,304 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:47,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2025-04-13 22:41:47,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 2066. [2025-04-13 22:41:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2066 states, 2065 states have (on average 4.42227602905569) internal successors, (9132), 2065 states have internal predecessors, (9132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:47,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 9132 transitions. [2025-04-13 22:41:47,535 INFO L79 Accepts]: Start accepts. Automaton has 2066 states and 9132 transitions. Word has length 30 [2025-04-13 22:41:47,535 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:47,535 INFO L485 AbstractCegarLoop]: Abstraction has 2066 states and 9132 transitions. [2025-04-13 22:41:47,535 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:47,535 INFO L278 IsEmpty]: Start isEmpty. Operand 2066 states and 9132 transitions. [2025-04-13 22:41:47,537 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:41:47,537 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:47,537 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:47,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 22:41:47,537 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 1 more)] === [2025-04-13 22:41:47,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:47,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1072455678, now seen corresponding path program 3 times [2025-04-13 22:41:47,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:47,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237374225] [2025-04-13 22:41:47,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:41:47,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:47,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:41:47,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 22:41:47,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:41:47,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:47,669 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:41:47,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:47,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237374225] [2025-04-13 22:41:47,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237374225] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:41:47,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696363925] [2025-04-13 22:41:47,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:41:47,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:47,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:41:47,671 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 22:41:47,673 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 22:41:47,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:41:47,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 22:41:47,756 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:41:47,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:47,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 22:41:47,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:41:47,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:41:47,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:41:47,824 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:41:47,824 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-04-13 22:41:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:41:47,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696363925] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:41:47,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:41:47,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-04-13 22:41:47,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398957920] [2025-04-13 22:41:47,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:41:47,844 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:41:47,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:47,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:41:47,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:41:47,845 INFO L87 Difference]: Start difference. First operand 2066 states and 9132 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:48,143 INFO L93 Difference]: Finished difference Result 2220 states and 9600 transitions. [2025-04-13 22:41:48,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:41:48,144 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:41:48,144 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:48,157 INFO L225 Difference]: With dead ends: 2220 [2025-04-13 22:41:48,157 INFO L226 Difference]: Without dead ends: 2206 [2025-04-13 22:41:48,157 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:41:48,158 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:48,158 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2025-04-13 22:41:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 1934. [2025-04-13 22:41:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1934 states, 1933 states have (on average 4.552509053285049) internal successors, (8800), 1933 states have internal predecessors, (8800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 8800 transitions. [2025-04-13 22:41:48,462 INFO L79 Accepts]: Start accepts. Automaton has 1934 states and 8800 transitions. Word has length 30 [2025-04-13 22:41:48,462 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:48,462 INFO L485 AbstractCegarLoop]: Abstraction has 1934 states and 8800 transitions. [2025-04-13 22:41:48,462 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:48,462 INFO L278 IsEmpty]: Start isEmpty. Operand 1934 states and 8800 transitions. [2025-04-13 22:41:48,464 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:41:48,464 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:48,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:48,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 22:41:48,665 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,SelfDestructingSolverStorable17 [2025-04-13 22:41:48,665 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 1 more)] === [2025-04-13 22:41:48,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:48,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1080652725, now seen corresponding path program 1 times [2025-04-13 22:41:48,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:48,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658678563] [2025-04-13 22:41:48,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:48,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:48,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:41:48,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:41:48,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:48,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:48,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:41:48,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:48,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658678563] [2025-04-13 22:41:48,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658678563] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:41:48,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823791390] [2025-04-13 22:41:48,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:48,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:48,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:41:48,805 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 22:41:48,807 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 22:41:48,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:41:48,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:41:48,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:48,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:48,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:41:48,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:41:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:41:48,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:41:49,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:41:49,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823791390] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:41:49,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:41:49,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 22:41:49,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698829408] [2025-04-13 22:41:49,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:41:49,050 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:41:49,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:49,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:41:49,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:41:49,051 INFO L87 Difference]: Start difference. First operand 1934 states and 8800 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:49,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:49,571 INFO L93 Difference]: Finished difference Result 2002 states and 8961 transitions. [2025-04-13 22:41:49,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:41:49,571 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-13 22:41:49,571 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:49,586 INFO L225 Difference]: With dead ends: 2002 [2025-04-13 22:41:49,586 INFO L226 Difference]: Without dead ends: 1834 [2025-04-13 22:41:49,587 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:41:49,587 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:49,587 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:49,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2025-04-13 22:41:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1834. [2025-04-13 22:41:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1833 states have (on average 4.651936715766503) internal successors, (8527), 1833 states have internal predecessors, (8527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 8527 transitions. [2025-04-13 22:41:49,739 INFO L79 Accepts]: Start accepts. Automaton has 1834 states and 8527 transitions. Word has length 31 [2025-04-13 22:41:49,739 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:49,739 INFO L485 AbstractCegarLoop]: Abstraction has 1834 states and 8527 transitions. [2025-04-13 22:41:49,739 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:49,739 INFO L278 IsEmpty]: Start isEmpty. Operand 1834 states and 8527 transitions. [2025-04-13 22:41:49,740 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 22:41:49,740 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:49,740 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:49,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 22:41:49,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:49,941 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 1 more)] === [2025-04-13 22:41:49,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:49,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2110175865, now seen corresponding path program 1 times [2025-04-13 22:41:49,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:49,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104916991] [2025-04-13 22:41:49,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:49,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:49,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 22:41:49,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:41:49,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:49,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:41:50,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:50,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104916991] [2025-04-13 22:41:50,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104916991] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:41:50,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340568832] [2025-04-13 22:41:50,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:50,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:50,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:41:50,407 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:41:50,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 22:41:50,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 22:41:50,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:41:50,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:50,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:50,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:41:50,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:41:50,733 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:41:50,733 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 20 [2025-04-13 22:41:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:41:50,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:41:50,802 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:41:50,802 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-04-13 22:41:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:41:51,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340568832] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:41:51,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:41:51,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-04-13 22:41:51,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541545606] [2025-04-13 22:41:51,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:41:51,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:41:51,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:51,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:41:51,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:41:51,134 INFO L87 Difference]: Start difference. First operand 1834 states and 8527 transitions. Second operand has 26 states, 25 states have (on average 3.84) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:52,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:52,750 INFO L93 Difference]: Finished difference Result 7471 states and 33578 transitions. [2025-04-13 22:41:52,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:41:52,751 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.84) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 22:41:52,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:52,774 INFO L225 Difference]: With dead ends: 7471 [2025-04-13 22:41:52,775 INFO L226 Difference]: Without dead ends: 5392 [2025-04-13 22:41:52,778 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=248, Invalid=1312, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:41:52,779 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 562 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:52,779 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 0 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1621 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:41:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5392 states. [2025-04-13 22:41:53,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5392 to 3297. [2025-04-13 22:41:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3297 states, 3296 states have (on average 4.798847087378641) internal successors, (15817), 3296 states have internal predecessors, (15817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3297 states to 3297 states and 15817 transitions. [2025-04-13 22:41:53,149 INFO L79 Accepts]: Start accepts. Automaton has 3297 states and 15817 transitions. Word has length 32 [2025-04-13 22:41:53,150 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:53,150 INFO L485 AbstractCegarLoop]: Abstraction has 3297 states and 15817 transitions. [2025-04-13 22:41:53,150 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.84) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:53,150 INFO L278 IsEmpty]: Start isEmpty. Operand 3297 states and 15817 transitions. [2025-04-13 22:41:53,152 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 22:41:53,152 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:53,152 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:53,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 22:41:53,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:53,353 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 1 more)] === [2025-04-13 22:41:53,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:53,353 INFO L85 PathProgramCache]: Analyzing trace with hash -957715165, now seen corresponding path program 2 times [2025-04-13 22:41:53,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:53,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264518560] [2025-04-13 22:41:53,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:41:53,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:53,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 22:41:53,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:41:53,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:41:53,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:53,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:41:53,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:53,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264518560] [2025-04-13 22:41:53,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264518560] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:41:53,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310957851] [2025-04-13 22:41:53,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:41:53,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:53,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:41:53,417 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:41:53,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 22:41:53,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 22:41:53,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:41:53,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:41:53,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:53,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 22:41:53,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:41:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:41:53,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:41:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:41:53,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310957851] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:41:53,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:41:53,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 7 [2025-04-13 22:41:53,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138806640] [2025-04-13 22:41:53,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:41:53,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:41:53,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:53,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:41:53,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:41:53,594 INFO L87 Difference]: Start difference. First operand 3297 states and 15817 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:54,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:54,614 INFO L93 Difference]: Finished difference Result 10112 states and 50205 transitions. [2025-04-13 22:41:54,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:41:54,614 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 22:41:54,614 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:54,649 INFO L225 Difference]: With dead ends: 10112 [2025-04-13 22:41:54,649 INFO L226 Difference]: Without dead ends: 7034 [2025-04-13 22:41:54,656 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:41:54,657 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:54,657 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:54,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7034 states. [2025-04-13 22:41:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7034 to 6040. [2025-04-13 22:41:55,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6040 states, 6039 states have (on average 5.078820996853784) internal successors, (30671), 6039 states have internal predecessors, (30671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:55,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6040 states to 6040 states and 30671 transitions. [2025-04-13 22:41:55,290 INFO L79 Accepts]: Start accepts. Automaton has 6040 states and 30671 transitions. Word has length 32 [2025-04-13 22:41:55,290 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:55,290 INFO L485 AbstractCegarLoop]: Abstraction has 6040 states and 30671 transitions. [2025-04-13 22:41:55,290 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:55,291 INFO L278 IsEmpty]: Start isEmpty. Operand 6040 states and 30671 transitions. [2025-04-13 22:41:55,292 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:41:55,292 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:55,292 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:55,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 22:41:55,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-13 22:41:55,492 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 1 more)] === [2025-04-13 22:41:55,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:55,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1737415053, now seen corresponding path program 1 times [2025-04-13 22:41:55,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:55,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772847662] [2025-04-13 22:41:55,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:55,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:55,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:41:55,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:41:55,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:55,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:41:55,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:55,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772847662] [2025-04-13 22:41:55,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772847662] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:41:55,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:41:55,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:41:55,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571735955] [2025-04-13 22:41:55,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:41:55,566 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:41:55,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:55,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:41:55,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:41:55,566 INFO L87 Difference]: Start difference. First operand 6040 states and 30671 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:56,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:56,513 INFO L93 Difference]: Finished difference Result 12139 states and 61480 transitions. [2025-04-13 22:41:56,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:41:56,513 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 36 [2025-04-13 22:41:56,513 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:56,546 INFO L225 Difference]: With dead ends: 12139 [2025-04-13 22:41:56,546 INFO L226 Difference]: Without dead ends: 6392 [2025-04-13 22:41:56,555 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:41:56,556 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:56,556 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:56,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6392 states. [2025-04-13 22:41:57,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6392 to 6200. [2025-04-13 22:41:57,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6200 states, 6199 states have (on average 5.0222616551056625) internal successors, (31133), 6199 states have internal predecessors, (31133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6200 states to 6200 states and 31133 transitions. [2025-04-13 22:41:57,230 INFO L79 Accepts]: Start accepts. Automaton has 6200 states and 31133 transitions. Word has length 36 [2025-04-13 22:41:57,230 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:57,230 INFO L485 AbstractCegarLoop]: Abstraction has 6200 states and 31133 transitions. [2025-04-13 22:41:57,230 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:57,230 INFO L278 IsEmpty]: Start isEmpty. Operand 6200 states and 31133 transitions. [2025-04-13 22:41:57,231 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:41:57,231 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:57,231 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:57,231 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 22:41:57,232 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 1 more)] === [2025-04-13 22:41:57,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:57,232 INFO L85 PathProgramCache]: Analyzing trace with hash 557333865, now seen corresponding path program 2 times [2025-04-13 22:41:57,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:57,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314042605] [2025-04-13 22:41:57,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:41:57,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:57,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-13 22:41:57,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:41:57,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:41:57,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 22:41:57,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:57,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314042605] [2025-04-13 22:41:57,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314042605] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:41:57,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:41:57,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:41:57,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176987881] [2025-04-13 22:41:57,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:41:57,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:41:57,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:57,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:41:57,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:57,266 INFO L87 Difference]: Start difference. First operand 6200 states and 31133 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:58,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:58,160 INFO L93 Difference]: Finished difference Result 11737 states and 59723 transitions. [2025-04-13 22:41:58,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:41:58,160 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) 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 36 [2025-04-13 22:41:58,160 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:58,194 INFO L225 Difference]: With dead ends: 11737 [2025-04-13 22:41:58,194 INFO L226 Difference]: Without dead ends: 5732 [2025-04-13 22:41:58,203 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:41:58,204 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:58,204 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:58,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5732 states. [2025-04-13 22:41:58,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5732 to 5180. [2025-04-13 22:41:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5180 states, 5179 states have (on average 4.619810774280749) internal successors, (23926), 5179 states have internal predecessors, (23926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 23926 transitions. [2025-04-13 22:41:58,765 INFO L79 Accepts]: Start accepts. Automaton has 5180 states and 23926 transitions. Word has length 36 [2025-04-13 22:41:58,766 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:58,766 INFO L485 AbstractCegarLoop]: Abstraction has 5180 states and 23926 transitions. [2025-04-13 22:41:58,766 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:58,766 INFO L278 IsEmpty]: Start isEmpty. Operand 5180 states and 23926 transitions. [2025-04-13 22:41:58,766 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:41:58,767 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:58,767 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:58,767 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 22:41:58,767 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 1 more)] === [2025-04-13 22:41:58,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:58,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1915148239, now seen corresponding path program 1 times [2025-04-13 22:41:58,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:58,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917250166] [2025-04-13 22:41:58,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:58,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:58,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 22:41:58,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:41:58,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:58,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:58,855 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:41:58,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:58,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917250166] [2025-04-13 22:41:58,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917250166] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:41:58,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869469152] [2025-04-13 22:41:58,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:41:58,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:58,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:41:58,858 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:41:58,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 22:41:58,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 22:41:58,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:41:58,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:58,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:58,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:41:58,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:41:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:41:59,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:41:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:41:59,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869469152] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:41:59,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:41:59,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 22:41:59,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342884145] [2025-04-13 22:41:59,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:41:59,055 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:41:59,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:59,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:41:59,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:41:59,056 INFO L87 Difference]: Start difference. First operand 5180 states and 23926 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:00,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:00,205 INFO L93 Difference]: Finished difference Result 10391 states and 47945 transitions. [2025-04-13 22:42:00,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:42:00,205 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 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 37 [2025-04-13 22:42:00,205 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:00,241 INFO L225 Difference]: With dead ends: 10391 [2025-04-13 22:42:00,241 INFO L226 Difference]: Without dead ends: 5182 [2025-04-13 22:42:00,250 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:42:00,251 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:00,251 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:42:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5182 states. [2025-04-13 22:42:00,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5182 to 5182. [2025-04-13 22:42:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5182 states, 5181 states have (on average 4.6184134337000575) internal successors, (23928), 5181 states have internal predecessors, (23928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5182 states to 5182 states and 23928 transitions. [2025-04-13 22:42:00,798 INFO L79 Accepts]: Start accepts. Automaton has 5182 states and 23928 transitions. Word has length 37 [2025-04-13 22:42:00,799 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:00,799 INFO L485 AbstractCegarLoop]: Abstraction has 5182 states and 23928 transitions. [2025-04-13 22:42:00,799 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:00,799 INFO L278 IsEmpty]: Start isEmpty. Operand 5182 states and 23928 transitions. [2025-04-13 22:42:00,800 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 22:42:00,800 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:00,800 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:00,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 22:42:01,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-13 22:42:01,000 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 1 more)] === [2025-04-13 22:42:01,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:01,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1225711479, now seen corresponding path program 2 times [2025-04-13 22:42:01,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:01,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433150444] [2025-04-13 22:42:01,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:42:01,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:01,008 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 22:42:01,039 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 22:42:01,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:42:01,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:42:01,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:01,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433150444] [2025-04-13 22:42:01,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433150444] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:42:01,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276856198] [2025-04-13 22:42:01,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:42:01,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:01,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:42:01,378 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:42:01,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 22:42:01,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 22:42:01,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 22:42:01,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:42:01,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:01,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:42:01,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:42:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:42:01,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:42:01,650 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:42:01,650 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-04-13 22:42:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:42:01,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276856198] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:42:01,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:42:01,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2025-04-13 22:42:01,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511090200] [2025-04-13 22:42:01,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:42:01,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:42:01,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:01,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:42:01,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:42:01,828 INFO L87 Difference]: Start difference. First operand 5182 states and 23928 transitions. Second operand has 21 states, 20 states have (on average 5.35) internal successors, (107), 21 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:03,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:03,290 INFO L93 Difference]: Finished difference Result 10833 states and 49332 transitions. [2025-04-13 22:42:03,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:42:03,291 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.35) internal successors, (107), 21 states have internal predecessors, (107), 0 states have call successors, (0), 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 38 [2025-04-13 22:42:03,291 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:03,332 INFO L225 Difference]: With dead ends: 10833 [2025-04-13 22:42:03,332 INFO L226 Difference]: Without dead ends: 5535 [2025-04-13 22:42:03,341 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:42:03,342 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 193 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:03,342 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 0 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:42:03,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2025-04-13 22:42:03,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 5290. [2025-04-13 22:42:03,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5290 states, 5289 states have (on average 4.598033654755152) internal successors, (24319), 5289 states have internal predecessors, (24319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5290 states to 5290 states and 24319 transitions. [2025-04-13 22:42:03,903 INFO L79 Accepts]: Start accepts. Automaton has 5290 states and 24319 transitions. Word has length 38 [2025-04-13 22:42:03,903 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:03,903 INFO L485 AbstractCegarLoop]: Abstraction has 5290 states and 24319 transitions. [2025-04-13 22:42:03,903 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.35) internal successors, (107), 21 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:03,903 INFO L278 IsEmpty]: Start isEmpty. Operand 5290 states and 24319 transitions. [2025-04-13 22:42:03,905 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 22:42:03,905 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:03,905 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:03,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 22:42:04,105 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-13 22:42:04,105 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 1 more)] === [2025-04-13 22:42:04,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:04,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2124123713, now seen corresponding path program 3 times [2025-04-13 22:42:04,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:04,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088870347] [2025-04-13 22:42:04,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:42:04,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:04,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 3 equivalence classes. [2025-04-13 22:42:04,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 43 statements. [2025-04-13 22:42:04,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:42:04,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:42:04,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:04,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088870347] [2025-04-13 22:42:04,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088870347] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:42:04,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476064826] [2025-04-13 22:42:04,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:42:04,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:04,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:42:04,343 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:42:04,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 22:42:04,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 3 equivalence classes. [2025-04-13 22:42:04,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 43 statements. [2025-04-13 22:42:04,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:42:04,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:04,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 22:42:04,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:42:04,490 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:42:04,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:42:04,512 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:42:04,513 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-04-13 22:42:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:42:04,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476064826] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:42:04,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:42:04,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-04-13 22:42:04,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684653784] [2025-04-13 22:42:04,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:42:04,548 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:42:04,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:04,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:42:04,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:42:04,548 INFO L87 Difference]: Start difference. First operand 5290 states and 24319 transitions. Second operand has 11 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:06,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:06,214 INFO L93 Difference]: Finished difference Result 10138 states and 44604 transitions. [2025-04-13 22:42:06,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:42:06,214 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 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 43 [2025-04-13 22:42:06,214 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:06,265 INFO L225 Difference]: With dead ends: 10138 [2025-04-13 22:42:06,266 INFO L226 Difference]: Without dead ends: 10010 [2025-04-13 22:42:06,269 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:42:06,269 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:06,269 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:42:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10010 states. [2025-04-13 22:42:07,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10010 to 6858. [2025-04-13 22:42:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6858 states, 6857 states have (on average 4.696806183462155) internal successors, (32206), 6857 states have internal predecessors, (32206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6858 states to 6858 states and 32206 transitions. [2025-04-13 22:42:07,084 INFO L79 Accepts]: Start accepts. Automaton has 6858 states and 32206 transitions. Word has length 43 [2025-04-13 22:42:07,084 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:07,085 INFO L485 AbstractCegarLoop]: Abstraction has 6858 states and 32206 transitions. [2025-04-13 22:42:07,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:07,085 INFO L278 IsEmpty]: Start isEmpty. Operand 6858 states and 32206 transitions. [2025-04-13 22:42:07,087 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:42:07,087 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:07,087 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:07,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 22:42:07,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 22:42:07,287 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 1 more)] === [2025-04-13 22:42:07,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:07,288 INFO L85 PathProgramCache]: Analyzing trace with hash -89776689, now seen corresponding path program 4 times [2025-04-13 22:42:07,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:07,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950404389] [2025-04-13 22:42:07,288 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:42:07,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:07,296 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:42:07,301 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:42:07,301 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:42:07,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-13 22:42:07,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:07,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950404389] [2025-04-13 22:42:07,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950404389] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:42:07,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74979401] [2025-04-13 22:42:07,355 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:42:07,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:07,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:42:07,356 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:42:07,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 22:42:07,432 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:42:07,463 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:42:07,463 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:42:07,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:07,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 22:42:07,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:42:07,493 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-13 22:42:07,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:42:07,570 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-13 22:42:07,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74979401] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:42:07,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:42:07,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 7 [2025-04-13 22:42:07,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540669751] [2025-04-13 22:42:07,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:42:07,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:42:07,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:07,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:42:07,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:42:07,571 INFO L87 Difference]: Start difference. First operand 6858 states and 32206 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:07,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:07,815 INFO L93 Difference]: Finished difference Result 7194 states and 33305 transitions. [2025-04-13 22:42:07,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:42:07,816 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 22:42:07,816 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:07,844 INFO L225 Difference]: With dead ends: 7194 [2025-04-13 22:42:07,844 INFO L226 Difference]: Without dead ends: 606 [2025-04-13 22:42:07,852 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:42:07,852 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:07,852 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:42:07,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-04-13 22:42:07,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 567. [2025-04-13 22:42:07,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 2.7738515901060072) internal successors, (1570), 566 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:07,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1570 transitions. [2025-04-13 22:42:07,969 INFO L79 Accepts]: Start accepts. Automaton has 567 states and 1570 transitions. Word has length 44 [2025-04-13 22:42:07,969 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:07,969 INFO L485 AbstractCegarLoop]: Abstraction has 567 states and 1570 transitions. [2025-04-13 22:42:07,969 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:07,969 INFO L278 IsEmpty]: Start isEmpty. Operand 567 states and 1570 transitions. [2025-04-13 22:42:07,970 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:42:07,970 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:07,970 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:07,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 22:42:08,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 22:42:08,171 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 1 more)] === [2025-04-13 22:42:08,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:08,171 INFO L85 PathProgramCache]: Analyzing trace with hash 492205251, now seen corresponding path program 5 times [2025-04-13 22:42:08,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:08,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683608201] [2025-04-13 22:42:08,171 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:42:08,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:08,180 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:42:08,191 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:42:08,191 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:42:08,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 22:42:08,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:08,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683608201] [2025-04-13 22:42:08,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683608201] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:42:08,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674204065] [2025-04-13 22:42:08,279 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:42:08,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:08,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:42:08,281 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:42:08,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 22:42:08,363 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:42:08,403 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:42:08,403 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:42:08,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:08,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:42:08,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:42:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 22:42:08,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:42:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 22:42:08,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674204065] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:42:08,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:42:08,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 22:42:08,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628622034] [2025-04-13 22:42:08,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:42:08,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:42:08,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:08,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:42:08,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:42:08,517 INFO L87 Difference]: Start difference. First operand 567 states and 1570 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:08,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:08,856 INFO L93 Difference]: Finished difference Result 1343 states and 3680 transitions. [2025-04-13 22:42:08,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:42:08,857 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 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 47 [2025-04-13 22:42:08,857 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:08,871 INFO L225 Difference]: With dead ends: 1343 [2025-04-13 22:42:08,871 INFO L226 Difference]: Without dead ends: 569 [2025-04-13 22:42:08,872 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:42:08,872 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:08,873 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:42:08,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-04-13 22:42:08,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2025-04-13 22:42:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 2.767605633802817) internal successors, (1572), 568 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 1572 transitions. [2025-04-13 22:42:08,969 INFO L79 Accepts]: Start accepts. Automaton has 569 states and 1572 transitions. Word has length 47 [2025-04-13 22:42:08,969 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:08,969 INFO L485 AbstractCegarLoop]: Abstraction has 569 states and 1572 transitions. [2025-04-13 22:42:08,969 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:08,969 INFO L278 IsEmpty]: Start isEmpty. Operand 569 states and 1572 transitions. [2025-04-13 22:42:08,970 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-13 22:42:08,970 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:08,970 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:08,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 22:42:09,171 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 22:42:09,171 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 1 more)] === [2025-04-13 22:42:09,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:09,171 INFO L85 PathProgramCache]: Analyzing trace with hash 228357610, now seen corresponding path program 6 times [2025-04-13 22:42:09,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:09,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832642747] [2025-04-13 22:42:09,171 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:42:09,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:09,182 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 3 equivalence classes. [2025-04-13 22:42:09,237 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 48 of 48 statements. [2025-04-13 22:42:09,237 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:42:09,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:42:10,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:10,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832642747] [2025-04-13 22:42:10,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832642747] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:42:10,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230235631] [2025-04-13 22:42:10,132 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:42:10,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:10,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:42:10,134 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:42:10,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 22:42:10,209 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 3 equivalence classes. [2025-04-13 22:42:10,250 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 48 of 48 statements. [2025-04-13 22:42:10,250 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:42:10,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:10,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:42:10,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:42:10,284 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 22:42:10,458 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:42:10,458 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 20 [2025-04-13 22:42:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 22:42:10,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:42:10,904 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2025-04-13 22:42:10,911 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 22:42:10,911 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 47 [2025-04-13 22:42:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 22:42:10,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230235631] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:42:10,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:42:10,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 33 [2025-04-13 22:42:10,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062073166] [2025-04-13 22:42:10,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:42:10,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:42:10,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:10,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:42:10,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1007, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:42:10,993 INFO L87 Difference]: Start difference. First operand 569 states and 1572 transitions. Second operand has 34 states, 33 states have (on average 4.03030303030303) internal successors, (133), 34 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:13,074 INFO L93 Difference]: Finished difference Result 2327 states and 6229 transitions. [2025-04-13 22:42:13,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 22:42:13,075 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.03030303030303) internal successors, (133), 34 states have internal predecessors, (133), 0 states have call successors, (0), 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 48 [2025-04-13 22:42:13,075 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:13,091 INFO L225 Difference]: With dead ends: 2327 [2025-04-13 22:42:13,091 INFO L226 Difference]: Without dead ends: 1522 [2025-04-13 22:42:13,093 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=635, Invalid=3655, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 22:42:13,093 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 617 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:13,094 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 0 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1859 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:42:13,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2025-04-13 22:42:13,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 820. [2025-04-13 22:42:13,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 819 states have (on average 2.7765567765567765) internal successors, (2274), 819 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:13,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 2274 transitions. [2025-04-13 22:42:13,263 INFO L79 Accepts]: Start accepts. Automaton has 820 states and 2274 transitions. Word has length 48 [2025-04-13 22:42:13,263 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:13,263 INFO L485 AbstractCegarLoop]: Abstraction has 820 states and 2274 transitions. [2025-04-13 22:42:13,263 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.03030303030303) internal successors, (133), 34 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:13,263 INFO L278 IsEmpty]: Start isEmpty. Operand 820 states and 2274 transitions. [2025-04-13 22:42:13,265 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-13 22:42:13,265 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:13,265 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:13,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 22:42:13,465 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:13,465 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 1 more)] === [2025-04-13 22:42:13,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:13,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1869382173, now seen corresponding path program 7 times [2025-04-13 22:42:13,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:13,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823492196] [2025-04-13 22:42:13,466 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:42:13,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:13,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-13 22:42:13,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-13 22:42:13,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:42:13,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:14,243 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:42:14,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:14,243 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823492196] [2025-04-13 22:42:14,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823492196] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:42:14,243 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109955624] [2025-04-13 22:42:14,243 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:42:14,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:14,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:42:14,245 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:42:14,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 22:42:14,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-13 22:42:14,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-13 22:42:14,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:42:14,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:14,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 22:42:14,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:42:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-13 22:42:14,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:42:14,483 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:42:14,484 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-04-13 22:42:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-13 22:42:14,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109955624] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:42:14,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:42:14,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 5] total 21 [2025-04-13 22:42:14,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960266991] [2025-04-13 22:42:14,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:42:14,518 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:42:14,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:14,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:42:14,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:42:14,519 INFO L87 Difference]: Start difference. First operand 820 states and 2274 transitions. Second operand has 22 states, 21 states have (on average 4.476190476190476) internal successors, (94), 22 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:15,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:15,166 INFO L93 Difference]: Finished difference Result 1006 states and 2698 transitions. [2025-04-13 22:42:15,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:42:15,166 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.476190476190476) internal successors, (94), 22 states have internal predecessors, (94), 0 states have call successors, (0), 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 49 [2025-04-13 22:42:15,166 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:15,187 INFO L225 Difference]: With dead ends: 1006 [2025-04-13 22:42:15,187 INFO L226 Difference]: Without dead ends: 663 [2025-04-13 22:42:15,188 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=1088, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:42:15,189 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 222 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:15,189 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 0 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:42:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-04-13 22:42:15,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 333. [2025-04-13 22:42:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 2.6265060240963853) internal successors, (872), 332 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 872 transitions. [2025-04-13 22:42:15,316 INFO L79 Accepts]: Start accepts. Automaton has 333 states and 872 transitions. Word has length 49 [2025-04-13 22:42:15,317 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:15,317 INFO L485 AbstractCegarLoop]: Abstraction has 333 states and 872 transitions. [2025-04-13 22:42:15,317 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.476190476190476) internal successors, (94), 22 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:15,317 INFO L278 IsEmpty]: Start isEmpty. Operand 333 states and 872 transitions. [2025-04-13 22:42:15,318 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-13 22:42:15,318 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:15,318 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:15,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-13 22:42:15,518 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:15,518 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 1 more)] === [2025-04-13 22:42:15,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:15,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1070143716, now seen corresponding path program 8 times [2025-04-13 22:42:15,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:15,519 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609010646] [2025-04-13 22:42:15,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:42:15,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:15,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-04-13 22:42:15,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-04-13 22:42:15,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:42:15,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:42:15,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:15,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609010646] [2025-04-13 22:42:15,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609010646] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:42:15,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281642076] [2025-04-13 22:42:15,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:42:15,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:15,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:42:15,717 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:42:15,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 22:42:15,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-04-13 22:42:15,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-04-13 22:42:15,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:42:15,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:15,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 22:42:15,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:42:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-13 22:42:16,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:42:16,323 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-13 22:42:16,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281642076] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:42:16,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:42:16,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2025-04-13 22:42:16,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210089580] [2025-04-13 22:42:16,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:42:16,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:42:16,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:16,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:42:16,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:42:16,324 INFO L87 Difference]: Start difference. First operand 333 states and 872 transitions. Second operand has 28 states, 28 states have (on average 5.071428571428571) internal successors, (142), 27 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:16,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:16,826 INFO L93 Difference]: Finished difference Result 764 states and 1989 transitions. [2025-04-13 22:42:16,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:42:16,826 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.071428571428571) internal successors, (142), 27 states have internal predecessors, (142), 0 states have call successors, (0), 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 57 [2025-04-13 22:42:16,826 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:16,842 INFO L225 Difference]: With dead ends: 764 [2025-04-13 22:42:16,843 INFO L226 Difference]: Without dead ends: 334 [2025-04-13 22:42:16,844 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=307, Invalid=1099, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:42:16,844 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:16,844 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:42:16,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-04-13 22:42:16,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-04-13 22:42:16,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.6216216216216215) internal successors, (873), 333 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 873 transitions. [2025-04-13 22:42:16,936 INFO L79 Accepts]: Start accepts. Automaton has 334 states and 873 transitions. Word has length 57 [2025-04-13 22:42:16,936 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:16,936 INFO L485 AbstractCegarLoop]: Abstraction has 334 states and 873 transitions. [2025-04-13 22:42:16,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.071428571428571) internal successors, (142), 27 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:16,937 INFO L278 IsEmpty]: Start isEmpty. Operand 334 states and 873 transitions. [2025-04-13 22:42:16,937 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-13 22:42:16,937 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:16,937 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:16,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-13 22:42:17,142 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:17,142 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 1 more)] === [2025-04-13 22:42:17,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:17,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1020107384, now seen corresponding path program 9 times [2025-04-13 22:42:17,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:17,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868587451] [2025-04-13 22:42:17,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:42:17,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:17,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 7 equivalence classes. [2025-04-13 22:42:17,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 52 of 58 statements. [2025-04-13 22:42:17,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:42:17,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:17,906 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-13 22:42:17,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:17,907 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868587451] [2025-04-13 22:42:17,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868587451] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:42:17,907 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751500492] [2025-04-13 22:42:17,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:42:17,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:17,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:42:17,910 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:42:17,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 22:42:18,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 7 equivalence classes. [2025-04-13 22:42:18,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 52 of 58 statements. [2025-04-13 22:42:18,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:42:18,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:18,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 22:42:18,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:42:18,504 INFO L325 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2025-04-13 22:42:18,504 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 23 [2025-04-13 22:42:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-13 22:42:18,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:42:18,819 INFO L325 Elim1Store]: treesize reduction 10, result has 47.4 percent of original size [2025-04-13 22:42:18,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 16 [2025-04-13 22:42:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-13 22:42:19,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751500492] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:42:19,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:42:19,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2025-04-13 22:42:19,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4602746] [2025-04-13 22:42:19,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:42:19,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 22:42:19,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:19,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 22:42:19,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1454, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:42:19,130 INFO L87 Difference]: Start difference. First operand 334 states and 873 transitions. Second operand has 42 states, 41 states have (on average 4.024390243902439) internal successors, (165), 42 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:21,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:21,888 INFO L93 Difference]: Finished difference Result 2190 states and 5721 transitions. [2025-04-13 22:42:21,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 22:42:21,889 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 4.024390243902439) internal successors, (165), 42 states have internal predecessors, (165), 0 states have call successors, (0), 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 58 [2025-04-13 22:42:21,889 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:21,911 INFO L225 Difference]: With dead ends: 2190 [2025-04-13 22:42:21,912 INFO L226 Difference]: Without dead ends: 340 [2025-04-13 22:42:21,915 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1383, Invalid=6627, Unknown=0, NotChecked=0, Total=8010 [2025-04-13 22:42:21,915 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 623 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:21,915 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 0 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2178 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:42:21,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-04-13 22:42:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 335. [2025-04-13 22:42:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 2.6167664670658684) internal successors, (874), 334 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 874 transitions. [2025-04-13 22:42:22,012 INFO L79 Accepts]: Start accepts. Automaton has 335 states and 874 transitions. Word has length 58 [2025-04-13 22:42:22,013 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:22,013 INFO L485 AbstractCegarLoop]: Abstraction has 335 states and 874 transitions. [2025-04-13 22:42:22,013 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 4.024390243902439) internal successors, (165), 42 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:22,013 INFO L278 IsEmpty]: Start isEmpty. Operand 335 states and 874 transitions. [2025-04-13 22:42:22,014 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-13 22:42:22,014 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:22,014 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:22,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 22:42:22,214 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:22,214 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 1 more)] === [2025-04-13 22:42:22,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:22,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1409320194, now seen corresponding path program 10 times [2025-04-13 22:42:22,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:22,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128647193] [2025-04-13 22:42:22,215 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:42:22,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:22,225 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-04-13 22:42:22,265 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-04-13 22:42:22,265 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:42:22,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:23,171 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:42:23,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:23,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128647193] [2025-04-13 22:42:23,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128647193] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:42:23,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769393911] [2025-04-13 22:42:23,171 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:42:23,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:23,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:42:23,173 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:42:23,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 22:42:23,262 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-04-13 22:42:23,306 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-04-13 22:42:23,306 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:42:23,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:23,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 22:42:23,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:42:23,421 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-04-13 22:42:23,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:42:23,459 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:42:23,459 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-04-13 22:42:23,498 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:42:23,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769393911] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:42:23,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:42:23,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 6, 5] total 26 [2025-04-13 22:42:23,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370572468] [2025-04-13 22:42:23,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:42:23,499 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:42:23,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:23,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:42:23,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:42:23,499 INFO L87 Difference]: Start difference. First operand 335 states and 874 transitions. Second operand has 27 states, 26 states have (on average 4.076923076923077) internal successors, (106), 27 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:24,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:24,401 INFO L93 Difference]: Finished difference Result 565 states and 1453 transitions. [2025-04-13 22:42:24,401 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:42:24,401 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.076923076923077) internal successors, (106), 27 states have internal predecessors, (106), 0 states have call successors, (0), 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 59 [2025-04-13 22:42:24,402 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:24,418 INFO L225 Difference]: With dead ends: 565 [2025-04-13 22:42:24,418 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 22:42:24,419 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=348, Invalid=1908, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:42:24,419 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 204 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:24,420 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 0 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:42:24,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 22:42:24,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 22:42:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:24,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 22:42:24,432 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2025-04-13 22:42:24,432 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:24,432 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 22:42:24,433 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.076923076923077) internal successors, (106), 27 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:24,433 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 22:42:24,433 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 22:42:24,435 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 22:42:24,435 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 22:42:24,435 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 22:42:24,436 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 22:42:24,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 22:42:24,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:24,638 INFO L422 BasicCegarLoop]: Path program histogram: [10, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:24,640 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:42:24,640 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:42:24,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:42:24 BasicIcfg [2025-04-13 22:42:24,642 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:42:24,642 INFO L158 Benchmark]: Toolchain (without parser) took 54565.26ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 96.9MB in the beginning and 287.9MB in the end (delta: -191.0MB). Peak memory consumption was 296.8MB. Max. memory is 8.0GB. [2025-04-13 22:42:24,642 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:42:24,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.77ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 80.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 22:42:24,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.75ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 77.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:42:24,643 INFO L158 Benchmark]: Boogie Preprocessor took 34.08ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 75.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:42:24,643 INFO L158 Benchmark]: IcfgBuilder took 910.08ms. Allocated memory is still 142.6MB. Free memory was 75.3MB in the beginning and 30.9MB in the end (delta: 44.4MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. [2025-04-13 22:42:24,643 INFO L158 Benchmark]: TraceAbstraction took 53312.51ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 30.2MB in the beginning and 287.9MB in the end (delta: -257.7MB). Peak memory consumption was 231.0MB. Max. memory is 8.0GB. [2025-04-13 22:42:24,644 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.77ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 80.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.75ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 77.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.08ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 75.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 910.08ms. Allocated memory is still 142.6MB. Free memory was 75.3MB in the beginning and 30.9MB in the end (delta: 44.4MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. * TraceAbstraction took 53312.51ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 30.2MB in the beginning and 287.9MB in the end (delta: -257.7MB). Peak memory consumption was 231.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 162]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 47 locations, 71 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 53.2s, OverallIterations: 33, TraceHistogramMax: 4, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.1s, AutomataDifference: 25.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4401 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4401 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 384 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14700 IncrementalHoareTripleChecker+Invalid, 15084 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 384 mSolverCounterUnsat, 0 mSDtfsCounter, 14700 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1782 GetRequests, 1262 SyntacticMatches, 3 SemanticMatches, 517 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4376 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6858occurred in iteration=26, InterpolantAutomatonStates: 346, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 21889 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 1777 NumberOfCodeBlocks, 1759 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 2413 ConstructedInterpolants, 35 QuantifiedInterpolants, 20436 SizeOfPredicates, 132 NumberOfNonLiveVariables, 6655 ConjunctsInSsa, 295 ConjunctsInUnsatCore, 69 InterpolantComputations, 15 PerfectInterpolantSequences, 710/1019 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 22:42:24,656 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...