/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:42:45,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:42:45,795 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 18:42:45,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:42:45,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:42:45,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:42:45,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:42:45,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:42:45,824 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:42:45,825 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:42:45,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:42:45,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:42:45,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:42:45,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:42:45,826 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:42:45,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:42:45,826 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:42:45,826 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:42:45,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:42:45,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:42:45,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:42:45,826 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:42:45,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:42:45,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:42:45,827 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:42:45,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:42:45,827 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:42:45,827 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:42:45,827 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:42:45,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:42:45,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:42:45,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:42:45,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:42:45,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:42:45,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:42:45,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:42:45,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:42:45,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:42:45,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:42:45,827 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:42:45,827 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:42:45,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:42:45,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:42:45,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:42:45,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:42:45,828 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:42:45,828 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:42:45,828 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 18:42:46,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:42:46,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:42:46,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:42:46,048 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:42:46,048 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:42:46,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c [2025-04-13 18:42:47,352 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6b916988/7fa3ec8c3c63439b953ef618c208ba1d/FLAG7f22aade0 [2025-04-13 18:42:47,560 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:42:47,561 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c [2025-04-13 18:42:47,568 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6b916988/7fa3ec8c3c63439b953ef618c208ba1d/FLAG7f22aade0 [2025-04-13 18:42:48,401 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6b916988/7fa3ec8c3c63439b953ef618c208ba1d [2025-04-13 18:42:48,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:42:48,405 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:42:48,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:42:48,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:42:48,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:42:48,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:42:48" (1/1) ... [2025-04-13 18:42:48,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@708192af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:42:48, skipping insertion in model container [2025-04-13 18:42:48,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:42:48" (1/1) ... [2025-04-13 18:42:48,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:42:48,590 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-queue-add-3.wvr.c[3451,3464] [2025-04-13 18:42:48,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:42:48,614 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:42:48,647 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-queue-add-3.wvr.c[3451,3464] [2025-04-13 18:42:48,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:42:48,661 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:42:48,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:42:48 WrapperNode [2025-04-13 18:42:48,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:42:48,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:42:48,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:42:48,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:42:48,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:42:48" (1/1) ... [2025-04-13 18:42:48,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:42:48" (1/1) ... [2025-04-13 18:42:48,693 INFO L138 Inliner]: procedures = 24, calls = 40, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 224 [2025-04-13 18:42:48,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:42:48,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:42:48,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:42:48,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:42:48,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:42:48" (1/1) ... [2025-04-13 18:42:48,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:42:48" (1/1) ... [2025-04-13 18:42:48,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:42:48" (1/1) ... [2025-04-13 18:42:48,719 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 18:42:48,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:42:48" (1/1) ... [2025-04-13 18:42:48,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:42:48" (1/1) ... [2025-04-13 18:42:48,724 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:42:48" (1/1) ... [2025-04-13 18:42:48,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:42:48" (1/1) ... [2025-04-13 18:42:48,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:42:48" (1/1) ... [2025-04-13 18:42:48,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:42:48" (1/1) ... [2025-04-13 18:42:48,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:42:48" (1/1) ... [2025-04-13 18:42:48,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:42:48,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:42:48,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:42:48,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:42:48,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:42:48" (1/1) ... [2025-04-13 18:42:48,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:42:48,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:42:48,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 18:42:48,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 18:42:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:42:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:42:48,785 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:42:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:42:48,785 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:42:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:42:48,785 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:42:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:42:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:42:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:42:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:42:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 18:42:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 18:42:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:42:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:42:48,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:42:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:42:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:42:48,786 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:42:48,864 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:42:48,866 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:42:49,113 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:42:49,114 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:42:49,114 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:42:49,350 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:42:49,352 INFO L313 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-13 18:42:49,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:42:49 BoogieIcfgContainer [2025-04-13 18:42:49,352 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:42:49,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:42:49,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:42:49,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:42:49,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:42:48" (1/3) ... [2025-04-13 18:42:49,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@632f641c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:42:49, skipping insertion in model container [2025-04-13 18:42:49,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:42:48" (2/3) ... [2025-04-13 18:42:49,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@632f641c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:42:49, skipping insertion in model container [2025-04-13 18:42:49,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:42:49" (3/3) ... [2025-04-13 18:42:49,360 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2025-04-13 18:42:49,369 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:42:49,370 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-queue-add-3.wvr.c that has 4 procedures, 30 locations, 34 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-13 18:42:49,371 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:42:49,408 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 18:42:49,431 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 37 transitions, 95 flow [2025-04-13 18:42:49,473 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 342 states, 341 states have (on average 3.8181818181818183) internal successors, (1302), 341 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:49,497 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:42:49,505 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;@58067c03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:42:49,506 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 18:42:49,508 INFO L278 IsEmpty]: Start isEmpty. Operand has 342 states, 341 states have (on average 3.8181818181818183) internal successors, (1302), 341 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:49,518 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:42:49,518 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:42:49,519 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] [2025-04-13 18:42:49,519 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 18:42:49,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:42:49,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1349476475, now seen corresponding path program 1 times [2025-04-13 18:42:49,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:42:49,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133930760] [2025-04-13 18:42:49,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:42:49,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:42:49,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 18:42:49,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:42:49,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:42:49,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:49,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:42:49,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:42:49,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133930760] [2025-04-13 18:42:49,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133930760] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:42:49,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:42:49,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:42:49,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200099820] [2025-04-13 18:42:49,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:42:49,689 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 18:42:49,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:42:49,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 18:42:49,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 18:42:49,708 INFO L87 Difference]: Start difference. First operand has 342 states, 341 states have (on average 3.8181818181818183) internal successors, (1302), 341 states have internal predecessors, (1302), 0 states have call successors, (0), 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 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:49,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:42:49,788 INFO L93 Difference]: Finished difference Result 464 states and 1650 transitions. [2025-04-13 18:42:49,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 18:42:49,790 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-04-13 18:42:49,790 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:42:49,800 INFO L225 Difference]: With dead ends: 464 [2025-04-13 18:42:49,800 INFO L226 Difference]: Without dead ends: 342 [2025-04-13 18:42:49,802 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 18:42:49,807 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:42:49,808 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:42:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-04-13 18:42:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-04-13 18:42:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 3.436950146627566) internal successors, (1172), 341 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:49,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1172 transitions. [2025-04-13 18:42:49,851 INFO L79 Accepts]: Start accepts. Automaton has 342 states and 1172 transitions. Word has length 20 [2025-04-13 18:42:49,851 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:42:49,851 INFO L485 AbstractCegarLoop]: Abstraction has 342 states and 1172 transitions. [2025-04-13 18:42:49,851 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:49,852 INFO L278 IsEmpty]: Start isEmpty. Operand 342 states and 1172 transitions. [2025-04-13 18:42:49,857 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 18:42:49,857 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:42:49,858 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] [2025-04-13 18:42:49,858 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:42:49,858 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 18:42:49,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:42:49,858 INFO L85 PathProgramCache]: Analyzing trace with hash 452635313, now seen corresponding path program 1 times [2025-04-13 18:42:49,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:42:49,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423289125] [2025-04-13 18:42:49,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:42:49,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:42:49,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 18:42:49,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:42:49,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:42:49,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:42:50,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:42:50,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423289125] [2025-04-13 18:42:50,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423289125] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:42:50,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:42:50,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:42:50,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309865544] [2025-04-13 18:42:50,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:42:50,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:42:50,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:42:50,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:42:50,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:42:50,036 INFO L87 Difference]: Start difference. First operand 342 states and 1172 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:42:50,102 INFO L93 Difference]: Finished difference Result 618 states and 2098 transitions. [2025-04-13 18:42:50,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:42:50,103 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-04-13 18:42:50,103 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:42:50,105 INFO L225 Difference]: With dead ends: 618 [2025-04-13 18:42:50,105 INFO L226 Difference]: Without dead ends: 356 [2025-04-13 18:42:50,106 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:42:50,109 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:42:50,109 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:42:50,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-04-13 18:42:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-04-13 18:42:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 3.250704225352113) internal successors, (1154), 355 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 1154 transitions. [2025-04-13 18:42:50,129 INFO L79 Accepts]: Start accepts. Automaton has 356 states and 1154 transitions. Word has length 23 [2025-04-13 18:42:50,129 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:42:50,129 INFO L485 AbstractCegarLoop]: Abstraction has 356 states and 1154 transitions. [2025-04-13 18:42:50,129 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:50,129 INFO L278 IsEmpty]: Start isEmpty. Operand 356 states and 1154 transitions. [2025-04-13 18:42:50,130 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 18:42:50,130 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:42:50,130 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] [2025-04-13 18:42:50,130 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:42:50,131 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 18:42:50,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:42:50,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1897525209, now seen corresponding path program 2 times [2025-04-13 18:42:50,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:42:50,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196854971] [2025-04-13 18:42:50,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:42:50,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:42:50,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-04-13 18:42:50,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:42:50,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:42:50,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:42:50,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:42:50,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196854971] [2025-04-13 18:42:50,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196854971] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:42:50,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:42:50,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:42:50,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326209799] [2025-04-13 18:42:50,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:42:50,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:42:50,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:42:50,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:42:50,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:42:50,290 INFO L87 Difference]: Start difference. First operand 356 states and 1154 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:42:50,390 INFO L93 Difference]: Finished difference Result 712 states and 2309 transitions. [2025-04-13 18:42:50,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:42:50,391 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-04-13 18:42:50,391 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:42:50,394 INFO L225 Difference]: With dead ends: 712 [2025-04-13 18:42:50,394 INFO L226 Difference]: Without dead ends: 357 [2025-04-13 18:42:50,395 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:42:50,396 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:42:50,396 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:42:50,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-04-13 18:42:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-04-13 18:42:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 3.24438202247191) internal successors, (1155), 356 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1155 transitions. [2025-04-13 18:42:50,413 INFO L79 Accepts]: Start accepts. Automaton has 357 states and 1155 transitions. Word has length 23 [2025-04-13 18:42:50,413 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:42:50,413 INFO L485 AbstractCegarLoop]: Abstraction has 357 states and 1155 transitions. [2025-04-13 18:42:50,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:50,413 INFO L278 IsEmpty]: Start isEmpty. Operand 357 states and 1155 transitions. [2025-04-13 18:42:50,414 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 18:42:50,414 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:42:50,414 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] [2025-04-13 18:42:50,415 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:42:50,415 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 18:42:50,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:42:50,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1508162401, now seen corresponding path program 1 times [2025-04-13 18:42:50,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:42:50,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594964133] [2025-04-13 18:42:50,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:42:50,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:42:50,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 18:42:50,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:42:50,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:42:50,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:50,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:42:50,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:42:50,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594964133] [2025-04-13 18:42:50,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594964133] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:42:50,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:42:50,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:42:50,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109263670] [2025-04-13 18:42:50,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:42:50,556 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:42:50,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:42:50,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:42:50,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:42:50,557 INFO L87 Difference]: Start difference. First operand 357 states and 1155 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 18:42:50,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:42:50,641 INFO L93 Difference]: Finished difference Result 798 states and 2596 transitions. [2025-04-13 18:42:50,642 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:42:50,642 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 18:42:50,642 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:42:50,644 INFO L225 Difference]: With dead ends: 798 [2025-04-13 18:42:50,644 INFO L226 Difference]: Without dead ends: 358 [2025-04-13 18:42:50,645 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:42:50,645 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:42:50,648 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:42:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-04-13 18:42:50,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2025-04-13 18:42:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 3.238095238095238) internal successors, (1156), 357 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1156 transitions. [2025-04-13 18:42:50,664 INFO L79 Accepts]: Start accepts. Automaton has 358 states and 1156 transitions. Word has length 24 [2025-04-13 18:42:50,664 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:42:50,664 INFO L485 AbstractCegarLoop]: Abstraction has 358 states and 1156 transitions. [2025-04-13 18:42:50,664 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 18:42:50,664 INFO L278 IsEmpty]: Start isEmpty. Operand 358 states and 1156 transitions. [2025-04-13 18:42:50,665 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:42:50,665 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:42:50,665 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] [2025-04-13 18:42:50,666 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:42:50,666 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 18:42:50,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:42:50,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1492674152, now seen corresponding path program 1 times [2025-04-13 18:42:50,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:42:50,666 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470068673] [2025-04-13 18:42:50,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:42:50,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:42:50,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:42:50,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:42:50,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:42:50,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:50,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:42:50,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:42:50,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470068673] [2025-04-13 18:42:50,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470068673] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:42:50,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:42:50,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:42:50,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701515851] [2025-04-13 18:42:50,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:42:50,841 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:42:50,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:42:50,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:42:50,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:42:50,842 INFO L87 Difference]: Start difference. First operand 358 states and 1156 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:42:51,004 INFO L93 Difference]: Finished difference Result 694 states and 2220 transitions. [2025-04-13 18:42:51,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:42:51,005 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-04-13 18:42:51,005 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:42:51,009 INFO L225 Difference]: With dead ends: 694 [2025-04-13 18:42:51,009 INFO L226 Difference]: Without dead ends: 662 [2025-04-13 18:42:51,009 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:42:51,009 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:42:51,010 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:42:51,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-04-13 18:42:51,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 480. [2025-04-13 18:42:51,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 3.154488517745303) internal successors, (1511), 479 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 1511 transitions. [2025-04-13 18:42:51,029 INFO L79 Accepts]: Start accepts. Automaton has 480 states and 1511 transitions. Word has length 25 [2025-04-13 18:42:51,030 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:42:51,030 INFO L485 AbstractCegarLoop]: Abstraction has 480 states and 1511 transitions. [2025-04-13 18:42:51,030 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:51,030 INFO L278 IsEmpty]: Start isEmpty. Operand 480 states and 1511 transitions. [2025-04-13 18:42:51,031 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:42:51,031 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:42:51,031 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 18:42:51,031 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:42:51,031 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 18:42:51,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:42:51,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1337756404, now seen corresponding path program 1 times [2025-04-13 18:42:51,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:42:51,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160648594] [2025-04-13 18:42:51,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:42:51,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:42:51,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:42:51,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:42:51,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:42:51,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:42:51,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:42:51,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160648594] [2025-04-13 18:42:51,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160648594] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:42:51,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533801876] [2025-04-13 18:42:51,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:42:51,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:42:51,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:42:51,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:42:51,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 18:42:51,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:42:51,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:42:51,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:42:51,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:51,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:42:51,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:42:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:42:51,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:42:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:42:51,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533801876] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:42:51,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:42:51,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 18:42:51,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020423474] [2025-04-13 18:42:51,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:42:51,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:42:51,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:42:51,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:42:51,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:42:51,432 INFO L87 Difference]: Start difference. First operand 480 states and 1511 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:51,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:42:51,616 INFO L93 Difference]: Finished difference Result 1194 states and 3827 transitions. [2025-04-13 18:42:51,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:42:51,616 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 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 18:42:51,617 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:42:51,622 INFO L225 Difference]: With dead ends: 1194 [2025-04-13 18:42:51,622 INFO L226 Difference]: Without dead ends: 726 [2025-04-13 18:42:51,623 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:42:51,624 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:42:51,624 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:42:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-04-13 18:42:51,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 514. [2025-04-13 18:42:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 513 states have (on average 3.124756335282651) internal successors, (1603), 513 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1603 transitions. [2025-04-13 18:42:51,661 INFO L79 Accepts]: Start accepts. Automaton has 514 states and 1603 transitions. Word has length 27 [2025-04-13 18:42:51,661 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:42:51,661 INFO L485 AbstractCegarLoop]: Abstraction has 514 states and 1603 transitions. [2025-04-13 18:42:51,661 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:51,661 INFO L278 IsEmpty]: Start isEmpty. Operand 514 states and 1603 transitions. [2025-04-13 18:42:51,662 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:42:51,663 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:42:51,663 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] [2025-04-13 18:42:51,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 18:42:51,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 18:42:51,863 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 18:42:51,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:42:51,864 INFO L85 PathProgramCache]: Analyzing trace with hash 903513782, now seen corresponding path program 1 times [2025-04-13 18:42:51,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:42:51,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472956637] [2025-04-13 18:42:51,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:42:51,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:42:51,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:42:51,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:42:51,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:42:51,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:52,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:42:52,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:42:52,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472956637] [2025-04-13 18:42:52,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472956637] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:42:52,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364332282] [2025-04-13 18:42:52,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:42:52,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:42:52,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:42:52,007 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:42:52,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 18:42:52,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:42:52,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:42:52,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:42:52,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:52,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 18:42:52,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:42:52,135 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 18:42:52,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:42:52,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364332282] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:42:52,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:42:52,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-04-13 18:42:52,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624398102] [2025-04-13 18:42:52,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:42:52,136 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:42:52,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:42:52,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:42:52,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:42:52,136 INFO L87 Difference]: Start difference. First operand 514 states and 1603 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:42:52,250 INFO L93 Difference]: Finished difference Result 1216 states and 3885 transitions. [2025-04-13 18:42:52,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:42:52,250 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 18:42:52,250 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:42:52,255 INFO L225 Difference]: With dead ends: 1216 [2025-04-13 18:42:52,255 INFO L226 Difference]: Without dead ends: 922 [2025-04-13 18:42:52,256 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:42:52,256 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:42:52,256 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:42:52,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-04-13 18:42:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 828. [2025-04-13 18:42:52,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 3.158403869407497) internal successors, (2612), 827 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:52,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 2612 transitions. [2025-04-13 18:42:52,293 INFO L79 Accepts]: Start accepts. Automaton has 828 states and 2612 transitions. Word has length 27 [2025-04-13 18:42:52,293 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:42:52,293 INFO L485 AbstractCegarLoop]: Abstraction has 828 states and 2612 transitions. [2025-04-13 18:42:52,295 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:52,295 INFO L278 IsEmpty]: Start isEmpty. Operand 828 states and 2612 transitions. [2025-04-13 18:42:52,297 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:42:52,297 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:42:52,297 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] [2025-04-13 18:42:52,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 18:42:52,497 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,SelfDestructingSolverStorable6 [2025-04-13 18:42:52,498 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 18:42:52,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:42:52,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1921565734, now seen corresponding path program 2 times [2025-04-13 18:42:52,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:42:52,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868755180] [2025-04-13 18:42:52,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:42:52,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:42:52,511 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:42:52,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-04-13 18:42:52,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:42:52,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:42:52,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:42:52,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868755180] [2025-04-13 18:42:52,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868755180] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:42:52,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:42:52,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:42:52,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959312397] [2025-04-13 18:42:52,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:42:52,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:42:52,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:42:52,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:42:52,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:42:52,680 INFO L87 Difference]: Start difference. First operand 828 states and 2612 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:52,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:42:52,867 INFO L93 Difference]: Finished difference Result 932 states and 2917 transitions. [2025-04-13 18:42:52,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:42:52,868 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:42:52,868 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:42:52,873 INFO L225 Difference]: With dead ends: 932 [2025-04-13 18:42:52,873 INFO L226 Difference]: Without dead ends: 872 [2025-04-13 18:42:52,875 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:42:52,875 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:42:52,875 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:42:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-04-13 18:42:52,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 861. [2025-04-13 18:42:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 860 states have (on average 3.1511627906976742) internal successors, (2710), 860 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 2710 transitions. [2025-04-13 18:42:52,921 INFO L79 Accepts]: Start accepts. Automaton has 861 states and 2710 transitions. Word has length 28 [2025-04-13 18:42:52,921 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:42:52,921 INFO L485 AbstractCegarLoop]: Abstraction has 861 states and 2710 transitions. [2025-04-13 18:42:52,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:52,922 INFO L278 IsEmpty]: Start isEmpty. Operand 861 states and 2710 transitions. [2025-04-13 18:42:52,924 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:42:52,924 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:42:52,924 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 18:42:52,924 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 18:42:52,924 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 18:42:52,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:42:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1350690294, now seen corresponding path program 1 times [2025-04-13 18:42:52,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:42:52,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97656700] [2025-04-13 18:42:52,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:42:52,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:42:52,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 18:42:52,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:42:52,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:42:52,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:53,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:42:53,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:42:53,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97656700] [2025-04-13 18:42:53,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97656700] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:42:53,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097539448] [2025-04-13 18:42:53,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:42:53,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:42:53,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:42:53,094 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:42:53,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 18:42:53,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 18:42:53,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 18:42:53,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:42:53,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:53,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:42:53,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:42:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:42:53,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:42:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:42:53,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097539448] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:42:53,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:42:53,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-04-13 18:42:53,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486930426] [2025-04-13 18:42:53,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:42:53,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:42:53,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:42:53,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:42:53,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:42:53,285 INFO L87 Difference]: Start difference. First operand 861 states and 2710 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:42:53,532 INFO L93 Difference]: Finished difference Result 1231 states and 3768 transitions. [2025-04-13 18:42:53,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:42:53,532 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 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 18:42:53,532 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:42:53,537 INFO L225 Difference]: With dead ends: 1231 [2025-04-13 18:42:53,537 INFO L226 Difference]: Without dead ends: 844 [2025-04-13 18:42:53,541 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:42:53,542 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:42:53,542 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:42:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2025-04-13 18:42:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 844. [2025-04-13 18:42:53,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 3.1684460260972718) internal successors, (2671), 843 states have internal predecessors, (2671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 2671 transitions. [2025-04-13 18:42:53,579 INFO L79 Accepts]: Start accepts. Automaton has 844 states and 2671 transitions. Word has length 30 [2025-04-13 18:42:53,579 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:42:53,579 INFO L485 AbstractCegarLoop]: Abstraction has 844 states and 2671 transitions. [2025-04-13 18:42:53,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:53,580 INFO L278 IsEmpty]: Start isEmpty. Operand 844 states and 2671 transitions. [2025-04-13 18:42:53,583 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:42:53,583 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:42:53,583 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] [2025-04-13 18:42:53,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 18:42:53,783 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:42:53,783 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 18:42:53,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:42:53,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1798304358, now seen corresponding path program 1 times [2025-04-13 18:42:53,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:42:53,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741039527] [2025-04-13 18:42:53,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:42:53,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:42:53,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 18:42:53,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:42:53,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:42:53,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:42:53,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:42:53,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741039527] [2025-04-13 18:42:53,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741039527] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:42:53,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:42:53,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:42:53,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496163263] [2025-04-13 18:42:53,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:42:53,861 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:42:53,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:42:53,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:42:53,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:42:53,862 INFO L87 Difference]: Start difference. First operand 844 states and 2671 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:54,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:42:54,011 INFO L93 Difference]: Finished difference Result 2286 states and 7646 transitions. [2025-04-13 18:42:54,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:42:54,011 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-13 18:42:54,011 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:42:54,020 INFO L225 Difference]: With dead ends: 2286 [2025-04-13 18:42:54,020 INFO L226 Difference]: Without dead ends: 1609 [2025-04-13 18:42:54,022 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:42:54,022 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:42:54,022 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:42:54,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2025-04-13 18:42:54,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1417. [2025-04-13 18:42:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1416 states have (on average 3.444915254237288) internal successors, (4878), 1416 states have internal predecessors, (4878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 4878 transitions. [2025-04-13 18:42:54,101 INFO L79 Accepts]: Start accepts. Automaton has 1417 states and 4878 transitions. Word has length 31 [2025-04-13 18:42:54,101 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:42:54,101 INFO L485 AbstractCegarLoop]: Abstraction has 1417 states and 4878 transitions. [2025-04-13 18:42:54,101 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:54,101 INFO L278 IsEmpty]: Start isEmpty. Operand 1417 states and 4878 transitions. [2025-04-13 18:42:54,104 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:42:54,104 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:42:54,104 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] [2025-04-13 18:42:54,105 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 18:42:54,105 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 18:42:54,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:42:54,105 INFO L85 PathProgramCache]: Analyzing trace with hash 239828528, now seen corresponding path program 2 times [2025-04-13 18:42:54,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:42:54,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176011169] [2025-04-13 18:42:54,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:42:54,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:42:54,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:42:54,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:42:54,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:42:54,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:54,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:42:54,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:42:54,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176011169] [2025-04-13 18:42:54,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176011169] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:42:54,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491665354] [2025-04-13 18:42:54,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:42:54,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:42:54,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:42:54,241 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:42:54,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 18:42:54,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:42:54,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:42:54,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:42:54,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:54,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:42:54,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:42:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:42:54,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:42:54,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:42:54,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491665354] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:42:54,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:42:54,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-04-13 18:42:54,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950561846] [2025-04-13 18:42:54,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:42:54,610 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:42:54,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:42:54,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:42:54,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:42:54,612 INFO L87 Difference]: Start difference. First operand 1417 states and 4878 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 18 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:55,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:42:55,005 INFO L93 Difference]: Finished difference Result 3633 states and 12586 transitions. [2025-04-13 18:42:55,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:42:55,006 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 18 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-13 18:42:55,006 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:42:55,022 INFO L225 Difference]: With dead ends: 3633 [2025-04-13 18:42:55,023 INFO L226 Difference]: Without dead ends: 2403 [2025-04-13 18:42:55,025 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:42:55,026 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 139 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:42:55,026 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 0 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:42:55,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2025-04-13 18:42:55,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2022. [2025-04-13 18:42:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2022 states, 2021 states have (on average 3.3330034636318655) internal successors, (6736), 2021 states have internal predecessors, (6736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:55,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 6736 transitions. [2025-04-13 18:42:55,132 INFO L79 Accepts]: Start accepts. Automaton has 2022 states and 6736 transitions. Word has length 31 [2025-04-13 18:42:55,132 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:42:55,132 INFO L485 AbstractCegarLoop]: Abstraction has 2022 states and 6736 transitions. [2025-04-13 18:42:55,132 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 18 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:55,132 INFO L278 IsEmpty]: Start isEmpty. Operand 2022 states and 6736 transitions. [2025-04-13 18:42:55,136 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:42:55,136 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:42:55,136 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] [2025-04-13 18:42:55,142 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 18:42:55,337 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:42:55,337 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 18:42:55,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:42:55,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1479738698, now seen corresponding path program 3 times [2025-04-13 18:42:55,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:42:55,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380872795] [2025-04-13 18:42:55,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:42:55,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:42:55,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:42:55,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:42:55,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:42:55,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:55,469 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 18:42:55,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:42:55,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380872795] [2025-04-13 18:42:55,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380872795] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:42:55,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432704390] [2025-04-13 18:42:55,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:42:55,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:42:55,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:42:55,472 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:42:55,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 18:42:55,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-13 18:42:55,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:42:55,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:42:55,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:55,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 18:42:55,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:42:55,601 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 18:42:55,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:42:55,668 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 18:42:55,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432704390] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:42:55,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:42:55,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 18:42:55,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894570030] [2025-04-13 18:42:55,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:42:55,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:42:55,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:42:55,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:42:55,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:42:55,669 INFO L87 Difference]: Start difference. First operand 2022 states and 6736 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 18:42:55,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:42:55,925 INFO L93 Difference]: Finished difference Result 2297 states and 7478 transitions. [2025-04-13 18:42:55,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:42:55,926 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 31 [2025-04-13 18:42:55,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:42:55,934 INFO L225 Difference]: With dead ends: 2297 [2025-04-13 18:42:55,934 INFO L226 Difference]: Without dead ends: 1418 [2025-04-13 18:42:55,936 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:42:55,936 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:42:55,936 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:42:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2025-04-13 18:42:56,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1418. [2025-04-13 18:42:56,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1417 states have (on average 3.4431898376852503) internal successors, (4879), 1417 states have internal predecessors, (4879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:42:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 4879 transitions. [2025-04-13 18:42:56,008 INFO L79 Accepts]: Start accepts. Automaton has 1418 states and 4879 transitions. Word has length 31 [2025-04-13 18:42:56,008 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:42:56,008 INFO L485 AbstractCegarLoop]: Abstraction has 1418 states and 4879 transitions. [2025-04-13 18:42:56,008 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 18:42:56,008 INFO L278 IsEmpty]: Start isEmpty. Operand 1418 states and 4879 transitions. [2025-04-13 18:42:56,010 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 18:42:56,010 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:42:56,010 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-04-13 18:42:56,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 18:42:56,215 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,SelfDestructingSolverStorable11 [2025-04-13 18:42:56,215 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 18:42:56,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:42:56,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1198794963, now seen corresponding path program 4 times [2025-04-13 18:42:56,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:42:56,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403481124] [2025-04-13 18:42:56,215 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:42:56,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:42:56,221 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 18:42:56,234 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:42:56,234 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:42:56,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:42:56,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:42:56,549 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403481124] [2025-04-13 18:42:56,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403481124] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:42:56,549 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445984926] [2025-04-13 18:42:56,549 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:42:56,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:42:56,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:42:56,551 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:42:56,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 18:42:56,599 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-13 18:42:56,627 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:42:56,627 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:42:56,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:42:56,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 18:42:56,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:42:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:42:57,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:42:57,335 INFO L325 Elim1Store]: treesize reduction 23, result has 75.3 percent of original size [2025-04-13 18:42:57,335 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 82 [2025-04-13 18:42:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:42:57,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445984926] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:42:57,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:42:57,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 11] total 31 [2025-04-13 18:42:57,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40642647] [2025-04-13 18:42:57,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:42:57,572 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 18:42:57,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:42:57,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 18:42:57,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:42:57,573 INFO L87 Difference]: Start difference. First operand 1418 states and 4879 transitions. Second operand has 32 states, 32 states have (on average 2.5625) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:43:02,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:43:02,468 INFO L93 Difference]: Finished difference Result 9094 states and 32585 transitions. [2025-04-13 18:43:02,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-13 18:43:02,469 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.5625) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 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 18:43:02,469 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:43:02,514 INFO L225 Difference]: With dead ends: 9094 [2025-04-13 18:43:02,514 INFO L226 Difference]: Without dead ends: 8958 [2025-04-13 18:43:02,518 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2777 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1275, Invalid=8231, Unknown=0, NotChecked=0, Total=9506 [2025-04-13 18:43:02,519 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1521 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2652 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:43:02,519 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 0 Invalid, 2816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2652 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 18:43:02,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8958 states. [2025-04-13 18:43:02,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8958 to 3367. [2025-04-13 18:43:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3367 states, 3366 states have (on average 3.5502079619726676) internal successors, (11950), 3366 states have internal predecessors, (11950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:43:02,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3367 states to 3367 states and 11950 transitions. [2025-04-13 18:43:02,977 INFO L79 Accepts]: Start accepts. Automaton has 3367 states and 11950 transitions. Word has length 32 [2025-04-13 18:43:02,977 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:43:02,978 INFO L485 AbstractCegarLoop]: Abstraction has 3367 states and 11950 transitions. [2025-04-13 18:43:02,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.5625) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:43:02,978 INFO L278 IsEmpty]: Start isEmpty. Operand 3367 states and 11950 transitions. [2025-04-13 18:43:02,984 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 18:43:02,984 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:43:02,984 INFO L218 NwaCegarLoop]: trace histogram [3, 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 18:43:02,990 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 18:43:03,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:43:03,185 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 18:43:03,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:43:03,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2101893546, now seen corresponding path program 5 times [2025-04-13 18:43:03,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:43:03,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096709175] [2025-04-13 18:43:03,185 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:43:03,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:43:03,195 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-04-13 18:43:03,231 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 18:43:03,232 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:43:03,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:43:04,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:43:04,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:43:04,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096709175] [2025-04-13 18:43:04,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096709175] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:43:04,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677739908] [2025-04-13 18:43:04,202 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:43:04,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:43:04,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:43:04,204 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 18:43:04,205 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 18:43:04,258 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-04-13 18:43:04,287 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 18:43:04,288 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:43:04,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:43:04,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:43:04,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:43:04,586 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:43:04,586 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 32 treesize of output 28 [2025-04-13 18:43:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:43:04,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:43:04,846 INFO L325 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2025-04-13 18:43:04,846 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 99 [2025-04-13 18:43:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:43:05,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677739908] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:43:05,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:43:05,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 33 [2025-04-13 18:43:05,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038365531] [2025-04-13 18:43:05,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:43:05,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:43:05,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:43:05,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:43:05,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=989, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:43:05,100 INFO L87 Difference]: Start difference. First operand 3367 states and 11950 transitions. Second operand has 34 states, 34 states have (on average 2.411764705882353) internal successors, (82), 33 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:43:09,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:43:09,359 INFO L93 Difference]: Finished difference Result 10251 states and 36429 transitions. [2025-04-13 18:43:09,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:43:09,359 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.411764705882353) internal successors, (82), 33 states have internal predecessors, (82), 0 states have call successors, (0), 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 33 [2025-04-13 18:43:09,360 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:43:09,380 INFO L225 Difference]: With dead ends: 10251 [2025-04-13 18:43:09,380 INFO L226 Difference]: Without dead ends: 6131 [2025-04-13 18:43:09,386 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=517, Invalid=2789, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 18:43:09,386 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 523 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:43:09,386 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 0 Invalid, 2048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1897 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:43:09,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6131 states. [2025-04-13 18:43:09,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6131 to 3978. [2025-04-13 18:43:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3977 states have (on average 3.4832788534070906) internal successors, (13853), 3977 states have internal predecessors, (13853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:43:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 13853 transitions. [2025-04-13 18:43:09,828 INFO L79 Accepts]: Start accepts. Automaton has 3978 states and 13853 transitions. Word has length 33 [2025-04-13 18:43:09,828 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:43:09,828 INFO L485 AbstractCegarLoop]: Abstraction has 3978 states and 13853 transitions. [2025-04-13 18:43:09,828 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.411764705882353) internal successors, (82), 33 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:43:09,828 INFO L278 IsEmpty]: Start isEmpty. Operand 3978 states and 13853 transitions. [2025-04-13 18:43:09,833 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:43:09,834 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:43:09,834 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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 18:43:09,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 18:43:10,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:43:10,034 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 18:43:10,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:43:10,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2080766114, now seen corresponding path program 6 times [2025-04-13 18:43:10,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:43:10,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706777576] [2025-04-13 18:43:10,035 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:43:10,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:43:10,044 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 3 equivalence classes. [2025-04-13 18:43:10,082 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:43:10,082 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:43:10,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:43:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:43:12,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:43:12,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706777576] [2025-04-13 18:43:12,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706777576] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:43:12,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916911091] [2025-04-13 18:43:12,277 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:43:12,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:43:12,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:43:12,279 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 18:43:12,280 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 18:43:12,331 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 3 equivalence classes. [2025-04-13 18:43:12,353 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:43:12,353 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:43:12,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:43:12,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 18:43:12,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:43:12,500 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 24 treesize of output 8 [2025-04-13 18:43:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 18:43:12,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:43:12,564 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 18:43:12,564 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 24 treesize of output 11 [2025-04-13 18:43:12,584 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 18:43:12,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916911091] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:43:12,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:43:12,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 5] total 22 [2025-04-13 18:43:12,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70454405] [2025-04-13 18:43:12,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:43:12,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 18:43:12,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:43:12,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 18:43:12,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:43:12,585 INFO L87 Difference]: Start difference. First operand 3978 states and 13853 transitions. Second operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:43:15,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:43:15,994 INFO L93 Difference]: Finished difference Result 8287 states and 28528 transitions. [2025-04-13 18:43:15,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:43:15,995 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 34 [2025-04-13 18:43:15,995 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:43:16,027 INFO L225 Difference]: With dead ends: 8287 [2025-04-13 18:43:16,027 INFO L226 Difference]: Without dead ends: 8239 [2025-04-13 18:43:16,031 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=208, Invalid=1514, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 18:43:16,032 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 185 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1909 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:43:16,032 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 0 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1909 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 18:43:16,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8239 states. [2025-04-13 18:43:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8239 to 4379. [2025-04-13 18:43:16,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4379 states, 4378 states have (on average 3.4906349931475558) internal successors, (15282), 4378 states have internal predecessors, (15282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:43:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4379 states to 4379 states and 15282 transitions. [2025-04-13 18:43:16,564 INFO L79 Accepts]: Start accepts. Automaton has 4379 states and 15282 transitions. Word has length 34 [2025-04-13 18:43:16,564 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:43:16,564 INFO L485 AbstractCegarLoop]: Abstraction has 4379 states and 15282 transitions. [2025-04-13 18:43:16,564 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:43:16,564 INFO L278 IsEmpty]: Start isEmpty. Operand 4379 states and 15282 transitions. [2025-04-13 18:43:16,570 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:43:16,570 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:43:16,570 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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 18:43:16,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 18:43:16,770 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,SelfDestructingSolverStorable14 [2025-04-13 18:43:16,771 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 18:43:16,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:43:16,771 INFO L85 PathProgramCache]: Analyzing trace with hash 792812006, now seen corresponding path program 7 times [2025-04-13 18:43:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:43:16,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621824377] [2025-04-13 18:43:16,771 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:43:16,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:43:16,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 18:43:16,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:43:16,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:43:16,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:43:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:43:17,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:43:17,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621824377] [2025-04-13 18:43:17,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621824377] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:43:17,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849883973] [2025-04-13 18:43:17,464 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:43:17,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:43:17,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:43:17,465 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 18:43:17,466 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 18:43:17,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 18:43:17,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:43:17,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:43:17,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:43:17,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 18:43:17,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:43:17,662 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 23 treesize of output 7 [2025-04-13 18:43:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:43:17,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:43:17,792 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 18:43:17,792 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 24 treesize of output 11 [2025-04-13 18:43:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 18:43:17,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849883973] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:43:17,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:43:17,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 7] total 21 [2025-04-13 18:43:17,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664659330] [2025-04-13 18:43:17,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:43:17,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:43:17,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:43:17,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:43:17,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:43:17,819 INFO L87 Difference]: Start difference. First operand 4379 states and 15282 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:43:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:43:18,730 INFO L93 Difference]: Finished difference Result 5279 states and 18293 transitions. [2025-04-13 18:43:18,730 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:43:18,730 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 34 [2025-04-13 18:43:18,730 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:43:18,744 INFO L225 Difference]: With dead ends: 5279 [2025-04-13 18:43:18,744 INFO L226 Difference]: Without dead ends: 5231 [2025-04-13 18:43:18,746 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:43:18,746 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:43:18,746 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:43:18,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5231 states. [2025-04-13 18:43:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5231 to 3898. [2025-04-13 18:43:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3898 states, 3897 states have (on average 3.4837054144213497) internal successors, (13576), 3897 states have internal predecessors, (13576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:43:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 13576 transitions. [2025-04-13 18:43:19,210 INFO L79 Accepts]: Start accepts. Automaton has 3898 states and 13576 transitions. Word has length 34 [2025-04-13 18:43:19,210 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:43:19,210 INFO L485 AbstractCegarLoop]: Abstraction has 3898 states and 13576 transitions. [2025-04-13 18:43:19,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:43:19,210 INFO L278 IsEmpty]: Start isEmpty. Operand 3898 states and 13576 transitions. [2025-04-13 18:43:19,215 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:43:19,215 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:43:19,215 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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 18:43:19,221 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 18:43:19,416 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,SelfDestructingSolverStorable15 [2025-04-13 18:43:19,416 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 18:43:19,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:43:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1138143404, now seen corresponding path program 8 times [2025-04-13 18:43:19,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:43:19,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641230043] [2025-04-13 18:43:19,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:43:19,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:43:19,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:43:19,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 34 statements. [2025-04-13 18:43:19,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:43:19,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:43:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 18:43:19,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:43:19,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641230043] [2025-04-13 18:43:19,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641230043] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:43:19,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:43:19,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:43:19,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163029854] [2025-04-13 18:43:19,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:43:19,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:43:19,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:43:19,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:43:19,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:43:19,585 INFO L87 Difference]: Start difference. First operand 3898 states and 13576 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:43:20,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:43:20,573 INFO L93 Difference]: Finished difference Result 4148 states and 14405 transitions. [2025-04-13 18:43:20,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:43:20,574 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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 34 [2025-04-13 18:43:20,574 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:43:20,586 INFO L225 Difference]: With dead ends: 4148 [2025-04-13 18:43:20,586 INFO L226 Difference]: Without dead ends: 4100 [2025-04-13 18:43:20,587 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:43:20,588 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:43:20,588 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:43:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4100 states. [2025-04-13 18:43:20,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4100 to 3762. [2025-04-13 18:43:21,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3762 states, 3761 states have (on average 3.5110342993884607) internal successors, (13205), 3761 states have internal predecessors, (13205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:43:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3762 states to 3762 states and 13205 transitions. [2025-04-13 18:43:21,013 INFO L79 Accepts]: Start accepts. Automaton has 3762 states and 13205 transitions. Word has length 34 [2025-04-13 18:43:21,013 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:43:21,013 INFO L485 AbstractCegarLoop]: Abstraction has 3762 states and 13205 transitions. [2025-04-13 18:43:21,013 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:43:21,013 INFO L278 IsEmpty]: Start isEmpty. Operand 3762 states and 13205 transitions. [2025-04-13 18:43:21,019 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:43:21,019 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:43:21,019 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] [2025-04-13 18:43:21,019 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 18:43:21,020 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 18:43:21,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:43:21,020 INFO L85 PathProgramCache]: Analyzing trace with hash -725971895, now seen corresponding path program 1 times [2025-04-13 18:43:21,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:43:21,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238317280] [2025-04-13 18:43:21,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:43:21,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:43:21,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 18:43:21,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:43:21,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:43:21,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:43:22,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:43:22,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:43:22,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238317280] [2025-04-13 18:43:22,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238317280] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:43:22,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118650639] [2025-04-13 18:43:22,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:43:22,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:43:22,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:43:22,291 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 18:43:22,292 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 18:43:22,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 18:43:22,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:43:22,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:43:22,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:43:22,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:43:22,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:43:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:43:22,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:43:39,200 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 18:43:39,200 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 87 [2025-04-13 18:43:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:43:39,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118650639] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:43:39,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:43:39,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 8] total 34 [2025-04-13 18:43:39,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061475640] [2025-04-13 18:43:39,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:43:39,351 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 18:43:39,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:43:39,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 18:43:39,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1160, Unknown=4, NotChecked=0, Total=1260 [2025-04-13 18:43:39,352 INFO L87 Difference]: Start difference. First operand 3762 states and 13205 transitions. Second operand has 36 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:43:44,061 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:43:48,083 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:43:52,096 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:43:56,193 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:44:00,216 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:44:04,225 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:44:08,239 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:44:12,247 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:44:16,975 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:44:21,003 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:44:25,013 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:44:29,023 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:44:33,033 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:44:38,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:44:38,931 INFO L93 Difference]: Finished difference Result 5342 states and 18201 transitions. [2025-04-13 18:44:38,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 18:44:38,931 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 states have internal predecessors, (89), 0 states have call successors, (0), 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 34 [2025-04-13 18:44:38,932 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:44:38,945 INFO L225 Difference]: With dead ends: 5342 [2025-04-13 18:44:38,945 INFO L226 Difference]: Without dead ends: 5227 [2025-04-13 18:44:38,946 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=246, Invalid=2941, Unknown=5, NotChecked=0, Total=3192 [2025-04-13 18:44:38,947 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 212 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2622 mSolverCounterSat, 26 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2622 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:44:38,947 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 0 Invalid, 2661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2622 Invalid, 13 Unknown, 0 Unchecked, 53.9s Time] [2025-04-13 18:44:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5227 states. [2025-04-13 18:44:39,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5227 to 3762. [2025-04-13 18:44:39,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3762 states, 3761 states have (on average 3.508907205530444) internal successors, (13197), 3761 states have internal predecessors, (13197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:44:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3762 states to 3762 states and 13197 transitions. [2025-04-13 18:44:39,422 INFO L79 Accepts]: Start accepts. Automaton has 3762 states and 13197 transitions. Word has length 34 [2025-04-13 18:44:39,423 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:44:39,423 INFO L485 AbstractCegarLoop]: Abstraction has 3762 states and 13197 transitions. [2025-04-13 18:44:39,423 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 35 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:44:39,423 INFO L278 IsEmpty]: Start isEmpty. Operand 3762 states and 13197 transitions. [2025-04-13 18:44:39,428 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:44:39,428 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:44:39,428 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] [2025-04-13 18:44:39,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 18:44:39,633 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,SelfDestructingSolverStorable17 [2025-04-13 18:44:39,633 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 18:44:39,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:44:39,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1835021105, now seen corresponding path program 2 times [2025-04-13 18:44:39,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:44:39,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120122676] [2025-04-13 18:44:39,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:44:39,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:44:39,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:44:39,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:44:39,654 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:44:39,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:44:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:44:40,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:44:40,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120122676] [2025-04-13 18:44:40,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120122676] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:44:40,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110599329] [2025-04-13 18:44:40,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:44:40,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:44:40,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:44:40,823 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 18:44:40,824 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 18:44:40,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:44:40,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:44:40,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:44:40,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:44:40,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-13 18:44:40,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:44:41,960 INFO L325 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-04-13 18:44:41,961 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 20 treesize of output 7 [2025-04-13 18:44:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:44:42,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:44:42,921 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 18:44:42,921 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 87 [2025-04-13 18:44:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:44:43,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110599329] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:44:43,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:44:43,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 53 [2025-04-13 18:44:43,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986825135] [2025-04-13 18:44:43,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:44:43,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-04-13 18:44:43,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:44:43,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-04-13 18:44:43,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=2631, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 18:44:43,755 INFO L87 Difference]: Start difference. First operand 3762 states and 13197 transitions. Second operand has 55 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 54 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:00,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:00,403 INFO L93 Difference]: Finished difference Result 6265 states and 20871 transitions. [2025-04-13 18:45:00,404 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-13 18:45:00,404 INFO L79 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 54 states have internal predecessors, (97), 0 states have call successors, (0), 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 34 [2025-04-13 18:45:00,404 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:00,419 INFO L225 Difference]: With dead ends: 6265 [2025-04-13 18:45:00,419 INFO L226 Difference]: Without dead ends: 5817 [2025-04-13 18:45:00,424 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5189 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=2564, Invalid=16896, Unknown=0, NotChecked=0, Total=19460 [2025-04-13 18:45:00,425 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1593 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4829 mSolverCounterSat, 424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 4829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:00,425 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1593 Valid, 0 Invalid, 5253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [424 Valid, 4829 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-04-13 18:45:00,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5817 states. [2025-04-13 18:45:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5817 to 4108. [2025-04-13 18:45:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4108 states, 4107 states have (on average 3.4631117604090575) internal successors, (14223), 4107 states have internal predecessors, (14223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 4108 states and 14223 transitions. [2025-04-13 18:45:01,155 INFO L79 Accepts]: Start accepts. Automaton has 4108 states and 14223 transitions. Word has length 34 [2025-04-13 18:45:01,155 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:01,156 INFO L485 AbstractCegarLoop]: Abstraction has 4108 states and 14223 transitions. [2025-04-13 18:45:01,156 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 54 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:01,156 INFO L278 IsEmpty]: Start isEmpty. Operand 4108 states and 14223 transitions. [2025-04-13 18:45:01,162 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:45:01,162 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:01,162 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] [2025-04-13 18:45:01,168 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 18:45:01,362 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:01,363 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 18:45:01,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:01,363 INFO L85 PathProgramCache]: Analyzing trace with hash -373596205, now seen corresponding path program 3 times [2025-04-13 18:45:01,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:01,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154673120] [2025-04-13 18:45:01,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:45:01,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:01,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:45:01,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:45:01,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:45:01,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:03,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:03,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154673120] [2025-04-13 18:45:03,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154673120] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:03,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61691938] [2025-04-13 18:45:03,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:45:03,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:03,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:03,358 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 18:45:03,378 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 18:45:03,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:45:03,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:45:03,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:45:03,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:03,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 18:45:03,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:45:04,494 INFO L325 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-04-13 18:45:04,495 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 22 treesize of output 7 [2025-04-13 18:45:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:04,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:45:05,817 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 18:45:05,817 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 90 [2025-04-13 18:45:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:06,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61691938] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:45:06,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:45:06,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 51 [2025-04-13 18:45:06,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146764183] [2025-04-13 18:45:06,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:45:06,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-13 18:45:06,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:06,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-13 18:45:06,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=2435, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 18:45:06,752 INFO L87 Difference]: Start difference. First operand 4108 states and 14223 transitions. Second operand has 53 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:16,555 INFO L93 Difference]: Finished difference Result 7822 states and 26794 transitions. [2025-04-13 18:45:16,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 18:45:16,556 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 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 34 [2025-04-13 18:45:16,556 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:16,574 INFO L225 Difference]: With dead ends: 7822 [2025-04-13 18:45:16,574 INFO L226 Difference]: Without dead ends: 7605 [2025-04-13 18:45:16,577 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2530 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1517, Invalid=9403, Unknown=0, NotChecked=0, Total=10920 [2025-04-13 18:45:16,577 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 714 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4207 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 4207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:16,577 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 0 Invalid, 4459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 4207 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-04-13 18:45:16,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7605 states. [2025-04-13 18:45:17,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7605 to 4117. [2025-04-13 18:45:17,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4117 states, 4116 states have (on average 3.4608843537414966) internal successors, (14245), 4116 states have internal predecessors, (14245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4117 states to 4117 states and 14245 transitions. [2025-04-13 18:45:17,371 INFO L79 Accepts]: Start accepts. Automaton has 4117 states and 14245 transitions. Word has length 34 [2025-04-13 18:45:17,371 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:17,371 INFO L485 AbstractCegarLoop]: Abstraction has 4117 states and 14245 transitions. [2025-04-13 18:45:17,371 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:17,371 INFO L278 IsEmpty]: Start isEmpty. Operand 4117 states and 14245 transitions. [2025-04-13 18:45:17,377 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:45:17,377 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:17,377 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] [2025-04-13 18:45:17,384 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 18:45:17,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:17,578 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 18:45:17,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:17,578 INFO L85 PathProgramCache]: Analyzing trace with hash -506528143, now seen corresponding path program 4 times [2025-04-13 18:45:17,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:17,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019839399] [2025-04-13 18:45:17,579 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:45:17,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:17,584 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:45:17,592 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:45:17,593 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:45:17,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:45:18,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:18,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019839399] [2025-04-13 18:45:18,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019839399] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:18,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685974153] [2025-04-13 18:45:18,270 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:45:18,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:18,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:18,272 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 18:45:18,273 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 18:45:18,328 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:45:18,350 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:45:18,350 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:45:18,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:18,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 18:45:18,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:45:18,456 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 18:45:18,500 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 18:45:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:45:19,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:45:20,139 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:45:20,139 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 776 treesize of output 758 [2025-04-13 18:45:20,175 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:45:20,175 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 218 treesize of output 208 [2025-04-13 18:45:20,529 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:45:20,529 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 669 treesize of output 665 [2025-04-13 18:45:25,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:45:25,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685974153] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:45:25,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:45:25,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 13] total 42 [2025-04-13 18:45:25,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018161855] [2025-04-13 18:45:25,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:45:25,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-13 18:45:25,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:25,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-13 18:45:25,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1680, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 18:45:25,621 INFO L87 Difference]: Start difference. First operand 4117 states and 14245 transitions. Second operand has 44 states, 43 states have (on average 2.186046511627907) internal successors, (94), 43 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 18:45:32,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:32,735 INFO L93 Difference]: Finished difference Result 7575 states and 26215 transitions. [2025-04-13 18:45:32,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 18:45:32,735 INFO L79 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.186046511627907) internal successors, (94), 43 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 34 [2025-04-13 18:45:32,735 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:32,751 INFO L225 Difference]: With dead ends: 7575 [2025-04-13 18:45:32,752 INFO L226 Difference]: Without dead ends: 7426 [2025-04-13 18:45:32,753 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1748 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=801, Invalid=5841, Unknown=0, NotChecked=0, Total=6642 [2025-04-13 18:45:32,753 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 569 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3313 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 3313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:32,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 0 Invalid, 3414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 3313 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-04-13 18:45:32,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7426 states. [2025-04-13 18:45:33,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 4321. [2025-04-13 18:45:33,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4321 states, 4320 states have (on average 3.4375) internal successors, (14850), 4320 states have internal predecessors, (14850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 14850 transitions. [2025-04-13 18:45:33,577 INFO L79 Accepts]: Start accepts. Automaton has 4321 states and 14850 transitions. Word has length 34 [2025-04-13 18:45:33,577 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:33,577 INFO L485 AbstractCegarLoop]: Abstraction has 4321 states and 14850 transitions. [2025-04-13 18:45:33,578 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.186046511627907) internal successors, (94), 43 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 18:45:33,578 INFO L278 IsEmpty]: Start isEmpty. Operand 4321 states and 14850 transitions. [2025-04-13 18:45:33,583 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:45:33,583 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:33,583 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] [2025-04-13 18:45:33,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-13 18:45:33,786 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,SelfDestructingSolverStorable20 [2025-04-13 18:45:33,786 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 18:45:33,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:33,787 INFO L85 PathProgramCache]: Analyzing trace with hash -225246135, now seen corresponding path program 5 times [2025-04-13 18:45:33,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:33,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880574334] [2025-04-13 18:45:33,787 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:45:33,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:33,792 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:45:33,806 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:45:33,806 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:45:33,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:35,188 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:35,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:35,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880574334] [2025-04-13 18:45:35,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880574334] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:35,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944206611] [2025-04-13 18:45:35,188 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:45:35,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:35,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:35,190 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 18:45:35,191 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 18:45:35,246 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:45:35,269 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:45:35,269 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:45:35,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:35,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-13 18:45:35,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:45:36,404 INFO L325 Elim1Store]: treesize reduction 66, result has 34.7 percent of original size [2025-04-13 18:45:36,404 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 44 [2025-04-13 18:45:36,597 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:36,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:45:37,355 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 18:45:37,355 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 87 [2025-04-13 18:45:38,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:38,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944206611] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:45:38,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:45:38,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 49 [2025-04-13 18:45:38,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279990462] [2025-04-13 18:45:38,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:45:38,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-04-13 18:45:38,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:38,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-04-13 18:45:38,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2268, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:45:38,345 INFO L87 Difference]: Start difference. First operand 4321 states and 14850 transitions. Second operand has 51 states, 50 states have (on average 1.94) internal successors, (97), 50 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:00,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:00,488 INFO L93 Difference]: Finished difference Result 7007 states and 23187 transitions. [2025-04-13 18:46:00,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-04-13 18:46:00,489 INFO L79 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.94) internal successors, (97), 50 states have internal predecessors, (97), 0 states have call successors, (0), 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 34 [2025-04-13 18:46:00,489 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:00,504 INFO L225 Difference]: With dead ends: 7007 [2025-04-13 18:46:00,504 INFO L226 Difference]: Without dead ends: 6831 [2025-04-13 18:46:00,506 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3620 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=2056, Invalid=13196, Unknown=0, NotChecked=0, Total=15252 [2025-04-13 18:46:00,507 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1005 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5095 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 5095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:00,507 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 0 Invalid, 5321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 5095 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-04-13 18:46:00,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6831 states. [2025-04-13 18:46:01,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6831 to 4466. [2025-04-13 18:46:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4466 states, 4465 states have (on average 3.4091825307950727) internal successors, (15222), 4465 states have internal predecessors, (15222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 15222 transitions. [2025-04-13 18:46:01,482 INFO L79 Accepts]: Start accepts. Automaton has 4466 states and 15222 transitions. Word has length 34 [2025-04-13 18:46:01,482 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:01,482 INFO L485 AbstractCegarLoop]: Abstraction has 4466 states and 15222 transitions. [2025-04-13 18:46:01,482 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.94) internal successors, (97), 50 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:01,482 INFO L278 IsEmpty]: Start isEmpty. Operand 4466 states and 15222 transitions. [2025-04-13 18:46:01,488 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:46:01,488 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:01,489 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] [2025-04-13 18:46:01,494 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 18:46:01,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:46:01,689 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 18:46:01,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:01,689 INFO L85 PathProgramCache]: Analyzing trace with hash -751359629, now seen corresponding path program 6 times [2025-04-13 18:46:01,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:01,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546995752] [2025-04-13 18:46:01,690 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:46:01,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:01,695 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:46:01,705 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:46:01,705 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:46:01,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:02,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:46:02,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:02,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546995752] [2025-04-13 18:46:02,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546995752] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:46:02,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621208163] [2025-04-13 18:46:02,797 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:46:02,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:46:02,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:46:02,798 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 18:46:02,800 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 18:46:02,852 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 2 equivalence classes. [2025-04-13 18:46:02,872 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:46:02,873 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:46:02,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:02,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-04-13 18:46:02,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:46:03,036 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 15 treesize of output 1 [2025-04-13 18:46:03,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 15 treesize of output 1 [2025-04-13 18:46:03,653 INFO L325 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2025-04-13 18:46:03,653 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 24 treesize of output 7 [2025-04-13 18:46:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:46:03,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:46:05,032 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:46:05,033 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 635 treesize of output 619 [2025-04-13 18:46:05,061 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:46:05,061 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 218 treesize of output 208 [2025-04-13 18:46:05,293 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:46:05,294 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 587 treesize of output 589 [2025-04-13 18:46:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:46:10,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621208163] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:46:10,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:46:10,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 50 [2025-04-13 18:46:10,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490830866] [2025-04-13 18:46:10,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:46:10,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-13 18:46:10,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:10,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-13 18:46:10,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=2366, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 18:46:10,405 INFO L87 Difference]: Start difference. First operand 4466 states and 15222 transitions. Second operand has 52 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 51 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:19,353 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-13 18:46:23,851 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-13 18:46:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:42,339 INFO L93 Difference]: Finished difference Result 10556 states and 35077 transitions. [2025-04-13 18:46:42,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-04-13 18:46:42,339 INFO L79 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 51 states have internal predecessors, (97), 0 states have call successors, (0), 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 34 [2025-04-13 18:46:42,339 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:42,361 INFO L225 Difference]: With dead ends: 10556 [2025-04-13 18:46:42,361 INFO L226 Difference]: Without dead ends: 10138 [2025-04-13 18:46:42,363 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5223 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=2790, Invalid=17232, Unknown=0, NotChecked=0, Total=20022 [2025-04-13 18:46:42,364 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1344 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7098 mSolverCounterSat, 492 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 7098 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:42,364 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 0 Invalid, 7592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 7098 Invalid, 2 Unknown, 0 Unchecked, 14.1s Time] [2025-04-13 18:46:42,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10138 states. [2025-04-13 18:46:43,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10138 to 5529. [2025-04-13 18:46:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5529 states, 5528 states have (on average 3.3270622286541243) internal successors, (18392), 5528 states have internal predecessors, (18392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:43,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5529 states to 5529 states and 18392 transitions. [2025-04-13 18:46:43,775 INFO L79 Accepts]: Start accepts. Automaton has 5529 states and 18392 transitions. Word has length 34 [2025-04-13 18:46:43,776 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:43,776 INFO L485 AbstractCegarLoop]: Abstraction has 5529 states and 18392 transitions. [2025-04-13 18:46:43,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 51 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:43,776 INFO L278 IsEmpty]: Start isEmpty. Operand 5529 states and 18392 transitions. [2025-04-13 18:46:43,783 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 18:46:43,783 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:43,783 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] [2025-04-13 18:46:43,789 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 18:46:43,983 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:46:43,983 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 18:46:43,984 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:43,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1316677223, now seen corresponding path program 7 times [2025-04-13 18:46:43,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:43,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721230493] [2025-04-13 18:46:43,984 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:46:43,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:43,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 18:46:43,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:46:43,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:43,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:46:45,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:45,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721230493] [2025-04-13 18:46:45,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721230493] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:46:45,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355776959] [2025-04-13 18:46:45,093 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:46:45,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:46:45,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:46:45,094 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 18:46:45,095 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 18:46:45,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 18:46:45,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 18:46:45,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:45,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:45,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:46:45,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:46:45,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:46:45,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:46:49,773 WARN L849 $PredicateComparison]: unable to prove that (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse0 (select |c_#memory_int#1| ~q2~0.base))) (or (not (= (select .cse0 (+ ~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int#1| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (= c_~N~0 (+ c_~t~0 (select .cse0 (+ ~q2~0.offset (* c_~q2_front~0 4)))))))) is different from false [2025-04-13 18:46:49,931 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 18:46:49,932 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 87 [2025-04-13 18:46:50,083 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 18:46:50,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355776959] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:46:50,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:46:50,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 8] total 35 [2025-04-13 18:46:50,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908105475] [2025-04-13 18:46:50,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:46:50,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 18:46:50,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:50,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 18:46:50,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1163, Unknown=1, NotChecked=68, Total=1332 [2025-04-13 18:46:50,084 INFO L87 Difference]: Start difference. First operand 5529 states and 18392 transitions. Second operand has 37 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 36 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:55,892 INFO L93 Difference]: Finished difference Result 7041 states and 22964 transitions. [2025-04-13 18:46:55,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:46:55,892 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 36 states have internal predecessors, (89), 0 states have call successors, (0), 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 34 [2025-04-13 18:46:55,892 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:55,913 INFO L225 Difference]: With dead ends: 7041 [2025-04-13 18:46:55,913 INFO L226 Difference]: Without dead ends: 6868 [2025-04-13 18:46:55,916 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=223, Invalid=2750, Unknown=1, NotChecked=106, Total=3080 [2025-04-13 18:46:55,916 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 215 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3559 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:55,916 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 0 Invalid, 3806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3559 Invalid, 0 Unknown, 238 Unchecked, 2.4s Time] [2025-04-13 18:46:55,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2025-04-13 18:46:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 5219. [2025-04-13 18:46:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5219 states, 5218 states have (on average 3.3576082790341126) internal successors, (17520), 5218 states have internal predecessors, (17520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5219 states to 5219 states and 17520 transitions. [2025-04-13 18:46:57,363 INFO L79 Accepts]: Start accepts. Automaton has 5219 states and 17520 transitions. Word has length 34 [2025-04-13 18:46:57,364 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:57,364 INFO L485 AbstractCegarLoop]: Abstraction has 5219 states and 17520 transitions. [2025-04-13 18:46:57,364 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 36 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:57,364 INFO L278 IsEmpty]: Start isEmpty. Operand 5219 states and 17520 transitions. [2025-04-13 18:46:57,373 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 18:46:57,373 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:57,373 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-04-13 18:46:57,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 18:46:57,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-13 18:46:57,574 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 18:46:57,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:57,574 INFO L85 PathProgramCache]: Analyzing trace with hash 4911067, now seen corresponding path program 8 times [2025-04-13 18:46:57,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:57,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979890814] [2025-04-13 18:46:57,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:46:57,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:57,581 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 18:46:57,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:46:57,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:46:57,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:58,393 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:46:58,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:58,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979890814] [2025-04-13 18:46:58,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979890814] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:46:58,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158493519] [2025-04-13 18:46:58,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:46:58,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:46:58,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:46:58,395 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 18:46:58,396 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 18:46:58,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 18:46:58,471 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:46:58,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:46:58,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:58,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 18:46:58,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:46:58,622 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 18:46:58,663 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 18:46:59,135 INFO L325 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-04-13 18:46:59,136 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 24 treesize of output 7 [2025-04-13 18:46:59,300 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:46:59,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:47:00,136 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:47:00,136 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 368 treesize of output 362 [2025-04-13 18:47:00,449 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:47:00,450 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 41 treesize of output 37 [2025-04-13 18:47:00,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:47:00,462 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2025-04-13 18:47:00,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:47:00,478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2025-04-13 18:47:00,488 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 18:47:00,488 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 41 treesize of output 1 [2025-04-13 18:47:00,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:47:00,497 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2025-04-13 18:47:00,522 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:47:00,522 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 173 treesize of output 163 [2025-04-13 18:47:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:47:00,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158493519] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:47:00,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:47:00,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 13] total 44 [2025-04-13 18:47:00,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940815190] [2025-04-13 18:47:00,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:47:00,899 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 18:47:00,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:47:00,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 18:47:00,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1827, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 18:47:00,900 INFO L87 Difference]: Start difference. First operand 5219 states and 17520 transitions. Second operand has 46 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 45 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 18:47:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:47:07,153 INFO L93 Difference]: Finished difference Result 6983 states and 23282 transitions. [2025-04-13 18:47:07,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 18:47:07,153 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 45 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 35 [2025-04-13 18:47:07,153 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:47:07,171 INFO L225 Difference]: With dead ends: 6983 [2025-04-13 18:47:07,171 INFO L226 Difference]: Without dead ends: 6823 [2025-04-13 18:47:07,173 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1493 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=720, Invalid=4980, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 18:47:07,173 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 503 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3421 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 3421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:47:07,174 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 0 Invalid, 3536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 3421 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-04-13 18:47:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6823 states. [2025-04-13 18:47:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6823 to 5292. [2025-04-13 18:47:08,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5292 states, 5291 states have (on average 3.35021735021735) internal successors, (17726), 5291 states have internal predecessors, (17726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:47:08,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5292 states to 5292 states and 17726 transitions. [2025-04-13 18:47:08,595 INFO L79 Accepts]: Start accepts. Automaton has 5292 states and 17726 transitions. Word has length 35 [2025-04-13 18:47:08,595 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:47:08,595 INFO L485 AbstractCegarLoop]: Abstraction has 5292 states and 17726 transitions. [2025-04-13 18:47:08,595 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 45 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 18:47:08,595 INFO L278 IsEmpty]: Start isEmpty. Operand 5292 states and 17726 transitions. [2025-04-13 18:47:08,602 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 18:47:08,603 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:47:08,603 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-04-13 18:47:08,609 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 18:47:08,803 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:47:08,803 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 18:47:08,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:47:08,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1805667311, now seen corresponding path program 9 times [2025-04-13 18:47:08,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:47:08,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24719139] [2025-04-13 18:47:08,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:47:08,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:47:08,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-04-13 18:47:08,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 35 statements. [2025-04-13 18:47:08,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:47:08,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:47:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:47:09,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:47:09,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24719139] [2025-04-13 18:47:09,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24719139] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:47:09,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520977011] [2025-04-13 18:47:09,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:47:09,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:47:09,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:47:09,391 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 18:47:09,391 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 18:47:09,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-04-13 18:47:09,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 35 statements. [2025-04-13 18:47:09,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:47:09,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:47:09,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-13 18:47:09,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:47:09,570 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 25 treesize of output 1 [2025-04-13 18:47:09,615 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 18:47:10,083 INFO L325 Elim1Store]: treesize reduction 46, result has 6.1 percent of original size [2025-04-13 18:47:10,084 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 34 treesize of output 13 [2025-04-13 18:47:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:47:10,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:47:11,049 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:47:11,050 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 381 treesize of output 375 [2025-04-13 18:47:11,117 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:47:11,118 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 238 treesize of output 228 [2025-04-13 18:47:11,290 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:47:11,291 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 725 treesize of output 691 [2025-04-13 18:47:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:47:15,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520977011] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:47:15,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:47:15,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 13] total 43 [2025-04-13 18:47:15,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544501454] [2025-04-13 18:47:15,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:47:15,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 18:47:15,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:47:15,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 18:47:15,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1739, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 18:47:15,594 INFO L87 Difference]: Start difference. First operand 5292 states and 17726 transitions. Second operand has 45 states, 44 states have (on average 2.1363636363636362) internal successors, (94), 44 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 18:47:22,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:47:22,564 INFO L93 Difference]: Finished difference Result 7205 states and 23931 transitions. [2025-04-13 18:47:22,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 18:47:22,564 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.1363636363636362) internal successors, (94), 44 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 35 [2025-04-13 18:47:22,564 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:47:22,581 INFO L225 Difference]: With dead ends: 7205 [2025-04-13 18:47:22,581 INFO L226 Difference]: Without dead ends: 7047 [2025-04-13 18:47:22,583 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2146 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1068, Invalid=6764, Unknown=0, NotChecked=0, Total=7832 [2025-04-13 18:47:22,583 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 467 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:47:22,584 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 0 Invalid, 2664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-04-13 18:47:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7047 states. [2025-04-13 18:47:24,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7047 to 5294. [2025-04-13 18:47:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5294 states, 5293 states have (on average 3.3498960891743814) internal successors, (17731), 5293 states have internal predecessors, (17731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:47:24,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5294 states to 5294 states and 17731 transitions. [2025-04-13 18:47:24,025 INFO L79 Accepts]: Start accepts. Automaton has 5294 states and 17731 transitions. Word has length 35 [2025-04-13 18:47:24,025 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:47:24,025 INFO L485 AbstractCegarLoop]: Abstraction has 5294 states and 17731 transitions. [2025-04-13 18:47:24,026 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.1363636363636362) internal successors, (94), 44 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 18:47:24,026 INFO L278 IsEmpty]: Start isEmpty. Operand 5294 states and 17731 transitions. [2025-04-13 18:47:24,032 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 18:47:24,032 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:47:24,032 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-04-13 18:47:24,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 18:47:24,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:47:24,233 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 18:47:24,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:47:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1535377153, now seen corresponding path program 10 times [2025-04-13 18:47:24,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:47:24,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555022650] [2025-04-13 18:47:24,233 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:47:24,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:47:24,239 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 18:47:24,247 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:47:24,247 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:47:24,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:47:24,950 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:47:24,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:47:24,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555022650] [2025-04-13 18:47:24,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555022650] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:47:24,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771770556] [2025-04-13 18:47:24,950 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:47:24,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:47:24,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:47:24,952 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:47:24,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 18:47:25,011 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 18:47:25,032 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:47:25,032 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:47:25,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:47:25,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 18:47:25,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:47:25,151 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 18:47:25,194 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 18:47:25,639 INFO L325 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-04-13 18:47:25,639 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 23 treesize of output 7 [2025-04-13 18:47:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:47:25,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:47:26,756 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:47:26,756 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 776 treesize of output 758 [2025-04-13 18:47:27,072 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:47:27,072 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 41 treesize of output 37 [2025-04-13 18:47:27,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:47:27,085 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2025-04-13 18:47:27,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:47:27,095 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2025-04-13 18:47:27,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:47:27,107 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2025-04-13 18:47:27,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:47:27,117 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2025-04-13 18:47:27,127 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:47:27,127 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 111 treesize of output 107 [2025-04-13 18:47:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:47:27,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771770556] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:47:27,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:47:27,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 13] total 44 [2025-04-13 18:47:27,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272506767] [2025-04-13 18:47:27,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:47:27,597 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 18:47:27,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:47:27,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 18:47:27,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1825, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 18:47:27,598 INFO L87 Difference]: Start difference. First operand 5294 states and 17731 transitions. Second operand has 46 states, 45 states have (on average 2.088888888888889) internal successors, (94), 45 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 18:47:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:47:42,246 INFO L93 Difference]: Finished difference Result 10322 states and 34947 transitions. [2025-04-13 18:47:42,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-04-13 18:47:42,246 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.088888888888889) internal successors, (94), 45 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 35 [2025-04-13 18:47:42,246 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:47:42,270 INFO L225 Difference]: With dead ends: 10322 [2025-04-13 18:47:42,271 INFO L226 Difference]: Without dead ends: 10108 [2025-04-13 18:47:42,273 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6337 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2031, Invalid=16875, Unknown=0, NotChecked=0, Total=18906 [2025-04-13 18:47:42,274 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 884 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4939 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 4939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:47:42,274 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 0 Invalid, 5201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 4939 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-04-13 18:47:42,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10108 states. [2025-04-13 18:47:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10108 to 5365. [2025-04-13 18:47:43,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5365 states, 5364 states have (on average 3.3583146905294554) internal successors, (18014), 5364 states have internal predecessors, (18014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:47:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5365 states to 5365 states and 18014 transitions. [2025-04-13 18:47:43,795 INFO L79 Accepts]: Start accepts. Automaton has 5365 states and 18014 transitions. Word has length 35 [2025-04-13 18:47:43,795 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:47:43,795 INFO L485 AbstractCegarLoop]: Abstraction has 5365 states and 18014 transitions. [2025-04-13 18:47:43,795 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.088888888888889) internal successors, (94), 45 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 18:47:43,796 INFO L278 IsEmpty]: Start isEmpty. Operand 5365 states and 18014 transitions. [2025-04-13 18:47:43,802 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 18:47:43,802 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:47:43,802 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-04-13 18:47:43,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 18:47:44,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:47:44,003 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 18:47:44,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:47:44,003 INFO L85 PathProgramCache]: Analyzing trace with hash -937123661, now seen corresponding path program 11 times [2025-04-13 18:47:44,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:47:44,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560046883] [2025-04-13 18:47:44,003 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:47:44,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:47:44,009 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 3 equivalence classes. [2025-04-13 18:47:44,020 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:47:44,020 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:47:44,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:47:45,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:47:45,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:47:45,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560046883] [2025-04-13 18:47:45,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560046883] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:47:45,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946426609] [2025-04-13 18:47:45,429 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:47:45,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:47:45,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:47:45,431 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:47:45,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 18:47:45,490 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 3 equivalence classes. [2025-04-13 18:47:45,514 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:47:45,514 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:47:45,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:47:45,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 18:47:45,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:47:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:47:46,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:47:54,352 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 18:47:54,352 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 87 [2025-04-13 18:47:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 18:47:54,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946426609] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:47:54,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:47:54,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 8] total 35 [2025-04-13 18:47:54,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715775629] [2025-04-13 18:47:54,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:47:54,483 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 18:47:54,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:47:54,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 18:47:54,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1219, Unknown=2, NotChecked=0, Total=1332 [2025-04-13 18:47:54,484 INFO L87 Difference]: Start difference. First operand 5365 states and 18014 transitions. Second operand has 37 states, 36 states have (on average 2.5) internal successors, (90), 36 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:47:59,298 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:48:03,311 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:48:07,331 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:48:12,229 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:48:16,257 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:48:20,282 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:48:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:48:23,355 INFO L93 Difference]: Finished difference Result 6239 states and 20869 transitions. [2025-04-13 18:48:23,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:48:23,355 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5) internal successors, (90), 36 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 18:48:23,355 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:48:23,372 INFO L225 Difference]: With dead ends: 6239 [2025-04-13 18:48:23,372 INFO L226 Difference]: Without dead ends: 6166 [2025-04-13 18:48:23,373 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=222, Invalid=2226, Unknown=2, NotChecked=0, Total=2450 [2025-04-13 18:48:23,374 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 127 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 18 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2729 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:48:23,374 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 0 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2729 Invalid, 6 Unknown, 0 Unchecked, 26.0s Time] [2025-04-13 18:48:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6166 states. [2025-04-13 18:48:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6166 to 5292. [2025-04-13 18:48:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5292 states, 5291 states have (on average 3.365715365715366) internal successors, (17808), 5291 states have internal predecessors, (17808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:48:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5292 states to 5292 states and 17808 transitions. [2025-04-13 18:48:24,819 INFO L79 Accepts]: Start accepts. Automaton has 5292 states and 17808 transitions. Word has length 35 [2025-04-13 18:48:24,820 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:48:24,820 INFO L485 AbstractCegarLoop]: Abstraction has 5292 states and 17808 transitions. [2025-04-13 18:48:24,820 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5) internal successors, (90), 36 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:48:24,820 INFO L278 IsEmpty]: Start isEmpty. Operand 5292 states and 17808 transitions. [2025-04-13 18:48:24,826 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 18:48:24,826 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:48:24,826 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-04-13 18:48:24,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 18:48:25,026 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 18:48:25,027 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 18:48:25,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:48:25,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1266056970, now seen corresponding path program 12 times [2025-04-13 18:48:25,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:48:25,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816999773] [2025-04-13 18:48:25,027 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:48:25,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:48:25,032 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 3 equivalence classes. [2025-04-13 18:48:25,039 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:48:25,040 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:48:25,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:48:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 18:48:25,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:48:25,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816999773] [2025-04-13 18:48:25,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816999773] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:48:25,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263222496] [2025-04-13 18:48:25,346 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:48:25,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:48:25,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:48:25,347 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:48:25,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 18:48:25,410 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 3 equivalence classes. [2025-04-13 18:48:25,441 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:48:25,441 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:48:25,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:48:25,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:48:25,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:48:25,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:48:25,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:48:29,974 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-13 18:48:29,974 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 87 [2025-04-13 18:48:30,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 18:48:30,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263222496] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:48:30,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:48:30,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 22 [2025-04-13 18:48:30,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009660802] [2025-04-13 18:48:30,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:48:30,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 18:48:30,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:48:30,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 18:48:30,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=479, Unknown=1, NotChecked=0, Total=552 [2025-04-13 18:48:30,102 INFO L87 Difference]: Start difference. First operand 5292 states and 17808 transitions. Second operand has 24 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:48:34,277 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:48:38,289 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:48:42,339 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:48:46,351 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:48:50,851 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:48:54,867 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 18:48:57,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:48:57,249 INFO L93 Difference]: Finished difference Result 5646 states and 18789 transitions. [2025-04-13 18:48:57,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:48:57,250 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 18:48:57,250 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:48:57,265 INFO L225 Difference]: With dead ends: 5646 [2025-04-13 18:48:57,265 INFO L226 Difference]: Without dead ends: 5562 [2025-04-13 18:48:57,266 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=78, Invalid=521, Unknown=1, NotChecked=0, Total=600 [2025-04-13 18:48:57,266 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 133 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 4 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:48:57,267 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 0 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1203 Invalid, 6 Unknown, 0 Unchecked, 24.9s Time] [2025-04-13 18:48:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2025-04-13 18:48:58,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 5194. [2025-04-13 18:48:58,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5194 states, 5193 states have (on average 3.3755054881571347) internal successors, (17529), 5193 states have internal predecessors, (17529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:48:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5194 states to 5194 states and 17529 transitions. [2025-04-13 18:48:58,693 INFO L79 Accepts]: Start accepts. Automaton has 5194 states and 17529 transitions. Word has length 35 [2025-04-13 18:48:58,693 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:48:58,693 INFO L485 AbstractCegarLoop]: Abstraction has 5194 states and 17529 transitions. [2025-04-13 18:48:58,694 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:48:58,694 INFO L278 IsEmpty]: Start isEmpty. Operand 5194 states and 17529 transitions. [2025-04-13 18:48:58,700 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:48:58,700 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:48:58,700 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] [2025-04-13 18:48:58,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 18:48:58,900 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 18:48:58,901 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 18:48:58,901 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:48:58,901 INFO L85 PathProgramCache]: Analyzing trace with hash -160998879, now seen corresponding path program 13 times [2025-04-13 18:48:58,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:48:58,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728501307] [2025-04-13 18:48:58,901 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:48:58,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:48:58,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:48:58,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:48:58,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:48:58,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:48:58,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:48:58,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:48:58,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728501307] [2025-04-13 18:48:58,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728501307] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:48:58,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949774941] [2025-04-13 18:48:58,990 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:48:58,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:48:58,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:48:58,992 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:48:58,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 18:48:59,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:48:59,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:48:59,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:48:59,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:48:59,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:48:59,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:48:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:48:59,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:48:59,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949774941] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:48:59,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:48:59,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-04-13 18:48:59,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037775162] [2025-04-13 18:48:59,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:48:59,138 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:48:59,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:48:59,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:48:59,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:48:59,138 INFO L87 Difference]: Start difference. First operand 5194 states and 17529 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:49:02,121 INFO L93 Difference]: Finished difference Result 8583 states and 29852 transitions. [2025-04-13 18:49:02,121 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:49:02,121 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:49:02,121 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:49:02,141 INFO L225 Difference]: With dead ends: 8583 [2025-04-13 18:49:02,141 INFO L226 Difference]: Without dead ends: 7154 [2025-04-13 18:49:02,144 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:49:02,145 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:49:02,145 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:49:02,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7154 states. [2025-04-13 18:49:03,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7154 to 5967. [2025-04-13 18:49:03,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5967 states, 5966 states have (on average 3.4326181696278915) internal successors, (20479), 5966 states have internal predecessors, (20479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5967 states to 5967 states and 20479 transitions. [2025-04-13 18:49:03,920 INFO L79 Accepts]: Start accepts. Automaton has 5967 states and 20479 transitions. Word has length 36 [2025-04-13 18:49:03,920 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:49:03,920 INFO L485 AbstractCegarLoop]: Abstraction has 5967 states and 20479 transitions. [2025-04-13 18:49:03,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:03,920 INFO L278 IsEmpty]: Start isEmpty. Operand 5967 states and 20479 transitions. [2025-04-13 18:49:03,927 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:49:03,927 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:49:03,927 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-04-13 18:49:03,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 18:49:04,128 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:49:04,128 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 18:49:04,128 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:49:04,129 INFO L85 PathProgramCache]: Analyzing trace with hash -492902309, now seen corresponding path program 1 times [2025-04-13 18:49:04,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:49:04,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368345351] [2025-04-13 18:49:04,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:49:04,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:49:04,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:49:04,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:49:04,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:49:04,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:49:04,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:49:04,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368345351] [2025-04-13 18:49:04,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368345351] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:49:04,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033905899] [2025-04-13 18:49:04,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:49:04,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:49:04,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:49:04,215 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:49:04,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 18:49:04,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:49:04,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:49:04,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:49:04,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:04,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 18:49:04,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:49:04,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:49:04,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:49:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:49:04,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033905899] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:49:04,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:49:04,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-13 18:49:04,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289045503] [2025-04-13 18:49:04,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:49:04,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:49:04,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:49:04,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:49:04,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:49:04,508 INFO L87 Difference]: Start difference. First operand 5967 states and 20479 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:49:07,458 INFO L93 Difference]: Finished difference Result 7590 states and 25272 transitions. [2025-04-13 18:49:07,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:49:07,459 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:49:07,459 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:49:07,478 INFO L225 Difference]: With dead ends: 7590 [2025-04-13 18:49:07,479 INFO L226 Difference]: Without dead ends: 6122 [2025-04-13 18:49:07,482 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:49:07,482 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:49:07,482 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:49:07,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6122 states. [2025-04-13 18:49:09,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6122 to 5503. [2025-04-13 18:49:09,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5503 states, 5502 states have (on average 3.4676481279534714) internal successors, (19079), 5502 states have internal predecessors, (19079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:09,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5503 states to 5503 states and 19079 transitions. [2025-04-13 18:49:09,133 INFO L79 Accepts]: Start accepts. Automaton has 5503 states and 19079 transitions. Word has length 36 [2025-04-13 18:49:09,133 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:49:09,133 INFO L485 AbstractCegarLoop]: Abstraction has 5503 states and 19079 transitions. [2025-04-13 18:49:09,133 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:09,134 INFO L278 IsEmpty]: Start isEmpty. Operand 5503 states and 19079 transitions. [2025-04-13 18:49:09,140 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 18:49:09,140 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:49:09,140 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] [2025-04-13 18:49:09,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 18:49:09,341 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:49:09,341 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 18:49:09,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:49:09,341 INFO L85 PathProgramCache]: Analyzing trace with hash 162485437, now seen corresponding path program 2 times [2025-04-13 18:49:09,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:49:09,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936484319] [2025-04-13 18:49:09,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:49:09,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:49:09,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 18:49:09,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 18:49:09,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:49:09,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:49:09,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:49:09,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936484319] [2025-04-13 18:49:09,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936484319] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:49:09,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969930803] [2025-04-13 18:49:09,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:49:09,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:49:09,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:49:09,738 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:49:09,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 18:49:09,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 18:49:09,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 18:49:09,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:49:09,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:09,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:49:09,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:49:10,182 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 9 treesize of output 3 [2025-04-13 18:49:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:49:10,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:49:10,342 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 18:49:10,342 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 25 treesize of output 12 [2025-04-13 18:49:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:49:10,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969930803] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:49:10,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:49:10,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 30 [2025-04-13 18:49:10,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343690103] [2025-04-13 18:49:10,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:49:10,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 18:49:10,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:49:10,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 18:49:10,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:49:10,670 INFO L87 Difference]: Start difference. First operand 5503 states and 19079 transitions. Second operand has 31 states, 31 states have (on average 2.6774193548387095) internal successors, (83), 30 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:49:19,198 INFO L93 Difference]: Finished difference Result 18162 states and 63515 transitions. [2025-04-13 18:49:19,199 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 18:49:19,199 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.6774193548387095) internal successors, (83), 30 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 18:49:19,199 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:49:19,231 INFO L225 Difference]: With dead ends: 18162 [2025-04-13 18:49:19,231 INFO L226 Difference]: Without dead ends: 11961 [2025-04-13 18:49:19,240 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=761, Invalid=2779, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 18:49:19,240 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 765 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:49:19,240 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 0 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2007 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 18:49:19,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11961 states. [2025-04-13 18:49:21,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11961 to 7978. [2025-04-13 18:49:21,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7978 states, 7977 states have (on average 3.4245957126739377) internal successors, (27318), 7977 states have internal predecessors, (27318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7978 states to 7978 states and 27318 transitions. [2025-04-13 18:49:21,550 INFO L79 Accepts]: Start accepts. Automaton has 7978 states and 27318 transitions. Word has length 37 [2025-04-13 18:49:21,551 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:49:21,551 INFO L485 AbstractCegarLoop]: Abstraction has 7978 states and 27318 transitions. [2025-04-13 18:49:21,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.6774193548387095) internal successors, (83), 30 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:21,551 INFO L278 IsEmpty]: Start isEmpty. Operand 7978 states and 27318 transitions. [2025-04-13 18:49:21,561 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 18:49:21,561 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:49:21,561 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] [2025-04-13 18:49:21,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-13 18:49:21,762 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:49:21,762 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 18:49:21,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:49:21,762 INFO L85 PathProgramCache]: Analyzing trace with hash 470656013, now seen corresponding path program 3 times [2025-04-13 18:49:21,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:49:21,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956441517] [2025-04-13 18:49:21,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:49:21,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:49:21,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 3 equivalence classes. [2025-04-13 18:49:21,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 36 of 37 statements. [2025-04-13 18:49:21,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:49:21,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 18:49:21,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:49:21,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956441517] [2025-04-13 18:49:21,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956441517] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:49:21,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983333791] [2025-04-13 18:49:21,890 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:49:21,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:49:21,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:49:21,892 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:49:21,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 18:49:21,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 3 equivalence classes. [2025-04-13 18:49:22,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 36 of 37 statements. [2025-04-13 18:49:22,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:49:22,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:22,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 18:49:22,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:49:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 18:49:22,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:49:22,168 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 18:49:22,168 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 26 treesize of output 14 [2025-04-13 18:49:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 18:49:22,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983333791] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:49:22,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:49:22,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-04-13 18:49:22,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361639168] [2025-04-13 18:49:22,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:49:22,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:49:22,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:49:22,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:49:22,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:49:22,188 INFO L87 Difference]: Start difference. First operand 7978 states and 27318 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:49:32,067 INFO L93 Difference]: Finished difference Result 26001 states and 98380 transitions. [2025-04-13 18:49:32,067 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:49:32,067 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 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 18:49:32,067 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:49:32,148 INFO L225 Difference]: With dead ends: 26001 [2025-04-13 18:49:32,148 INFO L226 Difference]: Without dead ends: 24517 [2025-04-13 18:49:32,156 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=1033, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:49:32,157 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 515 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:49:32,157 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 0 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:49:32,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24517 states. [2025-04-13 18:49:36,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24517 to 13417. [2025-04-13 18:49:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13417 states, 13416 states have (on average 3.5526982707215264) internal successors, (47663), 13416 states have internal predecessors, (47663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13417 states to 13417 states and 47663 transitions. [2025-04-13 18:49:36,512 INFO L79 Accepts]: Start accepts. Automaton has 13417 states and 47663 transitions. Word has length 37 [2025-04-13 18:49:36,512 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:49:36,512 INFO L485 AbstractCegarLoop]: Abstraction has 13417 states and 47663 transitions. [2025-04-13 18:49:36,512 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:36,512 INFO L278 IsEmpty]: Start isEmpty. Operand 13417 states and 47663 transitions. [2025-04-13 18:49:36,530 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 18:49:36,530 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:49:36,530 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-04-13 18:49:36,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 18:49:36,731 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-04-13 18:49:36,731 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:49:36,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:49:36,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1604810985, now seen corresponding path program 14 times [2025-04-13 18:49:36,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:49:36,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442152150] [2025-04-13 18:49:36,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:49:36,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:49:36,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 18:49:36,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 18:49:36,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:49:36,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:36,797 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 18:49:36,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:49:36,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442152150] [2025-04-13 18:49:36,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442152150] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:49:36,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:49:36,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:49:36,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709155228] [2025-04-13 18:49:36,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:49:36,798 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:49:36,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:49:36,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:49:36,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:49:36,798 INFO L87 Difference]: Start difference. First operand 13417 states and 47663 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:43,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:49:43,806 INFO L93 Difference]: Finished difference Result 16584 states and 57459 transitions. [2025-04-13 18:49:43,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:49:43,807 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 39 [2025-04-13 18:49:43,807 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:49:43,856 INFO L225 Difference]: With dead ends: 16584 [2025-04-13 18:49:43,856 INFO L226 Difference]: Without dead ends: 14784 [2025-04-13 18:49:43,863 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:49:43,863 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:49:43,863 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:49:43,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14784 states. [2025-04-13 18:49:48,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14784 to 13736. [2025-04-13 18:49:48,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13736 states, 13735 states have (on average 3.5605387695668003) internal successors, (48904), 13735 states have internal predecessors, (48904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13736 states to 13736 states and 48904 transitions. [2025-04-13 18:49:48,113 INFO L79 Accepts]: Start accepts. Automaton has 13736 states and 48904 transitions. Word has length 39 [2025-04-13 18:49:48,113 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:49:48,113 INFO L485 AbstractCegarLoop]: Abstraction has 13736 states and 48904 transitions. [2025-04-13 18:49:48,114 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:48,114 INFO L278 IsEmpty]: Start isEmpty. Operand 13736 states and 48904 transitions. [2025-04-13 18:49:48,136 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:49:48,136 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:49:48,136 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-04-13 18:49:48,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 18:49:48,136 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:49:48,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:49:48,137 INFO L85 PathProgramCache]: Analyzing trace with hash 321554263, now seen corresponding path program 4 times [2025-04-13 18:49:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:49:48,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367930691] [2025-04-13 18:49:48,137 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:49:48,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:49:48,143 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:49:48,149 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:49:48,149 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:49:48,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 18:49:48,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:49:48,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367930691] [2025-04-13 18:49:48,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367930691] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:49:48,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524031754] [2025-04-13 18:49:48,277 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:49:48,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:49:48,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:49:48,279 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:49:48,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 18:49:48,346 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:49:48,367 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:49:48,368 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:49:48,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:48,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 18:49:48,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:49:48,488 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 18:49:48,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:49:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 18:49:48,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524031754] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:49:48,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:49:48,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2025-04-13 18:49:48,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801591639] [2025-04-13 18:49:48,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:49:48,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 18:49:48,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:49:48,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 18:49:48,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:49:48,604 INFO L87 Difference]: Start difference. First operand 13736 states and 48904 transitions. Second operand has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:49:54,469 INFO L93 Difference]: Finished difference Result 20521 states and 72789 transitions. [2025-04-13 18:49:54,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:49:54,469 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 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 40 [2025-04-13 18:49:54,469 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:49:54,499 INFO L225 Difference]: With dead ends: 20521 [2025-04-13 18:49:54,499 INFO L226 Difference]: Without dead ends: 7164 [2025-04-13 18:49:54,515 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:49:54,516 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:49:54,516 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 0 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:49:54,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7164 states. [2025-04-13 18:49:56,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7164 to 7164. [2025-04-13 18:49:56,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7164 states, 7163 states have (on average 3.5235236632695797) internal successors, (25239), 7163 states have internal predecessors, (25239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:56,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7164 states to 7164 states and 25239 transitions. [2025-04-13 18:49:56,880 INFO L79 Accepts]: Start accepts. Automaton has 7164 states and 25239 transitions. Word has length 40 [2025-04-13 18:49:56,880 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:49:56,880 INFO L485 AbstractCegarLoop]: Abstraction has 7164 states and 25239 transitions. [2025-04-13 18:49:56,880 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:49:56,880 INFO L278 IsEmpty]: Start isEmpty. Operand 7164 states and 25239 transitions. [2025-04-13 18:49:56,890 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 18:49:56,890 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:49:56,890 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-04-13 18:49:56,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 18:49:57,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-13 18:49:57,091 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:49:57,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:49:57,091 INFO L85 PathProgramCache]: Analyzing trace with hash 493445332, now seen corresponding path program 5 times [2025-04-13 18:49:57,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:49:57,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827061719] [2025-04-13 18:49:57,091 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:49:57,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:49:57,097 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 3 equivalence classes. [2025-04-13 18:49:57,107 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 18:49:57,107 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:49:57,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:49:57,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:49:57,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827061719] [2025-04-13 18:49:57,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827061719] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:49:57,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584390405] [2025-04-13 18:49:57,521 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:49:57,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:49:57,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:49:57,523 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:49:57,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 18:49:57,593 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 3 equivalence classes. [2025-04-13 18:49:57,620 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 18:49:57,620 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:49:57,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:57,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:49:57,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:49:57,989 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 24 treesize of output 8 [2025-04-13 18:49:58,019 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:49:58,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:49:58,215 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 18:49:58,215 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 25 treesize of output 13 [2025-04-13 18:49:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:49:58,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584390405] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:49:58,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:49:58,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 38 [2025-04-13 18:49:58,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614337382] [2025-04-13 18:49:58,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:49:58,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:49:58,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:49:58,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:49:58,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1241, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:49:58,543 INFO L87 Difference]: Start difference. First operand 7164 states and 25239 transitions. Second operand has 39 states, 39 states have (on average 2.7435897435897436) internal successors, (107), 38 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 18:50:30,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:30,082 INFO L93 Difference]: Finished difference Result 57325 states and 210601 transitions. [2025-04-13 18:50:30,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2025-04-13 18:50:30,082 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.7435897435897436) internal successors, (107), 38 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 41 [2025-04-13 18:50:30,083 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:30,236 INFO L225 Difference]: With dead ends: 57325 [2025-04-13 18:50:30,237 INFO L226 Difference]: Without dead ends: 41053 [2025-04-13 18:50:30,265 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5925 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3833, Invalid=15627, Unknown=0, NotChecked=0, Total=19460 [2025-04-13 18:50:30,265 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 914 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4946 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 4946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:30,265 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 0 Invalid, 5070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 4946 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-04-13 18:50:30,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41053 states. [2025-04-13 18:50:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41053 to 25062. [2025-04-13 18:50:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25062 states, 25061 states have (on average 3.632137584294322) internal successors, (91025), 25061 states have internal predecessors, (91025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:50:39,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25062 states to 25062 states and 91025 transitions. [2025-04-13 18:50:39,119 INFO L79 Accepts]: Start accepts. Automaton has 25062 states and 91025 transitions. Word has length 41 [2025-04-13 18:50:39,119 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:39,119 INFO L485 AbstractCegarLoop]: Abstraction has 25062 states and 91025 transitions. [2025-04-13 18:50:39,119 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.7435897435897436) internal successors, (107), 38 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 18:50:39,120 INFO L278 IsEmpty]: Start isEmpty. Operand 25062 states and 91025 transitions. [2025-04-13 18:50:39,148 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 18:50:39,149 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:39,149 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-04-13 18:50:39,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 18:50:39,349 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-13 18:50:39,349 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:50:39,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:39,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1585893740, now seen corresponding path program 6 times [2025-04-13 18:50:39,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:39,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942759580] [2025-04-13 18:50:39,350 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:50:39,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:39,357 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 3 equivalence classes. [2025-04-13 18:50:39,365 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 18:50:39,367 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:50:39,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:50:40,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:40,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942759580] [2025-04-13 18:50:40,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942759580] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:50:40,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900943406] [2025-04-13 18:50:40,278 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:50:40,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:50:40,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:50:40,280 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:50:40,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 18:50:40,351 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 3 equivalence classes. [2025-04-13 18:50:40,374 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 18:50:40,375 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:50:40,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:40,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 18:50:40,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:50:40,914 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 16 treesize of output 8 [2025-04-13 18:50:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:50:40,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:50:41,140 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 18:50:41,140 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 25 treesize of output 13 [2025-04-13 18:50:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:50:41,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900943406] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:50:41,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:50:41,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 13] total 43 [2025-04-13 18:50:41,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542631468] [2025-04-13 18:50:41,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:50:41,568 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-13 18:50:41,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:41,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-13 18:50:41,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1669, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 18:50:41,569 INFO L87 Difference]: Start difference. First operand 25062 states and 91025 transitions. Second operand has 44 states, 44 states have (on average 2.4545454545454546) internal successors, (108), 43 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:37,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:37,569 INFO L93 Difference]: Finished difference Result 76783 states and 274860 transitions. [2025-04-13 18:51:37,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 259 states. [2025-04-13 18:51:37,570 INFO L79 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.4545454545454546) internal successors, (108), 43 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 18:51:37,570 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:37,879 INFO L225 Difference]: With dead ends: 76783 [2025-04-13 18:51:37,879 INFO L226 Difference]: Without dead ends: 76146 [2025-04-13 18:51:37,908 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33114 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=9387, Invalid=74423, Unknown=0, NotChecked=0, Total=83810 [2025-04-13 18:51:37,908 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 2054 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7119 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2054 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 7119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:37,909 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2054 Valid, 0 Invalid, 7339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 7119 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-04-13 18:51:37,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76146 states. [2025-04-13 18:51:56,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76146 to 50736. [2025-04-13 18:51:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50736 states, 50735 states have (on average 3.6211885286291516) internal successors, (183721), 50735 states have internal predecessors, (183721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:56,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50736 states to 50736 states and 183721 transitions. [2025-04-13 18:51:56,393 INFO L79 Accepts]: Start accepts. Automaton has 50736 states and 183721 transitions. Word has length 41 [2025-04-13 18:51:56,393 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:56,393 INFO L485 AbstractCegarLoop]: Abstraction has 50736 states and 183721 transitions. [2025-04-13 18:51:56,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.4545454545454546) internal successors, (108), 43 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:51:56,393 INFO L278 IsEmpty]: Start isEmpty. Operand 50736 states and 183721 transitions. [2025-04-13 18:51:56,427 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 18:51:56,427 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:56,427 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-04-13 18:51:56,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 18:51:56,628 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:56,628 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:51:56,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:56,629 INFO L85 PathProgramCache]: Analyzing trace with hash -71404032, now seen corresponding path program 7 times [2025-04-13 18:51:56,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:56,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856137441] [2025-04-13 18:51:56,629 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:51:56,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:56,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 18:51:56,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 18:51:56,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:56,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:51:57,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:57,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856137441] [2025-04-13 18:51:57,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856137441] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:57,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336112946] [2025-04-13 18:51:57,063 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:51:57,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:57,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:57,065 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:51:57,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 18:51:57,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 18:51:57,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 18:51:57,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:57,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:57,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 18:51:57,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:57,500 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:51:57,500 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 35 treesize of output 31 [2025-04-13 18:51:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:51:57,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:52:03,535 INFO L325 Elim1Store]: treesize reduction 4, result has 95.9 percent of original size [2025-04-13 18:52:03,536 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 103 [2025-04-13 18:52:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 18:52:03,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336112946] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:52:03,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:52:03,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 9] total 29 [2025-04-13 18:52:03,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175130116] [2025-04-13 18:52:03,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:52:03,710 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 18:52:03,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:03,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 18:52:03,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:52:03,710 INFO L87 Difference]: Start difference. First operand 50736 states and 183721 transitions. Second operand has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:52:59,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:59,472 INFO L93 Difference]: Finished difference Result 98342 states and 352059 transitions. [2025-04-13 18:52:59,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-13 18:52:59,472 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 18:52:59,472 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:59,896 INFO L225 Difference]: With dead ends: 98342 [2025-04-13 18:52:59,897 INFO L226 Difference]: Without dead ends: 97389 [2025-04-13 18:52:59,930 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1588 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=719, Invalid=6591, Unknown=0, NotChecked=0, Total=7310 [2025-04-13 18:52:59,931 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 515 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8434 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 8434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:59,931 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 0 Invalid, 8473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 8434 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-04-13 18:53:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97389 states. [2025-04-13 18:53:21,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97389 to 55759. [2025-04-13 18:53:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55759 states, 55758 states have (on average 3.593852003299975) internal successors, (200386), 55758 states have internal predecessors, (200386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:21,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55759 states to 55759 states and 200386 transitions. [2025-04-13 18:53:22,082 INFO L79 Accepts]: Start accepts. Automaton has 55759 states and 200386 transitions. Word has length 41 [2025-04-13 18:53:22,082 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:22,082 INFO L485 AbstractCegarLoop]: Abstraction has 55759 states and 200386 transitions. [2025-04-13 18:53:22,082 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:53:22,082 INFO L278 IsEmpty]: Start isEmpty. Operand 55759 states and 200386 transitions. [2025-04-13 18:53:22,131 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 18:53:22,131 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:22,131 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-04-13 18:53:22,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 18:53:22,332 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 18:53:22,332 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:53:22,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:22,332 INFO L85 PathProgramCache]: Analyzing trace with hash -949403084, now seen corresponding path program 8 times [2025-04-13 18:53:22,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:22,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748471313] [2025-04-13 18:53:22,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:53:22,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:22,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 18:53:22,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 18:53:22,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:53:22,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:53:23,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:23,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748471313] [2025-04-13 18:53:23,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748471313] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:53:23,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474996797] [2025-04-13 18:53:23,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:53:23,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:23,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:53:23,326 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:53:23,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 18:53:23,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 18:53:23,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 18:53:23,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:53:23,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:23,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:53:23,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:53:23,847 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 26 treesize of output 8 [2025-04-13 18:53:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:53:23,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:53:24,053 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 18:53:24,053 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 24 treesize of output 11 [2025-04-13 18:53:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:53:24,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474996797] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:53:24,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:53:24,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 13] total 43 [2025-04-13 18:53:24,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224357657] [2025-04-13 18:53:24,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:53:24,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 18:53:24,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:24,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 18:53:24,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1564, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:53:24,475 INFO L87 Difference]: Start difference. First operand 55759 states and 200386 transitions. Second operand has 43 states, 43 states have (on average 2.441860465116279) internal successors, (105), 43 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:27,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:54:27,265 INFO L93 Difference]: Finished difference Result 104045 states and 369765 transitions. [2025-04-13 18:54:27,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2025-04-13 18:54:27,266 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.441860465116279) internal successors, (105), 43 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 18:54:27,266 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:54:27,708 INFO L225 Difference]: With dead ends: 104045 [2025-04-13 18:54:27,708 INFO L226 Difference]: Without dead ends: 103426 [2025-04-13 18:54:27,744 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9628 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=5125, Invalid=24631, Unknown=0, NotChecked=0, Total=29756 [2025-04-13 18:54:27,745 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1295 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5532 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 5532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:54:27,745 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 0 Invalid, 5709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 5532 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-04-13 18:54:27,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103426 states. [2025-04-13 18:54:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103426 to 72309. [2025-04-13 18:54:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72309 states, 72308 states have (on average 3.582065608231454) internal successors, (259012), 72308 states have internal predecessors, (259012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72309 states to 72309 states and 259012 transitions. [2025-04-13 18:54:56,031 INFO L79 Accepts]: Start accepts. Automaton has 72309 states and 259012 transitions. Word has length 41 [2025-04-13 18:54:56,031 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:54:56,031 INFO L485 AbstractCegarLoop]: Abstraction has 72309 states and 259012 transitions. [2025-04-13 18:54:56,031 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.441860465116279) internal successors, (105), 43 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:54:56,031 INFO L278 IsEmpty]: Start isEmpty. Operand 72309 states and 259012 transitions. [2025-04-13 18:54:56,079 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 18:54:56,079 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:54:56,080 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-04-13 18:54:56,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 18:54:56,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 18:54:56,280 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:54:56,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:54:56,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1522676944, now seen corresponding path program 9 times [2025-04-13 18:54:56,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:54:56,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358887771] [2025-04-13 18:54:56,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:54:56,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:54:56,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 3 equivalence classes. [2025-04-13 18:54:56,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 41 statements. [2025-04-13 18:54:56,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:54:56,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 18:54:56,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:54:56,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358887771] [2025-04-13 18:54:56,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358887771] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:54:56,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087429900] [2025-04-13 18:54:56,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:54:56,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:54:56,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:54:56,385 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:54:56,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 18:54:56,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 3 equivalence classes. [2025-04-13 18:54:56,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 41 statements. [2025-04-13 18:54:56,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:54:56,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:54:56,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 18:54:56,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:54:56,566 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 23 treesize of output 7 [2025-04-13 18:54:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 18:54:56,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:54:56,604 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 18:54:56,604 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 24 treesize of output 11 [2025-04-13 18:54:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 18:54:56,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087429900] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:54:56,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:54:56,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2025-04-13 18:54:56,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972117792] [2025-04-13 18:54:56,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:54:56,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:54:56,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:54:56,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:54:56,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:54:56,635 INFO L87 Difference]: Start difference. First operand 72309 states and 259012 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:55:36,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:36,688 INFO L93 Difference]: Finished difference Result 78259 states and 277157 transitions. [2025-04-13 18:55:36,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:55:36,689 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 18:55:36,689 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:37,050 INFO L225 Difference]: With dead ends: 78259 [2025-04-13 18:55:37,051 INFO L226 Difference]: Without dead ends: 77646 [2025-04-13 18:55:37,074 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:55:37,074 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 207 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:37,074 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 0 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:55:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77646 states. [2025-04-13 18:56:04,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77646 to 69421. [2025-04-13 18:56:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69421 states, 69420 states have (on average 3.549841544223567) internal successors, (246430), 69420 states have internal predecessors, (246430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69421 states to 69421 states and 246430 transitions. [2025-04-13 18:56:05,038 INFO L79 Accepts]: Start accepts. Automaton has 69421 states and 246430 transitions. Word has length 41 [2025-04-13 18:56:05,038 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:05,038 INFO L485 AbstractCegarLoop]: Abstraction has 69421 states and 246430 transitions. [2025-04-13 18:56:05,038 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:56:05,039 INFO L278 IsEmpty]: Start isEmpty. Operand 69421 states and 246430 transitions. [2025-04-13 18:56:05,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 18:56:05,089 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:05,089 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-04-13 18:56:05,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 18:56:05,290 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 18:56:05,290 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:56:05,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:05,290 INFO L85 PathProgramCache]: Analyzing trace with hash 738155888, now seen corresponding path program 10 times [2025-04-13 18:56:05,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:05,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344121393] [2025-04-13 18:56:05,291 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:56:05,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:05,297 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-04-13 18:56:05,307 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 18:56:05,307 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:56:05,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:06,174 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:56:06,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:06,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344121393] [2025-04-13 18:56:06,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344121393] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:56:06,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023102649] [2025-04-13 18:56:06,174 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:56:06,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:56:06,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:56:06,176 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:56:06,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 18:56:06,252 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-04-13 18:56:06,289 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 18:56:06,289 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:56:06,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:06,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:56:06,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:56:06,700 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:56:06,700 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 23 treesize of output 15 [2025-04-13 18:56:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:56:06,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:56:07,026 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 18:56:07,026 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 24 treesize of output 11 [2025-04-13 18:56:07,572 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:56:07,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023102649] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:56:07,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:56:07,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 13] total 44 [2025-04-13 18:56:07,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980732768] [2025-04-13 18:56:07,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:56:07,573 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 18:56:07,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:07,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 18:56:07,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1727, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 18:56:07,574 INFO L87 Difference]: Start difference. First operand 69421 states and 246430 transitions. Second operand has 45 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 44 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 18:56:37,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:56:37,608 INFO L93 Difference]: Finished difference Result 84475 states and 294225 transitions. [2025-04-13 18:56:37,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-04-13 18:56:37,611 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 44 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 41 [2025-04-13 18:56:37,611 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:56:37,868 INFO L225 Difference]: With dead ends: 84475 [2025-04-13 18:56:37,869 INFO L226 Difference]: Without dead ends: 25574 [2025-04-13 18:56:37,949 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2524 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1821, Invalid=8891, Unknown=0, NotChecked=0, Total=10712 [2025-04-13 18:56:37,950 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 649 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4953 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 4953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:56:37,951 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 0 Invalid, 5020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 4953 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-04-13 18:56:37,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25574 states. Received shutdown request... [2025-04-13 18:56:38,970 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 18:56:38,975 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 18:56:39,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-13 18:56:40,171 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-13 18:56:40,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown