/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:27:45,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:27:46,011 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:27:46,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:27:46,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:27:46,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:27:46,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:27:46,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:27:46,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:27:46,034 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:27:46,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:27:46,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:27:46,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:27:46,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:27:46,035 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:27:46,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:27:46,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:27:46,035 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:27:46,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:27:46,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:27:46,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:27:46,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:27:46,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:27:46,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:27:46,035 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:27:46,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:27:46,036 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:27:46,036 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:27:46,036 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:27:46,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:27:46,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:27:46,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:27:46,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:27:46,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:27:46,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:27:46,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:27:46,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:27:46,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:27:46,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:27:46,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:27:46,036 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:27:46,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:27:46,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:27:46,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:27:46,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:27:46,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:27:46,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:27:46,037 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:27:46,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:27:46,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:27:46,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:27:46,362 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:27:46,363 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:27:46,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2025-04-13 18:27:47,599 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47cae6bbc/b2b7005a089e449a832c9f52b9bb5648/FLAG374f1d182 [2025-04-13 18:27:47,842 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:27:47,842 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2025-04-13 18:27:47,858 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47cae6bbc/b2b7005a089e449a832c9f52b9bb5648/FLAG374f1d182 [2025-04-13 18:27:48,600 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47cae6bbc/b2b7005a089e449a832c9f52b9bb5648 [2025-04-13 18:27:48,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:27:48,604 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:27:48,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:27:48,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:27:48,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:27:48,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:27:48" (1/1) ... [2025-04-13 18:27:48,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e135889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:27:48, skipping insertion in model container [2025-04-13 18:27:48,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:27:48" (1/1) ... [2025-04-13 18:27:48,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:27:48,797 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c[2625,2638] [2025-04-13 18:27:48,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:27:48,815 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:27:48,839 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c[2625,2638] [2025-04-13 18:27:48,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:27:48,854 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:27:48,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:27:48 WrapperNode [2025-04-13 18:27:48,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:27:48,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:27:48,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:27:48,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:27:48,860 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:27:48" (1/1) ... [2025-04-13 18:27:48,869 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:27:48" (1/1) ... [2025-04-13 18:27:48,881 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 84 [2025-04-13 18:27:48,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:27:48,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:27:48,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:27:48,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:27:48,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:27:48" (1/1) ... [2025-04-13 18:27:48,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:27:48" (1/1) ... [2025-04-13 18:27:48,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:27:48" (1/1) ... [2025-04-13 18:27:48,909 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 1 writes are split as follows [0, 1]. [2025-04-13 18:27:48,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:27:48" (1/1) ... [2025-04-13 18:27:48,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:27:48" (1/1) ... [2025-04-13 18:27:48,913 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:27:48" (1/1) ... [2025-04-13 18:27:48,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:27:48" (1/1) ... [2025-04-13 18:27:48,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:27:48" (1/1) ... [2025-04-13 18:27:48,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:27:48" (1/1) ... [2025-04-13 18:27:48,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:27:48" (1/1) ... [2025-04-13 18:27:48,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:27:48,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:27:48,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:27:48,920 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:27:48,921 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:27:48" (1/1) ... [2025-04-13 18:27:48,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:27:48,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:27:48,946 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:27:48,948 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:27:48,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:27:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:27:48,962 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:27:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:27:48,962 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:27:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:27:48,962 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:27:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:27:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:27:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:27:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:27:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 18:27:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 18:27:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:27:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:27:48,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:27:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:27:48,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:27:48,963 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:27:49,035 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:27:49,037 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:27:49,239 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:27:49,240 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:27:49,240 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:27:49,399 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:27:49,401 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:27:49,404 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:27:49,408 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:27:49,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:27:49 BoogieIcfgContainer [2025-04-13 18:27:49,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:27:49,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:27:49,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:27:49,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:27:49,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:27:48" (1/3) ... [2025-04-13 18:27:49,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2653257a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:27:49, skipping insertion in model container [2025-04-13 18:27:49,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:27:48" (2/3) ... [2025-04-13 18:27:49,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2653257a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:27:49, skipping insertion in model container [2025-04-13 18:27:49,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:27:49" (3/3) ... [2025-04-13 18:27:49,415 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2025-04-13 18:27:49,424 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:27:49,427 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-min-array-hom.wvr.c that has 4 procedures, 26 locations, 29 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 18:27:49,427 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:27:49,469 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 18:27:49,493 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 32 transitions, 85 flow [2025-04-13 18:27:49,525 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 193 states, 192 states have (on average 3.8802083333333335) internal successors, (745), 192 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:49,545 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:27:49,554 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;@2f03c867, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:27:49,554 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 18:27:49,559 INFO L278 IsEmpty]: Start isEmpty. Operand has 193 states, 192 states have (on average 3.8802083333333335) internal successors, (745), 192 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:49,567 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:27:49,568 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:27:49,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:27:49,569 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:27:49,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:27:49,573 INFO L85 PathProgramCache]: Analyzing trace with hash 155196189, now seen corresponding path program 1 times [2025-04-13 18:27:49,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:27:49,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884585911] [2025-04-13 18:27:49,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:27:49,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:27:49,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:27:49,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:27:49,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:27:49,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:49,809 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:27:49,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:27:49,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884585911] [2025-04-13 18:27:49,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884585911] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:27:49,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:27:49,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:27:49,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937293836] [2025-04-13 18:27:49,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:27:49,817 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:27:49,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:27:49,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:27:49,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:27:49,832 INFO L87 Difference]: Start difference. First operand has 193 states, 192 states have (on average 3.8802083333333335) internal successors, (745), 192 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:49,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:27:49,892 INFO L93 Difference]: Finished difference Result 257 states and 928 transitions. [2025-04-13 18:27:49,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:27:49,895 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-04-13 18:27:49,896 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:27:49,905 INFO L225 Difference]: With dead ends: 257 [2025-04-13 18:27:49,905 INFO L226 Difference]: Without dead ends: 193 [2025-04-13 18:27:49,908 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:27:49,910 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:27:49,910 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:27:49,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-13 18:27:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-04-13 18:27:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 3.6614583333333335) internal successors, (703), 192 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 703 transitions. [2025-04-13 18:27:49,946 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 703 transitions. Word has length 15 [2025-04-13 18:27:49,946 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:27:49,946 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 703 transitions. [2025-04-13 18:27:49,946 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:49,946 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 703 transitions. [2025-04-13 18:27:49,947 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 18:27:49,948 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:27:49,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:27:49,948 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:27:49,948 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:27:49,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:27:49,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1751062784, now seen corresponding path program 1 times [2025-04-13 18:27:49,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:27:49,948 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309915128] [2025-04-13 18:27:49,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:27:49,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:27:49,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 18:27:49,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:27:49,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:27:49,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:50,038 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:27:50,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:27:50,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309915128] [2025-04-13 18:27:50,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309915128] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:27:50,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:27:50,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:27:50,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353220361] [2025-04-13 18:27:50,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:27:50,039 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:27:50,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:27:50,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:27:50,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:27:50,040 INFO L87 Difference]: Start difference. First operand 193 states and 703 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:50,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:27:50,082 INFO L93 Difference]: Finished difference Result 232 states and 803 transitions. [2025-04-13 18:27:50,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:27:50,082 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 18:27:50,082 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:27:50,084 INFO L225 Difference]: With dead ends: 232 [2025-04-13 18:27:50,084 INFO L226 Difference]: Without dead ends: 193 [2025-04-13 18:27:50,084 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:27:50,085 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:27:50,085 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:27:50,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-13 18:27:50,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-04-13 18:27:50,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 3.46875) internal successors, (666), 192 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 666 transitions. [2025-04-13 18:27:50,095 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 666 transitions. Word has length 17 [2025-04-13 18:27:50,096 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:27:50,096 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 666 transitions. [2025-04-13 18:27:50,096 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:50,096 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 666 transitions. [2025-04-13 18:27:50,097 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:27:50,097 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:27:50,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:27:50,097 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:27:50,098 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:27:50,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:27:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash -614649569, now seen corresponding path program 1 times [2025-04-13 18:27:50,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:27:50,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192685706] [2025-04-13 18:27:50,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:27:50,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:27:50,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 18:27:50,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:27:50,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:27:50,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:50,227 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:27:50,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:27:50,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192685706] [2025-04-13 18:27:50,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192685706] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:27:50,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:27:50,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:27:50,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798176163] [2025-04-13 18:27:50,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:27:50,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:27:50,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:27:50,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:27:50,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:27:50,228 INFO L87 Difference]: Start difference. First operand 193 states and 666 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:27:50,280 INFO L93 Difference]: Finished difference Result 385 states and 1331 transitions. [2025-04-13 18:27:50,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:27:50,280 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 18:27:50,280 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:27:50,282 INFO L225 Difference]: With dead ends: 385 [2025-04-13 18:27:50,282 INFO L226 Difference]: Without dead ends: 194 [2025-04-13 18:27:50,282 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:27:50,283 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:27:50,283 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:27:50,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-04-13 18:27:50,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-04-13 18:27:50,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 3.4559585492227978) internal successors, (667), 193 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 667 transitions. [2025-04-13 18:27:50,298 INFO L79 Accepts]: Start accepts. Automaton has 194 states and 667 transitions. Word has length 19 [2025-04-13 18:27:50,298 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:27:50,298 INFO L485 AbstractCegarLoop]: Abstraction has 194 states and 667 transitions. [2025-04-13 18:27:50,298 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:50,298 INFO L278 IsEmpty]: Start isEmpty. Operand 194 states and 667 transitions. [2025-04-13 18:27:50,300 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:27:50,300 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:27:50,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:27:50,301 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:27:50,301 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:27:50,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:27:50,302 INFO L85 PathProgramCache]: Analyzing trace with hash 512416945, now seen corresponding path program 1 times [2025-04-13 18:27:50,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:27:50,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214985951] [2025-04-13 18:27:50,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:27:50,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:27:50,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 18:27:50,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:27:50,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:27:50,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:51,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:27:51,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:27:51,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214985951] [2025-04-13 18:27:51,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214985951] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:27:51,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935202029] [2025-04-13 18:27:51,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:27:51,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:27:51,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:27:51,273 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:27:51,274 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:27:51,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 18:27:51,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:27:51,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:27:51,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:51,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 18:27:51,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:27:51,398 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:27:51,699 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 59 treesize of output 35 [2025-04-13 18:27:51,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:27:51,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:27:53,288 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 112 treesize of output 98 [2025-04-13 18:27:53,293 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 141 treesize of output 127 [2025-04-13 18:27:53,410 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 102 treesize of output 92 [2025-04-13 18:27:53,419 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 121 treesize of output 111 [2025-04-13 18:27:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:27:53,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935202029] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:27:53,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:27:53,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 24 [2025-04-13 18:27:53,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219588599] [2025-04-13 18:27:53,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:27:53,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 18:27:53,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:27:53,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 18:27:53,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:27:53,603 INFO L87 Difference]: Start difference. First operand 194 states and 667 transitions. Second operand has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 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:27:55,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:27:55,607 INFO L93 Difference]: Finished difference Result 638 states and 2105 transitions. [2025-04-13 18:27:55,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:27:55,607 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 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 20 [2025-04-13 18:27:55,607 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:27:55,610 INFO L225 Difference]: With dead ends: 638 [2025-04-13 18:27:55,610 INFO L226 Difference]: Without dead ends: 565 [2025-04-13 18:27:55,611 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=438, Invalid=1724, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 18:27:55,612 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 198 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:27:55,612 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 0 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:27:55,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-04-13 18:27:55,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 252. [2025-04-13 18:27:55,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 3.3904382470119523) internal successors, (851), 251 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 851 transitions. [2025-04-13 18:27:55,623 INFO L79 Accepts]: Start accepts. Automaton has 252 states and 851 transitions. Word has length 20 [2025-04-13 18:27:55,623 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:27:55,623 INFO L485 AbstractCegarLoop]: Abstraction has 252 states and 851 transitions. [2025-04-13 18:27:55,623 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 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:27:55,623 INFO L278 IsEmpty]: Start isEmpty. Operand 252 states and 851 transitions. [2025-04-13 18:27:55,624 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:27:55,624 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:27:55,624 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:27:55,632 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:27:55,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:27:55,825 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:27:55,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:27:55,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1556674639, now seen corresponding path program 2 times [2025-04-13 18:27:55,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:27:55,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256382639] [2025-04-13 18:27:55,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:27:55,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:27:55,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:27:55,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 18:27:55,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:27:55,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:56,281 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:27:56,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:27:56,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256382639] [2025-04-13 18:27:56,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256382639] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:27:56,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:27:56,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:27:56,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262452225] [2025-04-13 18:27:56,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:27:56,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:27:56,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:27:56,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:27:56,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:27:56,284 INFO L87 Difference]: Start difference. First operand 252 states and 851 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:27:56,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:27:56,516 INFO L93 Difference]: Finished difference Result 360 states and 1167 transitions. [2025-04-13 18:27:56,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:27:56,517 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:27:56,517 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:27:56,519 INFO L225 Difference]: With dead ends: 360 [2025-04-13 18:27:56,519 INFO L226 Difference]: Without dead ends: 354 [2025-04-13 18:27:56,519 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:27:56,521 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:27:56,521 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:27:56,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-04-13 18:27:56,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 290. [2025-04-13 18:27:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 3.3044982698961936) internal successors, (955), 289 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:56,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 955 transitions. [2025-04-13 18:27:56,535 INFO L79 Accepts]: Start accepts. Automaton has 290 states and 955 transitions. Word has length 20 [2025-04-13 18:27:56,536 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:27:56,536 INFO L485 AbstractCegarLoop]: Abstraction has 290 states and 955 transitions. [2025-04-13 18:27:56,536 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:27:56,536 INFO L278 IsEmpty]: Start isEmpty. Operand 290 states and 955 transitions. [2025-04-13 18:27:56,537 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:27:56,537 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:27:56,537 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:27:56,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:27:56,537 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:27:56,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:27:56,539 INFO L85 PathProgramCache]: Analyzing trace with hash 539382001, now seen corresponding path program 3 times [2025-04-13 18:27:56,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:27:56,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747284423] [2025-04-13 18:27:56,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:27:56,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:27:56,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:27:56,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 18:27:56,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:27:56,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:56,964 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:27:56,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:27:56,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747284423] [2025-04-13 18:27:56,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747284423] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:27:56,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:27:56,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:27:56,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255478361] [2025-04-13 18:27:56,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:27:56,965 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:27:56,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:27:56,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:27:56,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:27:56,965 INFO L87 Difference]: Start difference. First operand 290 states and 955 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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:27:57,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:27:57,194 INFO L93 Difference]: Finished difference Result 346 states and 1106 transitions. [2025-04-13 18:27:57,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:27:57,194 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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:27:57,195 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:27:57,197 INFO L225 Difference]: With dead ends: 346 [2025-04-13 18:27:57,197 INFO L226 Difference]: Without dead ends: 340 [2025-04-13 18:27:57,197 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:27:57,197 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:27:57,198 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:27:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-04-13 18:27:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 298. [2025-04-13 18:27:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.2861952861952863) internal successors, (976), 297 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 976 transitions. [2025-04-13 18:27:57,207 INFO L79 Accepts]: Start accepts. Automaton has 298 states and 976 transitions. Word has length 20 [2025-04-13 18:27:57,207 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:27:57,207 INFO L485 AbstractCegarLoop]: Abstraction has 298 states and 976 transitions. [2025-04-13 18:27:57,208 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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:27:57,208 INFO L278 IsEmpty]: Start isEmpty. Operand 298 states and 976 transitions. [2025-04-13 18:27:57,208 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:27:57,208 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:27:57,208 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:27:57,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:27:57,209 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:27:57,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:27:57,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1317753149, now seen corresponding path program 4 times [2025-04-13 18:27:57,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:27:57,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975060547] [2025-04-13 18:27:57,209 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:27:57,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:27:57,215 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:27:57,224 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:27:57,224 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:27:57,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:57,585 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:27:57,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:27:57,585 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975060547] [2025-04-13 18:27:57,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975060547] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:27:57,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:27:57,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:27:57,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425613064] [2025-04-13 18:27:57,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:27:57,586 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:27:57,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:27:57,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:27:57,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:27:57,586 INFO L87 Difference]: Start difference. First operand 298 states and 976 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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:27:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:27:57,809 INFO L93 Difference]: Finished difference Result 360 states and 1167 transitions. [2025-04-13 18:27:57,810 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:27:57,810 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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:27:57,810 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:27:57,812 INFO L225 Difference]: With dead ends: 360 [2025-04-13 18:27:57,812 INFO L226 Difference]: Without dead ends: 354 [2025-04-13 18:27:57,813 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:27:57,813 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:27:57,813 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:27:57,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-04-13 18:27:57,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 302. [2025-04-13 18:27:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 3.2857142857142856) internal successors, (989), 301 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 989 transitions. [2025-04-13 18:27:57,821 INFO L79 Accepts]: Start accepts. Automaton has 302 states and 989 transitions. Word has length 20 [2025-04-13 18:27:57,821 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:27:57,821 INFO L485 AbstractCegarLoop]: Abstraction has 302 states and 989 transitions. [2025-04-13 18:27:57,821 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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:27:57,821 INFO L278 IsEmpty]: Start isEmpty. Operand 302 states and 989 transitions. [2025-04-13 18:27:57,822 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:27:57,822 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:27:57,822 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:27:57,822 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:27:57,822 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:27:57,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:27:57,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1123270687, now seen corresponding path program 5 times [2025-04-13 18:27:57,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:27:57,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699484375] [2025-04-13 18:27:57,823 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:27:57,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:27:57,827 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:27:57,833 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:27:57,833 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:27:57,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:27:58,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:27:58,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699484375] [2025-04-13 18:27:58,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699484375] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:27:58,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068818540] [2025-04-13 18:27:58,365 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:27:58,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:27:58,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:27:58,367 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:27:58,369 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:27:58,403 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:27:58,418 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:27:58,418 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:27:58,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:58,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 18:27:58,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:27:58,444 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:27:58,657 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 59 treesize of output 35 [2025-04-13 18:27:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:27:58,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:27:59,657 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 98 treesize of output 88 [2025-04-13 18:27:59,660 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 119 treesize of output 109 [2025-04-13 18:27:59,709 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 76 treesize of output 66 [2025-04-13 18:27:59,712 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 93 treesize of output 83 [2025-04-13 18:27:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:27:59,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068818540] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:27:59,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:27:59,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 24 [2025-04-13 18:27:59,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028765528] [2025-04-13 18:27:59,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:27:59,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 18:27:59,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:27:59,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 18:27:59,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:27:59,743 INFO L87 Difference]: Start difference. First operand 302 states and 989 transitions. Second operand has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 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:28:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:02,197 INFO L93 Difference]: Finished difference Result 593 states and 1792 transitions. [2025-04-13 18:28:02,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 18:28:02,197 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 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 20 [2025-04-13 18:28:02,198 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:02,200 INFO L225 Difference]: With dead ends: 593 [2025-04-13 18:28:02,200 INFO L226 Difference]: Without dead ends: 582 [2025-04-13 18:28:02,201 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=496, Invalid=2810, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 18:28:02,202 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 254 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:02,202 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 0 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:28:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-04-13 18:28:02,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 306. [2025-04-13 18:28:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 3.301639344262295) internal successors, (1007), 305 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 1007 transitions. [2025-04-13 18:28:02,211 INFO L79 Accepts]: Start accepts. Automaton has 306 states and 1007 transitions. Word has length 20 [2025-04-13 18:28:02,211 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:02,211 INFO L485 AbstractCegarLoop]: Abstraction has 306 states and 1007 transitions. [2025-04-13 18:28:02,211 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 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:28:02,211 INFO L278 IsEmpty]: Start isEmpty. Operand 306 states and 1007 transitions. [2025-04-13 18:28:02,212 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:28:02,212 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:02,212 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:28:02,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 18:28:02,416 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,SelfDestructingSolverStorable7 [2025-04-13 18:28:02,416 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:28:02,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:02,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1511564343, now seen corresponding path program 6 times [2025-04-13 18:28:02,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:02,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912556833] [2025-04-13 18:28:02,416 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:28:02,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:02,423 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:28:02,430 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 18:28:02,430 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:28:02,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:02,806 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:28:02,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:02,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912556833] [2025-04-13 18:28:02,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912556833] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:28:02,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:28:02,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:28:02,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54931746] [2025-04-13 18:28:02,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:28:02,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:28:02,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:02,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:28:02,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:28:02,808 INFO L87 Difference]: Start difference. First operand 306 states and 1007 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:03,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:03,025 INFO L93 Difference]: Finished difference Result 394 states and 1280 transitions. [2025-04-13 18:28:03,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:28:03,025 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:03,025 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:03,027 INFO L225 Difference]: With dead ends: 394 [2025-04-13 18:28:03,027 INFO L226 Difference]: Without dead ends: 388 [2025-04-13 18:28:03,028 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:28:03,028 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:03,028 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:28:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-04-13 18:28:03,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 310. [2025-04-13 18:28:03,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 3.3300970873786406) internal successors, (1029), 309 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:03,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 1029 transitions. [2025-04-13 18:28:03,035 INFO L79 Accepts]: Start accepts. Automaton has 310 states and 1029 transitions. Word has length 20 [2025-04-13 18:28:03,035 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:03,035 INFO L485 AbstractCegarLoop]: Abstraction has 310 states and 1029 transitions. [2025-04-13 18:28:03,036 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:03,036 INFO L278 IsEmpty]: Start isEmpty. Operand 310 states and 1029 transitions. [2025-04-13 18:28:03,036 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:28:03,036 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:03,036 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:28:03,036 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:28:03,037 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:28:03,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:03,037 INFO L85 PathProgramCache]: Analyzing trace with hash -877931739, now seen corresponding path program 7 times [2025-04-13 18:28:03,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:03,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809420443] [2025-04-13 18:28:03,037 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:28:03,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:03,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 18:28:03,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:28:03,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:28:03,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:03,361 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:28:03,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:03,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809420443] [2025-04-13 18:28:03,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809420443] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:28:03,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:28:03,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:28:03,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070299149] [2025-04-13 18:28:03,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:28:03,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:28:03,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:03,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:28:03,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:28:03,362 INFO L87 Difference]: Start difference. First operand 310 states and 1029 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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:28:03,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:03,542 INFO L93 Difference]: Finished difference Result 366 states and 1187 transitions. [2025-04-13 18:28:03,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:28:03,542 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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:28:03,542 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:03,544 INFO L225 Difference]: With dead ends: 366 [2025-04-13 18:28:03,544 INFO L226 Difference]: Without dead ends: 360 [2025-04-13 18:28:03,544 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:28:03,545 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:03,545 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:28:03,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-04-13 18:28:03,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 314. [2025-04-13 18:28:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 3.3322683706070286) internal successors, (1043), 313 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:03,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1043 transitions. [2025-04-13 18:28:03,552 INFO L79 Accepts]: Start accepts. Automaton has 314 states and 1043 transitions. Word has length 20 [2025-04-13 18:28:03,552 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:03,552 INFO L485 AbstractCegarLoop]: Abstraction has 314 states and 1043 transitions. [2025-04-13 18:28:03,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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:28:03,552 INFO L278 IsEmpty]: Start isEmpty. Operand 314 states and 1043 transitions. [2025-04-13 18:28:03,553 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:28:03,553 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:03,553 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:28:03,553 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 18:28:03,553 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:28:03,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:03,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1782133893, now seen corresponding path program 8 times [2025-04-13 18:28:03,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:03,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774361077] [2025-04-13 18:28:03,553 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:28:03,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:03,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:28:03,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 18:28:03,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:28:03,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:03,872 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:28:03,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:03,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774361077] [2025-04-13 18:28:03,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774361077] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:28:03,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:28:03,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:28:03,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882815168] [2025-04-13 18:28:03,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:28:03,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:28:03,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:03,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:28:03,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:28:03,873 INFO L87 Difference]: Start difference. First operand 314 states and 1043 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:04,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:04,101 INFO L93 Difference]: Finished difference Result 372 states and 1233 transitions. [2025-04-13 18:28:04,101 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:28:04,101 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:04,101 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:04,103 INFO L225 Difference]: With dead ends: 372 [2025-04-13 18:28:04,103 INFO L226 Difference]: Without dead ends: 366 [2025-04-13 18:28:04,104 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:28:04,104 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:04,104 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:28:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-04-13 18:28:04,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 304. [2025-04-13 18:28:04,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 3.3036303630363038) internal successors, (1001), 303 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1001 transitions. [2025-04-13 18:28:04,112 INFO L79 Accepts]: Start accepts. Automaton has 304 states and 1001 transitions. Word has length 20 [2025-04-13 18:28:04,112 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:04,112 INFO L485 AbstractCegarLoop]: Abstraction has 304 states and 1001 transitions. [2025-04-13 18:28:04,112 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:04,112 INFO L278 IsEmpty]: Start isEmpty. Operand 304 states and 1001 transitions. [2025-04-13 18:28:04,113 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:28:04,113 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:04,113 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:28:04,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 18:28:04,113 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:28:04,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:04,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1274171681, now seen corresponding path program 9 times [2025-04-13 18:28:04,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:04,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766398770] [2025-04-13 18:28:04,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:28:04,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:04,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:28:04,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 18:28:04,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:28:04,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:04,475 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:28:04,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:04,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766398770] [2025-04-13 18:28:04,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766398770] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:28:04,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:28:04,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:28:04,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303943044] [2025-04-13 18:28:04,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:28:04,476 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:28:04,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:04,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:28:04,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:28:04,476 INFO L87 Difference]: Start difference. First operand 304 states and 1001 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:04,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:04,700 INFO L93 Difference]: Finished difference Result 376 states and 1209 transitions. [2025-04-13 18:28:04,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:28:04,700 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:04,701 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:04,703 INFO L225 Difference]: With dead ends: 376 [2025-04-13 18:28:04,703 INFO L226 Difference]: Without dead ends: 370 [2025-04-13 18:28:04,703 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:28:04,704 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:04,704 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:28:04,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-04-13 18:28:04,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 310. [2025-04-13 18:28:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 3.313915857605178) internal successors, (1024), 309 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 1024 transitions. [2025-04-13 18:28:04,711 INFO L79 Accepts]: Start accepts. Automaton has 310 states and 1024 transitions. Word has length 20 [2025-04-13 18:28:04,711 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:04,711 INFO L485 AbstractCegarLoop]: Abstraction has 310 states and 1024 transitions. [2025-04-13 18:28:04,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:04,711 INFO L278 IsEmpty]: Start isEmpty. Operand 310 states and 1024 transitions. [2025-04-13 18:28:04,711 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:28:04,712 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:04,712 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:28:04,712 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 18:28:04,712 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:28:04,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:04,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1539000757, now seen corresponding path program 10 times [2025-04-13 18:28:04,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:04,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505511612] [2025-04-13 18:28:04,712 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:28:04,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:04,717 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:28:04,722 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:28:04,722 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:28:04,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:05,065 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:28:05,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:05,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505511612] [2025-04-13 18:28:05,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505511612] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:28:05,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:28:05,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:28:05,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965767975] [2025-04-13 18:28:05,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:28:05,067 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:28:05,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:05,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:28:05,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:28:05,067 INFO L87 Difference]: Start difference. First operand 310 states and 1024 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:05,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:05,269 INFO L93 Difference]: Finished difference Result 356 states and 1162 transitions. [2025-04-13 18:28:05,269 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:28:05,269 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:05,269 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:05,271 INFO L225 Difference]: With dead ends: 356 [2025-04-13 18:28:05,271 INFO L226 Difference]: Without dead ends: 350 [2025-04-13 18:28:05,272 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:28:05,273 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:05,273 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:28:05,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-04-13 18:28:05,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 310. [2025-04-13 18:28:05,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 3.313915857605178) internal successors, (1024), 309 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:05,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 1024 transitions. [2025-04-13 18:28:05,280 INFO L79 Accepts]: Start accepts. Automaton has 310 states and 1024 transitions. Word has length 20 [2025-04-13 18:28:05,280 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:05,280 INFO L485 AbstractCegarLoop]: Abstraction has 310 states and 1024 transitions. [2025-04-13 18:28:05,280 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:05,280 INFO L278 IsEmpty]: Start isEmpty. Operand 310 states and 1024 transitions. [2025-04-13 18:28:05,281 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:28:05,281 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:05,281 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:28:05,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 18:28:05,282 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:28:05,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:05,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2004292739, now seen corresponding path program 11 times [2025-04-13 18:28:05,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:05,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085056371] [2025-04-13 18:28:05,282 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:28:05,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:05,287 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:28:05,293 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:28:05,297 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:28:05,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:05,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:05,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085056371] [2025-04-13 18:28:05,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085056371] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:05,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473948105] [2025-04-13 18:28:05,650 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:28:05,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:05,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:05,652 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:28:05,653 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:28:05,689 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:28:05,703 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:28:05,703 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:28:05,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:05,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 18:28:05,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:28:05,714 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:28:05,844 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:28:05,845 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 71 treesize of output 43 [2025-04-13 18:28:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:05,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:28:06,853 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 98 treesize of output 88 [2025-04-13 18:28:06,856 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 119 treesize of output 109 [2025-04-13 18:28:06,916 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 76 treesize of output 66 [2025-04-13 18:28:06,918 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 93 treesize of output 83 [2025-04-13 18:28:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:06,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473948105] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:28:06,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:28:06,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 21 [2025-04-13 18:28:06,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791742750] [2025-04-13 18:28:06,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:28:06,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 18:28:06,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:06,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 18:28:06,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:28:06,946 INFO L87 Difference]: Start difference. First operand 310 states and 1024 transitions. Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:09,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:09,893 INFO L93 Difference]: Finished difference Result 873 states and 2789 transitions. [2025-04-13 18:28:09,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 18:28:09,894 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 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:28:09,894 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:09,897 INFO L225 Difference]: With dead ends: 873 [2025-04-13 18:28:09,897 INFO L226 Difference]: Without dead ends: 867 [2025-04-13 18:28:09,898 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=946, Invalid=3344, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 18:28:09,899 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 294 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:09,899 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 0 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:28:09,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-04-13 18:28:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 310. [2025-04-13 18:28:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 3.307443365695793) internal successors, (1022), 309 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 1022 transitions. [2025-04-13 18:28:09,908 INFO L79 Accepts]: Start accepts. Automaton has 310 states and 1022 transitions. Word has length 20 [2025-04-13 18:28:09,909 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:09,909 INFO L485 AbstractCegarLoop]: Abstraction has 310 states and 1022 transitions. [2025-04-13 18:28:09,909 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:09,909 INFO L278 IsEmpty]: Start isEmpty. Operand 310 states and 1022 transitions. [2025-04-13 18:28:09,909 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:28:09,909 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:09,909 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:28:09,915 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:28:10,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:10,110 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:28:10,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:10,110 INFO L85 PathProgramCache]: Analyzing trace with hash -563959035, now seen corresponding path program 12 times [2025-04-13 18:28:10,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:10,111 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282650776] [2025-04-13 18:28:10,111 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:28:10,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:10,114 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:28:10,119 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 18:28:10,120 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:28:10,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:10,414 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:28:10,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:10,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282650776] [2025-04-13 18:28:10,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282650776] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:28:10,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:28:10,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:28:10,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825000682] [2025-04-13 18:28:10,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:28:10,415 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:28:10,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:10,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:28:10,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:28:10,415 INFO L87 Difference]: Start difference. First operand 310 states and 1022 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:10,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:10,653 INFO L93 Difference]: Finished difference Result 364 states and 1196 transitions. [2025-04-13 18:28:10,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:28:10,653 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:10,653 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:10,655 INFO L225 Difference]: With dead ends: 364 [2025-04-13 18:28:10,655 INFO L226 Difference]: Without dead ends: 358 [2025-04-13 18:28:10,656 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:28:10,656 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:10,656 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:28:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-04-13 18:28:10,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 298. [2025-04-13 18:28:10,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.323232323232323) internal successors, (987), 297 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:10,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 987 transitions. [2025-04-13 18:28:10,664 INFO L79 Accepts]: Start accepts. Automaton has 298 states and 987 transitions. Word has length 20 [2025-04-13 18:28:10,664 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:10,664 INFO L485 AbstractCegarLoop]: Abstraction has 298 states and 987 transitions. [2025-04-13 18:28:10,664 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:10,664 INFO L278 IsEmpty]: Start isEmpty. Operand 298 states and 987 transitions. [2025-04-13 18:28:10,665 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:28:10,665 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:10,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] [2025-04-13 18:28:10,665 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 18:28:10,665 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:28:10,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:10,665 INFO L85 PathProgramCache]: Analyzing trace with hash -371320263, now seen corresponding path program 13 times [2025-04-13 18:28:10,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:10,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212137392] [2025-04-13 18:28:10,665 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:28:10,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:10,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 18:28:10,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:28:10,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:28:10,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:11,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:11,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212137392] [2025-04-13 18:28:11,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212137392] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:11,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984998804] [2025-04-13 18:28:11,143 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:28:11,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:11,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:11,145 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:28:11,147 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:28:11,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 18:28:11,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:28:11,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:28:11,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:11,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 18:28:11,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:28:11,225 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:28:11,394 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 59 treesize of output 35 [2025-04-13 18:28:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:11,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:28:12,301 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 102 treesize of output 92 [2025-04-13 18:28:12,303 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 121 treesize of output 111 [2025-04-13 18:28:12,371 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 112 treesize of output 98 [2025-04-13 18:28:12,374 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 141 treesize of output 127 [2025-04-13 18:28:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:12,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984998804] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:28:12,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:28:12,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 24 [2025-04-13 18:28:12,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361794049] [2025-04-13 18:28:12,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:28:12,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 18:28:12,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:12,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 18:28:12,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:28:12,415 INFO L87 Difference]: Start difference. First operand 298 states and 987 transitions. Second operand has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 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:28:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:13,847 INFO L93 Difference]: Finished difference Result 862 states and 2812 transitions. [2025-04-13 18:28:13,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 18:28:13,848 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 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 20 [2025-04-13 18:28:13,848 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:13,851 INFO L225 Difference]: With dead ends: 862 [2025-04-13 18:28:13,851 INFO L226 Difference]: Without dead ends: 714 [2025-04-13 18:28:13,852 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=485, Invalid=2271, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 18:28:13,852 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 330 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:13,852 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 0 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:28:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-04-13 18:28:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 306. [2025-04-13 18:28:13,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 3.321311475409836) internal successors, (1013), 305 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 1013 transitions. [2025-04-13 18:28:13,860 INFO L79 Accepts]: Start accepts. Automaton has 306 states and 1013 transitions. Word has length 20 [2025-04-13 18:28:13,861 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:13,861 INFO L485 AbstractCegarLoop]: Abstraction has 306 states and 1013 transitions. [2025-04-13 18:28:13,861 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 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:28:13,861 INFO L278 IsEmpty]: Start isEmpty. Operand 306 states and 1013 transitions. [2025-04-13 18:28:13,861 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:28:13,861 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:13,861 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:28:13,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 18:28:14,062 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 18:28:14,062 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:28:14,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:14,062 INFO L85 PathProgramCache]: Analyzing trace with hash 219758141, now seen corresponding path program 14 times [2025-04-13 18:28:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:14,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146883794] [2025-04-13 18:28:14,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:28:14,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:14,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:28:14,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 18:28:14,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:28:14,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:14,378 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:28:14,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:14,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146883794] [2025-04-13 18:28:14,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146883794] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:28:14,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:28:14,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:28:14,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14599027] [2025-04-13 18:28:14,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:28:14,379 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:28:14,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:14,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:28:14,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:28:14,380 INFO L87 Difference]: Start difference. First operand 306 states and 1013 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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:28:14,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:14,523 INFO L93 Difference]: Finished difference Result 358 states and 1155 transitions. [2025-04-13 18:28:14,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:28:14,523 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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:28:14,523 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:14,525 INFO L225 Difference]: With dead ends: 358 [2025-04-13 18:28:14,525 INFO L226 Difference]: Without dead ends: 352 [2025-04-13 18:28:14,525 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:28:14,525 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:14,525 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:28:14,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-04-13 18:28:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 308. [2025-04-13 18:28:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 3.3159609120521174) internal successors, (1018), 307 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 1018 transitions. [2025-04-13 18:28:14,531 INFO L79 Accepts]: Start accepts. Automaton has 308 states and 1018 transitions. Word has length 20 [2025-04-13 18:28:14,531 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:14,531 INFO L485 AbstractCegarLoop]: Abstraction has 308 states and 1018 transitions. [2025-04-13 18:28:14,532 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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:28:14,532 INFO L278 IsEmpty]: Start isEmpty. Operand 308 states and 1018 transitions. [2025-04-13 18:28:14,532 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:28:14,532 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:14,532 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:28:14,532 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 18:28:14,532 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:28:14,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:14,533 INFO L85 PathProgramCache]: Analyzing trace with hash -767294839, now seen corresponding path program 15 times [2025-04-13 18:28:14,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:14,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280266365] [2025-04-13 18:28:14,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:28:14,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:14,537 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:28:14,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 18:28:14,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:28:14,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:14,786 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:28:14,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:14,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280266365] [2025-04-13 18:28:14,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280266365] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:28:14,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:28:14,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:28:14,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235212351] [2025-04-13 18:28:14,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:28:14,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:28:14,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:14,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:28:14,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:28:14,787 INFO L87 Difference]: Start difference. First operand 308 states and 1018 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:14,951 INFO L93 Difference]: Finished difference Result 368 states and 1179 transitions. [2025-04-13 18:28:14,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:28:14,951 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:14,951 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:14,953 INFO L225 Difference]: With dead ends: 368 [2025-04-13 18:28:14,953 INFO L226 Difference]: Without dead ends: 362 [2025-04-13 18:28:14,953 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:28:14,954 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:14,954 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:28:14,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-04-13 18:28:14,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 310. [2025-04-13 18:28:14,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 3.323624595469256) internal successors, (1027), 309 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:14,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 1027 transitions. [2025-04-13 18:28:14,960 INFO L79 Accepts]: Start accepts. Automaton has 310 states and 1027 transitions. Word has length 20 [2025-04-13 18:28:14,960 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:14,960 INFO L485 AbstractCegarLoop]: Abstraction has 310 states and 1027 transitions. [2025-04-13 18:28:14,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:14,960 INFO L278 IsEmpty]: Start isEmpty. Operand 310 states and 1027 transitions. [2025-04-13 18:28:14,961 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:28:14,961 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:14,961 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:28:14,961 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 18:28:14,961 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:28:14,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1843005995, now seen corresponding path program 16 times [2025-04-13 18:28:14,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:14,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219752870] [2025-04-13 18:28:14,961 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:28:14,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:14,966 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:28:14,973 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:28:14,973 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:28:14,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:15,265 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:28:15,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:15,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219752870] [2025-04-13 18:28:15,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219752870] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:28:15,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:28:15,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:28:15,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915480436] [2025-04-13 18:28:15,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:28:15,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:28:15,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:15,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:28:15,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:28:15,266 INFO L87 Difference]: Start difference. First operand 310 states and 1027 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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:28:15,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:15,532 INFO L93 Difference]: Finished difference Result 358 states and 1157 transitions. [2025-04-13 18:28:15,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:28:15,533 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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:28:15,533 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:15,535 INFO L225 Difference]: With dead ends: 358 [2025-04-13 18:28:15,535 INFO L226 Difference]: Without dead ends: 352 [2025-04-13 18:28:15,535 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:28:15,535 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:15,535 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:28:15,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-04-13 18:28:15,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 310. [2025-04-13 18:28:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 3.336569579288026) internal successors, (1031), 309 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:15,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 1031 transitions. [2025-04-13 18:28:15,541 INFO L79 Accepts]: Start accepts. Automaton has 310 states and 1031 transitions. Word has length 20 [2025-04-13 18:28:15,541 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:15,541 INFO L485 AbstractCegarLoop]: Abstraction has 310 states and 1031 transitions. [2025-04-13 18:28:15,541 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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:28:15,541 INFO L278 IsEmpty]: Start isEmpty. Operand 310 states and 1031 transitions. [2025-04-13 18:28:15,542 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:28:15,542 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:15,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:15,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 18:28:15,542 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:28:15,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:15,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2055721359, now seen corresponding path program 17 times [2025-04-13 18:28:15,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:15,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162967347] [2025-04-13 18:28:15,542 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:28:15,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:15,547 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:28:15,551 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:28:15,551 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:28:15,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:15,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:15,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162967347] [2025-04-13 18:28:15,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162967347] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:15,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255078089] [2025-04-13 18:28:15,844 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:28:15,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:15,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:15,847 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:28:15,849 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:28:15,883 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:28:15,895 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:28:15,895 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:28:15,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:15,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 18:28:15,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:28:15,908 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:28:16,068 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 59 treesize of output 35 [2025-04-13 18:28:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:16,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:28:16,986 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 98 treesize of output 88 [2025-04-13 18:28:16,988 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 119 treesize of output 109 [2025-04-13 18:28:17,040 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 76 treesize of output 66 [2025-04-13 18:28:17,042 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 93 treesize of output 83 [2025-04-13 18:28:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:17,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255078089] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:28:17,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:28:17,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 23 [2025-04-13 18:28:17,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976804221] [2025-04-13 18:28:17,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:28:17,055 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 18:28:17,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:17,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 18:28:17,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:28:17,055 INFO L87 Difference]: Start difference. First operand 310 states and 1031 transitions. Second operand has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:19,603 INFO L93 Difference]: Finished difference Result 671 states and 2229 transitions. [2025-04-13 18:28:19,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 18:28:19,603 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 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:28:19,603 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:19,606 INFO L225 Difference]: With dead ends: 671 [2025-04-13 18:28:19,606 INFO L226 Difference]: Without dead ends: 665 [2025-04-13 18:28:19,607 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=617, Invalid=2353, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 18:28:19,607 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:19,607 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 0 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:28:19,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-04-13 18:28:19,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 315. [2025-04-13 18:28:19,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 3.3535031847133756) internal successors, (1053), 314 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1053 transitions. [2025-04-13 18:28:19,615 INFO L79 Accepts]: Start accepts. Automaton has 315 states and 1053 transitions. Word has length 20 [2025-04-13 18:28:19,615 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:19,615 INFO L485 AbstractCegarLoop]: Abstraction has 315 states and 1053 transitions. [2025-04-13 18:28:19,615 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:19,615 INFO L278 IsEmpty]: Start isEmpty. Operand 315 states and 1053 transitions. [2025-04-13 18:28:19,616 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:28:19,616 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:19,616 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:28:19,622 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:28:19,816 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:19,816 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:28:19,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:19,817 INFO L85 PathProgramCache]: Analyzing trace with hash -2081949457, now seen corresponding path program 18 times [2025-04-13 18:28:19,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:19,817 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122120583] [2025-04-13 18:28:19,817 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:28:19,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:19,821 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 18:28:19,825 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 18:28:19,825 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:28:19,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:20,100 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:28:20,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:20,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122120583] [2025-04-13 18:28:20,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122120583] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:28:20,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:28:20,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:28:20,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520235535] [2025-04-13 18:28:20,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:28:20,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:28:20,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:20,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:28:20,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:28:20,101 INFO L87 Difference]: Start difference. First operand 315 states and 1053 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:20,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:20,328 INFO L93 Difference]: Finished difference Result 445 states and 1458 transitions. [2025-04-13 18:28:20,329 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:28:20,329 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:20,329 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:20,331 INFO L225 Difference]: With dead ends: 445 [2025-04-13 18:28:20,331 INFO L226 Difference]: Without dead ends: 439 [2025-04-13 18:28:20,331 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:28:20,332 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:20,332 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:28:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-04-13 18:28:20,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 306. [2025-04-13 18:28:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 3.3278688524590163) internal successors, (1015), 305 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 1015 transitions. [2025-04-13 18:28:20,338 INFO L79 Accepts]: Start accepts. Automaton has 306 states and 1015 transitions. Word has length 20 [2025-04-13 18:28:20,338 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:20,338 INFO L485 AbstractCegarLoop]: Abstraction has 306 states and 1015 transitions. [2025-04-13 18:28:20,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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:28:20,338 INFO L278 IsEmpty]: Start isEmpty. Operand 306 states and 1015 transitions. [2025-04-13 18:28:20,339 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:28:20,339 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:20,339 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] [2025-04-13 18:28:20,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 18:28:20,339 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:28:20,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:20,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1981644213, now seen corresponding path program 19 times [2025-04-13 18:28:20,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:20,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126741829] [2025-04-13 18:28:20,339 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:28:20,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:20,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 18:28:20,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:28:20,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:28:20,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:20,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:20,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126741829] [2025-04-13 18:28:20,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126741829] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:20,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148998991] [2025-04-13 18:28:20,381 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:28:20,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:20,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:20,383 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:28:20,385 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:28:20,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 18:28:20,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:28:20,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:28:20,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:20,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 18:28:20,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:28:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:20,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:28:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:20,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148998991] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:20,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:28:20,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-04-13 18:28:20,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346219282] [2025-04-13 18:28:20,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:28:20,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:28:20,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:20,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:28:20,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:28:20,511 INFO L87 Difference]: Start difference. First operand 306 states and 1015 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:20,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:20,573 INFO L93 Difference]: Finished difference Result 679 states and 2274 transitions. [2025-04-13 18:28:20,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:28:20,573 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 18:28:20,573 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:20,576 INFO L225 Difference]: With dead ends: 679 [2025-04-13 18:28:20,576 INFO L226 Difference]: Without dead ends: 592 [2025-04-13 18:28:20,576 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:28:20,577 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:20,577 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:28:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-04-13 18:28:20,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 394. [2025-04-13 18:28:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 3.427480916030534) internal successors, (1347), 393 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1347 transitions. [2025-04-13 18:28:20,585 INFO L79 Accepts]: Start accepts. Automaton has 394 states and 1347 transitions. Word has length 21 [2025-04-13 18:28:20,585 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:20,585 INFO L485 AbstractCegarLoop]: Abstraction has 394 states and 1347 transitions. [2025-04-13 18:28:20,585 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:20,585 INFO L278 IsEmpty]: Start isEmpty. Operand 394 states and 1347 transitions. [2025-04-13 18:28:20,586 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:28:20,586 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:20,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:20,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 18:28:20,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:20,786 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:28:20,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:20,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1465181936, now seen corresponding path program 1 times [2025-04-13 18:28:20,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:20,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198701709] [2025-04-13 18:28:20,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:28:20,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:20,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:28:20,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:28:20,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:28:20,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:20,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:20,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:20,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198701709] [2025-04-13 18:28:20,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198701709] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:20,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175317640] [2025-04-13 18:28:20,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:28:20,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:20,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:20,822 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:28:20,823 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:28:20,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:28:20,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:28:20,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:28:20,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:20,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:28:20,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:28:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:20,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:28:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:20,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175317640] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:28:20,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:28:20,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-13 18:28:20,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122233721] [2025-04-13 18:28:20,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:28:20,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:28:20,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:20,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:28:20,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:28:20,913 INFO L87 Difference]: Start difference. First operand 394 states and 1347 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:21,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:21,013 INFO L93 Difference]: Finished difference Result 664 states and 2135 transitions. [2025-04-13 18:28:21,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:28:21,013 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:28:21,013 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:21,016 INFO L225 Difference]: With dead ends: 664 [2025-04-13 18:28:21,016 INFO L226 Difference]: Without dead ends: 535 [2025-04-13 18:28:21,016 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:28:21,016 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:21,016 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:28:21,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-04-13 18:28:21,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 419. [2025-04-13 18:28:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 3.3014354066985647) internal successors, (1380), 418 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 1380 transitions. [2025-04-13 18:28:21,023 INFO L79 Accepts]: Start accepts. Automaton has 419 states and 1380 transitions. Word has length 22 [2025-04-13 18:28:21,023 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:21,023 INFO L485 AbstractCegarLoop]: Abstraction has 419 states and 1380 transitions. [2025-04-13 18:28:21,023 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:21,023 INFO L278 IsEmpty]: Start isEmpty. Operand 419 states and 1380 transitions. [2025-04-13 18:28:21,024 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:28:21,024 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:21,024 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] [2025-04-13 18:28:21,030 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:28:21,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:21,225 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:28:21,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:21,225 INFO L85 PathProgramCache]: Analyzing trace with hash 291660530, now seen corresponding path program 1 times [2025-04-13 18:28:21,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:21,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575006411] [2025-04-13 18:28:21,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:28:21,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:21,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:28:21,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:28:21,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:28:21,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:21,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:21,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575006411] [2025-04-13 18:28:21,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575006411] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:21,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228093200] [2025-04-13 18:28:21,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:28:21,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:21,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:21,267 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:28:21,268 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:28:21,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:28:21,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:28:21,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:28:21,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:21,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:28:21,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:28:21,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:21,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:28:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:21,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228093200] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:28:21,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:28:21,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 18:28:21,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833801247] [2025-04-13 18:28:21,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:28:21,409 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:28:21,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:21,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:28:21,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:28:21,409 INFO L87 Difference]: Start difference. First operand 419 states and 1380 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:21,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:21,474 INFO L93 Difference]: Finished difference Result 512 states and 1610 transitions. [2025-04-13 18:28:21,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:28:21,474 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:28:21,474 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:21,476 INFO L225 Difference]: With dead ends: 512 [2025-04-13 18:28:21,476 INFO L226 Difference]: Without dead ends: 426 [2025-04-13 18:28:21,476 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:28:21,477 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:21,477 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:28:21,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-04-13 18:28:21,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 410. [2025-04-13 18:28:21,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 3.234718826405868) internal successors, (1323), 409 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1323 transitions. [2025-04-13 18:28:21,485 INFO L79 Accepts]: Start accepts. Automaton has 410 states and 1323 transitions. Word has length 22 [2025-04-13 18:28:21,485 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:21,485 INFO L485 AbstractCegarLoop]: Abstraction has 410 states and 1323 transitions. [2025-04-13 18:28:21,485 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:21,485 INFO L278 IsEmpty]: Start isEmpty. Operand 410 states and 1323 transitions. [2025-04-13 18:28:21,486 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:28:21,486 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:21,486 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] [2025-04-13 18:28:21,492 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:28:21,689 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,SelfDestructingSolverStorable23 [2025-04-13 18:28:21,689 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:28:21,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:21,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1522306054, now seen corresponding path program 1 times [2025-04-13 18:28:21,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:21,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004383427] [2025-04-13 18:28:21,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:28:21,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:21,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:28:21,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:28:21,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:28:21,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:21,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:21,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004383427] [2025-04-13 18:28:21,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004383427] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:21,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395767828] [2025-04-13 18:28:21,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:28:21,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:21,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:21,728 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:28:21,731 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:28:21,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:28:21,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:28:21,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:28:21,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:21,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:28:21,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:28:21,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:21,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:28:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:21,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395767828] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:28:21,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:28:21,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 18:28:21,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270896714] [2025-04-13 18:28:21,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:28:21,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:28:21,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:21,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:28:21,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:28:21,871 INFO L87 Difference]: Start difference. First operand 410 states and 1323 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:21,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:21,944 INFO L93 Difference]: Finished difference Result 426 states and 1345 transitions. [2025-04-13 18:28:21,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:28:21,945 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:28:21,945 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:21,947 INFO L225 Difference]: With dead ends: 426 [2025-04-13 18:28:21,947 INFO L226 Difference]: Without dead ends: 279 [2025-04-13 18:28:21,947 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:28:21,947 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:21,947 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:28:21,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-04-13 18:28:21,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-04-13 18:28:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 3.4820143884892087) internal successors, (968), 278 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 968 transitions. [2025-04-13 18:28:21,958 INFO L79 Accepts]: Start accepts. Automaton has 279 states and 968 transitions. Word has length 22 [2025-04-13 18:28:21,958 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:21,958 INFO L485 AbstractCegarLoop]: Abstraction has 279 states and 968 transitions. [2025-04-13 18:28:21,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:21,958 INFO L278 IsEmpty]: Start isEmpty. Operand 279 states and 968 transitions. [2025-04-13 18:28:21,959 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 18:28:21,959 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:21,959 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:21,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 18:28:22,159 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,SelfDestructingSolverStorable24 [2025-04-13 18:28:22,160 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:28:22,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:22,160 INFO L85 PathProgramCache]: Analyzing trace with hash 775368770, now seen corresponding path program 2 times [2025-04-13 18:28:22,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:22,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257032335] [2025-04-13 18:28:22,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:28:22,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:22,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 18:28:22,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:28:22,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:28:22,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:22,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:28:22,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:22,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257032335] [2025-04-13 18:28:22,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257032335] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:28:22,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:28:22,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:28:22,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808936240] [2025-04-13 18:28:22,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:28:22,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:28:22,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:22,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:28:22,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:28:22,207 INFO L87 Difference]: Start difference. First operand 279 states and 968 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:22,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:22,290 INFO L93 Difference]: Finished difference Result 321 states and 1059 transitions. [2025-04-13 18:28:22,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:28:22,290 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 18:28:22,290 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:22,292 INFO L225 Difference]: With dead ends: 321 [2025-04-13 18:28:22,292 INFO L226 Difference]: Without dead ends: 307 [2025-04-13 18:28:22,292 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:28:22,292 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:22,292 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:28:22,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-04-13 18:28:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 295. [2025-04-13 18:28:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 3.421768707482993) internal successors, (1006), 294 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 1006 transitions. [2025-04-13 18:28:22,299 INFO L79 Accepts]: Start accepts. Automaton has 295 states and 1006 transitions. Word has length 23 [2025-04-13 18:28:22,299 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:22,299 INFO L485 AbstractCegarLoop]: Abstraction has 295 states and 1006 transitions. [2025-04-13 18:28:22,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:22,299 INFO L278 IsEmpty]: Start isEmpty. Operand 295 states and 1006 transitions. [2025-04-13 18:28:22,300 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 18:28:22,300 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:22,300 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:22,300 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 18:28:22,300 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:28:22,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:22,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1371258112, now seen corresponding path program 3 times [2025-04-13 18:28:22,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:22,301 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105065276] [2025-04-13 18:28:22,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:28:22,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:22,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 18:28:22,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-04-13 18:28:22,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:28:22,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:28:22,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:22,343 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105065276] [2025-04-13 18:28:22,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105065276] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:28:22,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:28:22,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:28:22,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290397658] [2025-04-13 18:28:22,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:28:22,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:28:22,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:22,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:28:22,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:28:22,344 INFO L87 Difference]: Start difference. First operand 295 states and 1006 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:22,412 INFO L93 Difference]: Finished difference Result 333 states and 1095 transitions. [2025-04-13 18:28:22,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:28:22,412 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 18:28:22,412 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:22,414 INFO L225 Difference]: With dead ends: 333 [2025-04-13 18:28:22,414 INFO L226 Difference]: Without dead ends: 323 [2025-04-13 18:28:22,414 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:28:22,414 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:22,414 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:28:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-04-13 18:28:22,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 311. [2025-04-13 18:28:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 310 states have (on average 3.367741935483871) internal successors, (1044), 310 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 1044 transitions. [2025-04-13 18:28:22,419 INFO L79 Accepts]: Start accepts. Automaton has 311 states and 1044 transitions. Word has length 23 [2025-04-13 18:28:22,419 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:22,419 INFO L485 AbstractCegarLoop]: Abstraction has 311 states and 1044 transitions. [2025-04-13 18:28:22,419 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:22,419 INFO L278 IsEmpty]: Start isEmpty. Operand 311 states and 1044 transitions. [2025-04-13 18:28:22,419 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 18:28:22,420 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:22,420 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:22,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 18:28:22,420 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:28:22,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:22,420 INFO L85 PathProgramCache]: Analyzing trace with hash -199544672, now seen corresponding path program 4 times [2025-04-13 18:28:22,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:22,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326664130] [2025-04-13 18:28:22,420 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:28:22,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:22,424 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 18:28:22,425 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 18:28:22,425 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:28:22,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:22,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:28:22,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:22,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326664130] [2025-04-13 18:28:22,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326664130] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:22,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8357183] [2025-04-13 18:28:22,451 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:28:22,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:22,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:22,453 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:28:22,454 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:28:22,494 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 18:28:22,504 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 18:28:22,504 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:28:22,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:22,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:28:22,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:28:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:28:22,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:28:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:28:22,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8357183] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:28:22,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:28:22,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-04-13 18:28:22,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506007298] [2025-04-13 18:28:22,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:28:22,559 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:28:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:22,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:28:22,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:28:22,559 INFO L87 Difference]: Start difference. First operand 311 states and 1044 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:22,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:22,683 INFO L93 Difference]: Finished difference Result 409 states and 1281 transitions. [2025-04-13 18:28:22,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:28:22,683 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 18:28:22,683 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:22,685 INFO L225 Difference]: With dead ends: 409 [2025-04-13 18:28:22,685 INFO L226 Difference]: Without dead ends: 399 [2025-04-13 18:28:22,685 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:28:22,686 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:22,686 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:28:22,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-04-13 18:28:22,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 333. [2025-04-13 18:28:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 3.3042168674698793) internal successors, (1097), 332 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1097 transitions. [2025-04-13 18:28:22,691 INFO L79 Accepts]: Start accepts. Automaton has 333 states and 1097 transitions. Word has length 23 [2025-04-13 18:28:22,691 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:22,691 INFO L485 AbstractCegarLoop]: Abstraction has 333 states and 1097 transitions. [2025-04-13 18:28:22,691 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:22,691 INFO L278 IsEmpty]: Start isEmpty. Operand 333 states and 1097 transitions. [2025-04-13 18:28:22,692 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 18:28:22,692 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:22,692 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:22,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 18:28:22,892 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,SelfDestructingSolverStorable27 [2025-04-13 18:28:22,892 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:28:22,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:22,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1202643734, now seen corresponding path program 5 times [2025-04-13 18:28:22,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:22,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729439885] [2025-04-13 18:28:22,893 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:28:22,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:22,897 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 18:28:22,899 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:28:22,899 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:28:22,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:28:22,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:22,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729439885] [2025-04-13 18:28:22,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729439885] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:28:22,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:28:22,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:28:22,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047788107] [2025-04-13 18:28:22,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:28:22,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:28:22,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:22,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:28:22,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:28:22,926 INFO L87 Difference]: Start difference. First operand 333 states and 1097 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:23,013 INFO L93 Difference]: Finished difference Result 431 states and 1464 transitions. [2025-04-13 18:28:23,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:28:23,013 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 18:28:23,013 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:23,015 INFO L225 Difference]: With dead ends: 431 [2025-04-13 18:28:23,015 INFO L226 Difference]: Without dead ends: 417 [2025-04-13 18:28:23,015 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:28:23,015 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:23,015 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:28:23,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-04-13 18:28:23,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 369. [2025-04-13 18:28:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 368 states have (on average 3.3559782608695654) internal successors, (1235), 368 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1235 transitions. [2025-04-13 18:28:23,021 INFO L79 Accepts]: Start accepts. Automaton has 369 states and 1235 transitions. Word has length 23 [2025-04-13 18:28:23,021 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:23,021 INFO L485 AbstractCegarLoop]: Abstraction has 369 states and 1235 transitions. [2025-04-13 18:28:23,021 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:23,022 INFO L278 IsEmpty]: Start isEmpty. Operand 369 states and 1235 transitions. [2025-04-13 18:28:23,022 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 18:28:23,022 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:23,022 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:23,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 18:28:23,022 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:28:23,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:23,023 INFO L85 PathProgramCache]: Analyzing trace with hash -923436524, now seen corresponding path program 6 times [2025-04-13 18:28:23,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:23,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744195143] [2025-04-13 18:28:23,023 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:28:23,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:23,030 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 18:28:23,033 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:28:23,033 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:28:23,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:28:23,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:23,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744195143] [2025-04-13 18:28:23,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744195143] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:23,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583678070] [2025-04-13 18:28:23,062 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:28:23,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:23,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:23,066 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:28:23,067 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:28:23,113 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 18:28:23,142 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:28:23,142 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:28:23,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:23,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:28:23,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:28:23,185 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:28:23,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:28:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:28:23,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583678070] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:23,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:28:23,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2025-04-13 18:28:23,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531234356] [2025-04-13 18:28:23,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:28:23,223 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:28:23,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:23,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:28:23,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:28:23,223 INFO L87 Difference]: Start difference. First operand 369 states and 1235 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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:28:23,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:23,279 INFO L93 Difference]: Finished difference Result 642 states and 2109 transitions. [2025-04-13 18:28:23,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:28:23,279 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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:28:23,279 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:23,282 INFO L225 Difference]: With dead ends: 642 [2025-04-13 18:28:23,282 INFO L226 Difference]: Without dead ends: 622 [2025-04-13 18:28:23,282 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:28:23,282 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:23,282 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:28:23,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-04-13 18:28:23,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 363. [2025-04-13 18:28:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 3.414364640883978) internal successors, (1236), 362 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:23,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 1236 transitions. [2025-04-13 18:28:23,289 INFO L79 Accepts]: Start accepts. Automaton has 363 states and 1236 transitions. Word has length 23 [2025-04-13 18:28:23,289 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:23,289 INFO L485 AbstractCegarLoop]: Abstraction has 363 states and 1236 transitions. [2025-04-13 18:28:23,289 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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:28:23,289 INFO L278 IsEmpty]: Start isEmpty. Operand 363 states and 1236 transitions. [2025-04-13 18:28:23,289 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 18:28:23,289 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:23,289 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:23,296 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:28:23,490 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:23,490 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:28:23,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:23,491 INFO L85 PathProgramCache]: Analyzing trace with hash -353959718, now seen corresponding path program 7 times [2025-04-13 18:28:23,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:23,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088670332] [2025-04-13 18:28:23,491 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:28:23,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:23,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 18:28:23,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:28:23,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:28:23,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:23,532 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:28:23,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:23,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088670332] [2025-04-13 18:28:23,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088670332] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:23,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412394840] [2025-04-13 18:28:23,532 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:28:23,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:23,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:23,534 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:28:23,535 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:28:23,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 18:28:23,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:28:23,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:28:23,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:23,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:28:23,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:28:23,617 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:28:23,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:28:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:28:23,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412394840] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:23,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:28:23,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-13 18:28:23,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079969175] [2025-04-13 18:28:23,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:28:23,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:28:23,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:23,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:28:23,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:28:23,654 INFO L87 Difference]: Start difference. First operand 363 states and 1236 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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:28:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:23,712 INFO L93 Difference]: Finished difference Result 490 states and 1547 transitions. [2025-04-13 18:28:23,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:28:23,716 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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:28:23,716 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:23,718 INFO L225 Difference]: With dead ends: 490 [2025-04-13 18:28:23,718 INFO L226 Difference]: Without dead ends: 474 [2025-04-13 18:28:23,718 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:28:23,718 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:23,718 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:28:23,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-04-13 18:28:23,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 376. [2025-04-13 18:28:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 375 states have (on average 3.3813333333333335) internal successors, (1268), 375 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1268 transitions. [2025-04-13 18:28:23,724 INFO L79 Accepts]: Start accepts. Automaton has 376 states and 1268 transitions. Word has length 23 [2025-04-13 18:28:23,724 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:23,724 INFO L485 AbstractCegarLoop]: Abstraction has 376 states and 1268 transitions. [2025-04-13 18:28:23,724 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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:28:23,724 INFO L278 IsEmpty]: Start isEmpty. Operand 376 states and 1268 transitions. [2025-04-13 18:28:23,725 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 18:28:23,725 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:23,725 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:23,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 18:28:23,925 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:23,926 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:28:23,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:23,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1544526846, now seen corresponding path program 8 times [2025-04-13 18:28:23,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:23,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886534641] [2025-04-13 18:28:23,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:28:23,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:23,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 18:28:23,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:28:23,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:28:23,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:28:23,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:23,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886534641] [2025-04-13 18:28:23,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886534641] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:23,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103859432] [2025-04-13 18:28:23,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:28:23,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:23,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:23,966 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:28:23,968 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:28:24,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 18:28:24,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:28:24,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:28:24,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:24,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:28:24,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:28:24,067 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:28:24,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:28:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:28:24,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103859432] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:24,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:28:24,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-13 18:28:24,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893888644] [2025-04-13 18:28:24,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:28:24,102 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:28:24,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:24,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:28:24,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:28:24,103 INFO L87 Difference]: Start difference. First operand 376 states and 1268 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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:28:24,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:24,166 INFO L93 Difference]: Finished difference Result 514 states and 1592 transitions. [2025-04-13 18:28:24,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:28:24,166 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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:28:24,166 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:24,169 INFO L225 Difference]: With dead ends: 514 [2025-04-13 18:28:24,169 INFO L226 Difference]: Without dead ends: 498 [2025-04-13 18:28:24,169 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:28:24,169 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:24,169 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:28:24,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-04-13 18:28:24,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 372. [2025-04-13 18:28:24,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 3.3827493261455523) internal successors, (1255), 371 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1255 transitions. [2025-04-13 18:28:24,177 INFO L79 Accepts]: Start accepts. Automaton has 372 states and 1255 transitions. Word has length 23 [2025-04-13 18:28:24,177 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:24,177 INFO L485 AbstractCegarLoop]: Abstraction has 372 states and 1255 transitions. [2025-04-13 18:28:24,177 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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:28:24,177 INFO L278 IsEmpty]: Start isEmpty. Operand 372 states and 1255 transitions. [2025-04-13 18:28:24,178 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:28:24,178 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:24,178 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:24,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 18:28:24,378 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,SelfDestructingSolverStorable31 [2025-04-13 18:28:24,378 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:28:24,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:24,379 INFO L85 PathProgramCache]: Analyzing trace with hash 159403273, now seen corresponding path program 1 times [2025-04-13 18:28:24,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:24,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507286051] [2025-04-13 18:28:24,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:28:24,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:24,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:28:24,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:28:24,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:28:24,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:25,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:25,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507286051] [2025-04-13 18:28:25,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507286051] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:25,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501447929] [2025-04-13 18:28:25,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:28:25,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:25,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:25,506 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:28:25,507 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:28:25,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:28:25,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:28:25,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:28:25,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:25,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:28:25,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:28:25,601 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 19 treesize of output 1 [2025-04-13 18:28:26,024 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:28:26,024 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 132 treesize of output 72 [2025-04-13 18:28:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:26,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:28:31,246 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 246 treesize of output 214 [2025-04-13 18:28:31,251 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:28:31,251 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 360 treesize of output 288 [2025-04-13 18:28:31,450 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 572 treesize of output 510 [2025-04-13 18:28:31,459 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:28:31,460 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 714 treesize of output 596 [2025-04-13 18:28:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:28:31,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501447929] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:28:31,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:28:31,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 36 [2025-04-13 18:28:31,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587182992] [2025-04-13 18:28:31,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:28:31,941 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:28:31,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:31,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:28:31,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:28:31,943 INFO L87 Difference]: Start difference. First operand 372 states and 1255 transitions. Second operand has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 37 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:28:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:39,468 INFO L93 Difference]: Finished difference Result 791 states and 2541 transitions. [2025-04-13 18:28:39,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-13 18:28:39,468 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 37 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 25 [2025-04-13 18:28:39,468 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:39,471 INFO L225 Difference]: With dead ends: 791 [2025-04-13 18:28:39,471 INFO L226 Difference]: Without dead ends: 780 [2025-04-13 18:28:39,472 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1429 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=808, Invalid=5044, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 18:28:39,473 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 399 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:39,473 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 0 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2625 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 18:28:39,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-04-13 18:28:39,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 443. [2025-04-13 18:28:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.3800904977375565) internal successors, (1494), 442 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1494 transitions. [2025-04-13 18:28:39,480 INFO L79 Accepts]: Start accepts. Automaton has 443 states and 1494 transitions. Word has length 25 [2025-04-13 18:28:39,480 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:39,480 INFO L485 AbstractCegarLoop]: Abstraction has 443 states and 1494 transitions. [2025-04-13 18:28:39,480 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 37 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:28:39,480 INFO L278 IsEmpty]: Start isEmpty. Operand 443 states and 1494 transitions. [2025-04-13 18:28:39,481 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:28:39,481 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:39,481 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:39,486 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:28:39,681 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:39,681 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:28:39,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:39,682 INFO L85 PathProgramCache]: Analyzing trace with hash -736261405, now seen corresponding path program 2 times [2025-04-13 18:28:39,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:39,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903394558] [2025-04-13 18:28:39,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:28:39,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:39,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:28:39,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:28:39,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:28:39,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:40,665 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:28:40,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:40,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903394558] [2025-04-13 18:28:40,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903394558] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:40,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288420421] [2025-04-13 18:28:40,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:28:40,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:40,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:40,667 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:28:40,668 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:28:40,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:28:40,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:28:40,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:28:40,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:40,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 18:28:40,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:28:41,165 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:28:41,166 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 88 [2025-04-13 18:28:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:28:41,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:28:42,766 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:28:42,767 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 463 treesize of output 199 [2025-04-13 18:28:43,630 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:28:43,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288420421] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:28:43,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:28:43,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 18:28:43,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178124718] [2025-04-13 18:28:43,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:28:43,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:28:43,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:43,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:28:43,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1033, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:28:43,631 INFO L87 Difference]: Start difference. First operand 443 states and 1494 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:46,959 INFO L93 Difference]: Finished difference Result 620 states and 2025 transitions. [2025-04-13 18:28:46,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 18:28:46,959 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 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:28:46,959 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:46,962 INFO L225 Difference]: With dead ends: 620 [2025-04-13 18:28:46,962 INFO L226 Difference]: Without dead ends: 609 [2025-04-13 18:28:46,963 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1136 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=517, Invalid=3515, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 18:28:46,963 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 190 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:46,963 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 0 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2193 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:28:46,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-04-13 18:28:46,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 475. [2025-04-13 18:28:46,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 474 states have (on average 3.3607594936708862) internal successors, (1593), 474 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1593 transitions. [2025-04-13 18:28:46,971 INFO L79 Accepts]: Start accepts. Automaton has 475 states and 1593 transitions. Word has length 25 [2025-04-13 18:28:46,971 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:46,971 INFO L485 AbstractCegarLoop]: Abstraction has 475 states and 1593 transitions. [2025-04-13 18:28:46,971 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:46,971 INFO L278 IsEmpty]: Start isEmpty. Operand 475 states and 1593 transitions. [2025-04-13 18:28:46,972 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:28:46,972 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:46,972 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:46,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 18:28:47,172 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:47,173 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:28:47,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:47,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1228576781, now seen corresponding path program 3 times [2025-04-13 18:28:47,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:47,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292332502] [2025-04-13 18:28:47,173 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:28:47,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:47,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:28:47,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:28:47,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:28:47,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:28:47,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:47,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292332502] [2025-04-13 18:28:47,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292332502] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:28:47,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:28:47,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:28:47,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349401030] [2025-04-13 18:28:47,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:28:47,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:28:47,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:47,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:28:47,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:28:47,704 INFO L87 Difference]: Start difference. First operand 475 states and 1593 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:28:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:48,132 INFO L93 Difference]: Finished difference Result 587 states and 1951 transitions. [2025-04-13 18:28:48,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:28:48,133 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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 25 [2025-04-13 18:28:48,133 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:48,135 INFO L225 Difference]: With dead ends: 587 [2025-04-13 18:28:48,135 INFO L226 Difference]: Without dead ends: 581 [2025-04-13 18:28:48,135 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:28:48,135 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:48,136 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:28:48,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-04-13 18:28:48,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 499. [2025-04-13 18:28:48,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 3.3694779116465865) internal successors, (1678), 498 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1678 transitions. [2025-04-13 18:28:48,143 INFO L79 Accepts]: Start accepts. Automaton has 499 states and 1678 transitions. Word has length 25 [2025-04-13 18:28:48,143 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:48,143 INFO L485 AbstractCegarLoop]: Abstraction has 499 states and 1678 transitions. [2025-04-13 18:28:48,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:28:48,143 INFO L278 IsEmpty]: Start isEmpty. Operand 499 states and 1678 transitions. [2025-04-13 18:28:48,144 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:28:48,144 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:48,144 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:48,144 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 18:28:48,144 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:28:48,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:48,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1082756789, now seen corresponding path program 4 times [2025-04-13 18:28:48,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:48,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189589949] [2025-04-13 18:28:48,144 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:28:48,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:48,148 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:28:48,155 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:28:48,155 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:28:48,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:28:48,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:48,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189589949] [2025-04-13 18:28:48,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189589949] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:48,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768830065] [2025-04-13 18:28:48,741 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:28:48,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:48,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:48,743 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:28:48,745 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:28:48,790 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:28:48,806 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:28:48,806 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:28:48,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:48,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:28:48,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:28:49,223 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:28:49,223 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 72 [2025-04-13 18:28:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:28:49,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:28:50,891 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:28:50,892 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 661 treesize of output 257 [2025-04-13 18:28:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:28:53,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768830065] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:28:53,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:28:53,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 32 [2025-04-13 18:28:53,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448537268] [2025-04-13 18:28:53,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:28:53,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:28:53,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:53,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:28:53,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:28:53,866 INFO L87 Difference]: Start difference. First operand 499 states and 1678 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:59,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:59,099 INFO L93 Difference]: Finished difference Result 759 states and 2442 transitions. [2025-04-13 18:28:59,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-04-13 18:28:59,099 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:28:59,100 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:59,102 INFO L225 Difference]: With dead ends: 759 [2025-04-13 18:28:59,102 INFO L226 Difference]: Without dead ends: 743 [2025-04-13 18:28:59,103 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2490 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=885, Invalid=7487, Unknown=0, NotChecked=0, Total=8372 [2025-04-13 18:28:59,104 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 267 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3298 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:59,104 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 0 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3298 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 18:28:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-04-13 18:28:59,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 519. [2025-04-13 18:28:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 3.370656370656371) internal successors, (1746), 518 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:59,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1746 transitions. [2025-04-13 18:28:59,113 INFO L79 Accepts]: Start accepts. Automaton has 519 states and 1746 transitions. Word has length 25 [2025-04-13 18:28:59,113 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:59,113 INFO L485 AbstractCegarLoop]: Abstraction has 519 states and 1746 transitions. [2025-04-13 18:28:59,114 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:59,114 INFO L278 IsEmpty]: Start isEmpty. Operand 519 states and 1746 transitions. [2025-04-13 18:28:59,114 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:28:59,115 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:59,115 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:59,121 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:28:59,316 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,SelfDestructingSolverStorable35 [2025-04-13 18:28:59,316 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:28:59,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:59,317 INFO L85 PathProgramCache]: Analyzing trace with hash -758552537, now seen corresponding path program 5 times [2025-04-13 18:28:59,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:59,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109007721] [2025-04-13 18:28:59,317 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:28:59,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:59,321 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:28:59,327 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:28:59,327 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:28:59,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:59,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:59,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109007721] [2025-04-13 18:28:59,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109007721] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:59,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030986451] [2025-04-13 18:28:59,972 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:28:59,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:59,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:59,974 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:28:59,975 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:29:00,017 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:29:00,033 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:29:00,034 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:29:00,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:00,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:29:00,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:29:00,486 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:29:00,486 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 72 [2025-04-13 18:29:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:29:00,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:29:02,179 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:29:02,180 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 557 treesize of output 271 [2025-04-13 18:29:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:29:03,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030986451] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:29:03,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:29:03,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 12] total 34 [2025-04-13 18:29:03,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554443819] [2025-04-13 18:29:03,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:29:03,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:29:03,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:29:03,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:29:03,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1107, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:29:03,537 INFO L87 Difference]: Start difference. First operand 519 states and 1746 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 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:29:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:29:04,707 INFO L93 Difference]: Finished difference Result 619 states and 2042 transitions. [2025-04-13 18:29:04,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:29:04,708 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 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 25 [2025-04-13 18:29:04,708 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:29:04,710 INFO L225 Difference]: With dead ends: 619 [2025-04-13 18:29:04,710 INFO L226 Difference]: Without dead ends: 613 [2025-04-13 18:29:04,710 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=197, Invalid=1609, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:29:04,710 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:29:04,711 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:29:04,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-04-13 18:29:04,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 535. [2025-04-13 18:29:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 3.3614232209737827) internal successors, (1795), 534 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:29:04,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1795 transitions. [2025-04-13 18:29:04,718 INFO L79 Accepts]: Start accepts. Automaton has 535 states and 1795 transitions. Word has length 25 [2025-04-13 18:29:04,718 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:29:04,718 INFO L485 AbstractCegarLoop]: Abstraction has 535 states and 1795 transitions. [2025-04-13 18:29:04,718 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 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:29:04,718 INFO L278 IsEmpty]: Start isEmpty. Operand 535 states and 1795 transitions. [2025-04-13 18:29:04,719 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:29:04,719 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:29:04,719 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:29:04,725 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:29:04,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 18:29:04,920 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:29:04,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:29:04,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1056876323, now seen corresponding path program 6 times [2025-04-13 18:29:04,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:29:04,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489108848] [2025-04-13 18:29:04,920 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:29:04,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:29:04,924 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:29:04,932 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:29:04,932 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:29:04,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:29:05,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:29:05,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489108848] [2025-04-13 18:29:05,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489108848] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:29:05,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473156436] [2025-04-13 18:29:05,616 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:29:05,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:29:05,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:29:05,618 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:29:05,619 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:29:05,661 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:29:05,675 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:29:05,675 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:29:05,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:05,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 18:29:05,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:29:06,108 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:29:06,109 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 88 [2025-04-13 18:29:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:29:06,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:29:08,877 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:29:08,878 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 583 treesize of output 279 [2025-04-13 18:29:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:29:10,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473156436] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:29:10,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:29:10,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 18:29:10,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110814432] [2025-04-13 18:29:10,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:29:10,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:29:10,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:29:10,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:29:10,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1022, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:29:10,089 INFO L87 Difference]: Start difference. First operand 535 states and 1795 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:29:20,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:29:20,811 INFO L93 Difference]: Finished difference Result 926 states and 3144 transitions. [2025-04-13 18:29:20,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-04-13 18:29:20,812 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 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:29:20,812 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:29:20,814 INFO L225 Difference]: With dead ends: 926 [2025-04-13 18:29:20,814 INFO L226 Difference]: Without dead ends: 915 [2025-04-13 18:29:20,816 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2783 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1161, Invalid=7581, Unknown=0, NotChecked=0, Total=8742 [2025-04-13 18:29:20,816 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 257 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2942 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:29:20,816 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 0 Invalid, 3044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2942 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 18:29:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-04-13 18:29:20,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 543. [2025-04-13 18:29:20,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 3.356088560885609) internal successors, (1819), 542 states have internal predecessors, (1819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:29:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1819 transitions. [2025-04-13 18:29:20,825 INFO L79 Accepts]: Start accepts. Automaton has 543 states and 1819 transitions. Word has length 25 [2025-04-13 18:29:20,825 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:29:20,825 INFO L485 AbstractCegarLoop]: Abstraction has 543 states and 1819 transitions. [2025-04-13 18:29:20,826 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:29:20,826 INFO L278 IsEmpty]: Start isEmpty. Operand 543 states and 1819 transitions. [2025-04-13 18:29:20,826 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:29:20,826 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:29:20,826 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:29:20,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 18:29:21,027 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 18:29:21,027 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:29:21,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:29:21,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1255541837, now seen corresponding path program 7 times [2025-04-13 18:29:21,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:29:21,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368902553] [2025-04-13 18:29:21,028 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:29:21,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:29:21,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:29:21,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:29:21,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:29:21,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:29:21,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:29:21,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368902553] [2025-04-13 18:29:21,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368902553] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:29:21,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800236420] [2025-04-13 18:29:21,721 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:29:21,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:29:21,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:29:21,723 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:29:21,723 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:29:21,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:29:21,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:29:21,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:29:21,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:21,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:29:21,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:29:21,833 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 19 treesize of output 1 [2025-04-13 18:29:22,336 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:29:22,337 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 160 treesize of output 82 [2025-04-13 18:29:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:29:22,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:29:26,953 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 187 treesize of output 163 [2025-04-13 18:29:26,957 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:29:26,958 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 258 treesize of output 210 [2025-04-13 18:29:27,083 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 427 treesize of output 381 [2025-04-13 18:29:27,090 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:29:27,091 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 514 treesize of output 434 [2025-04-13 18:29:27,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:29:27,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800236420] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:29:27,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:29:27,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 36 [2025-04-13 18:29:27,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628994574] [2025-04-13 18:29:27,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:29:27,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:29:27,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:29:27,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:29:27,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1209, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:29:27,546 INFO L87 Difference]: Start difference. First operand 543 states and 1819 transitions. Second operand has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 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:29:34,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:29:34,504 INFO L93 Difference]: Finished difference Result 934 states and 3033 transitions. [2025-04-13 18:29:34,504 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 18:29:34,504 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 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 25 [2025-04-13 18:29:34,504 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:29:34,507 INFO L225 Difference]: With dead ends: 934 [2025-04-13 18:29:34,507 INFO L226 Difference]: Without dead ends: 923 [2025-04-13 18:29:34,508 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=746, Invalid=5260, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 18:29:34,508 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 366 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2571 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:29:34,508 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 0 Invalid, 2620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2571 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 18:29:34,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-04-13 18:29:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 563. [2025-04-13 18:29:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 562 states have (on average 3.386120996441281) internal successors, (1903), 562 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:29:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1903 transitions. [2025-04-13 18:29:34,517 INFO L79 Accepts]: Start accepts. Automaton has 563 states and 1903 transitions. Word has length 25 [2025-04-13 18:29:34,517 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:29:34,518 INFO L485 AbstractCegarLoop]: Abstraction has 563 states and 1903 transitions. [2025-04-13 18:29:34,518 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 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:29:34,518 INFO L278 IsEmpty]: Start isEmpty. Operand 563 states and 1903 transitions. [2025-04-13 18:29:34,518 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:29:34,518 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:29:34,519 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:29:34,525 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:29:34,719 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:29:34,719 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:29:34,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:29:34,719 INFO L85 PathProgramCache]: Analyzing trace with hash -930252995, now seen corresponding path program 8 times [2025-04-13 18:29:34,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:29:34,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437141533] [2025-04-13 18:29:34,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:29:34,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:29:34,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:29:34,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:29:34,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:29:34,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:29:36,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:29:36,722 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437141533] [2025-04-13 18:29:36,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437141533] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:29:36,722 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196901800] [2025-04-13 18:29:36,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:29:36,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:29:36,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:29:36,724 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:29:36,725 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:29:36,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:29:36,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:29:36,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:29:36,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:36,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 18:29:36,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:29:37,213 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:29:37,213 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 88 [2025-04-13 18:29:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:29:37,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:29:39,320 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:29:39,320 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 497 treesize of output 225 [2025-04-13 18:29:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:29:40,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196901800] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:29:40,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:29:40,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 36 [2025-04-13 18:29:40,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570688283] [2025-04-13 18:29:40,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:29:40,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:29:40,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:29:40,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:29:40,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1235, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:29:40,218 INFO L87 Difference]: Start difference. First operand 563 states and 1903 transitions. Second operand has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:29:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:29:51,893 INFO L93 Difference]: Finished difference Result 953 states and 3275 transitions. [2025-04-13 18:29:51,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-04-13 18:29:51,894 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 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:29:51,894 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:29:51,897 INFO L225 Difference]: With dead ends: 953 [2025-04-13 18:29:51,897 INFO L226 Difference]: Without dead ends: 942 [2025-04-13 18:29:51,897 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3254 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=1451, Invalid=9891, Unknown=0, NotChecked=0, Total=11342 [2025-04-13 18:29:51,898 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 314 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3220 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 3220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:29:51,898 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 0 Invalid, 3337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 3220 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 18:29:51,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-04-13 18:29:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 579. [2025-04-13 18:29:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 578 states have (on average 3.4100346020761245) internal successors, (1971), 578 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:29:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1971 transitions. [2025-04-13 18:29:51,907 INFO L79 Accepts]: Start accepts. Automaton has 579 states and 1971 transitions. Word has length 25 [2025-04-13 18:29:51,907 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:29:51,907 INFO L485 AbstractCegarLoop]: Abstraction has 579 states and 1971 transitions. [2025-04-13 18:29:51,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:29:51,907 INFO L278 IsEmpty]: Start isEmpty. Operand 579 states and 1971 transitions. [2025-04-13 18:29:51,908 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:29:51,908 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:29:51,908 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:29:51,914 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:29:52,108 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,SelfDestructingSolverStorable39 [2025-04-13 18:29:52,108 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:29:52,108 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:29:52,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1458075333, now seen corresponding path program 9 times [2025-04-13 18:29:52,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:29:52,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251025497] [2025-04-13 18:29:52,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:29:52,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:29:52,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:29:52,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:29:52,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:29:52,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:29:52,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:29:52,693 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251025497] [2025-04-13 18:29:52,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251025497] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:29:52,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:29:52,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:29:52,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223507862] [2025-04-13 18:29:52,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:29:52,694 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:29:52,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:29:52,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:29:52,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:29:52,694 INFO L87 Difference]: Start difference. First operand 579 states and 1971 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:29:53,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:29:53,225 INFO L93 Difference]: Finished difference Result 707 states and 2396 transitions. [2025-04-13 18:29:53,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:29:53,225 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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 25 [2025-04-13 18:29:53,225 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:29:53,228 INFO L225 Difference]: With dead ends: 707 [2025-04-13 18:29:53,228 INFO L226 Difference]: Without dead ends: 701 [2025-04-13 18:29:53,228 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:29:53,228 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:29:53,228 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:29:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-04-13 18:29:53,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 587. [2025-04-13 18:29:53,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 586 states have (on average 3.407849829351536) internal successors, (1997), 586 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:29:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1997 transitions. [2025-04-13 18:29:53,237 INFO L79 Accepts]: Start accepts. Automaton has 587 states and 1997 transitions. Word has length 25 [2025-04-13 18:29:53,237 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:29:53,237 INFO L485 AbstractCegarLoop]: Abstraction has 587 states and 1997 transitions. [2025-04-13 18:29:53,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:29:53,237 INFO L278 IsEmpty]: Start isEmpty. Operand 587 states and 1997 transitions. [2025-04-13 18:29:53,238 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:29:53,238 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:29:53,238 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:29:53,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 18:29:53,238 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:29:53,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:29:53,238 INFO L85 PathProgramCache]: Analyzing trace with hash -659683445, now seen corresponding path program 10 times [2025-04-13 18:29:53,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:29:53,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402918319] [2025-04-13 18:29:53,238 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:29:53,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:29:53,242 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:29:53,247 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:29:53,247 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:29:53,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:29:53,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:29:53,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402918319] [2025-04-13 18:29:53,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402918319] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:29:53,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212243079] [2025-04-13 18:29:53,794 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:29:53,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:29:53,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:29:53,796 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:29:53,796 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:29:53,839 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:29:53,852 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:29:53,853 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:29:53,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:53,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:29:53,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:29:54,230 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:29:54,230 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 72 [2025-04-13 18:29:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:29:54,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:29:56,831 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:29:56,831 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 845 treesize of output 377 [2025-04-13 18:29:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:29:59,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212243079] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:29:59,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:29:59,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 32 [2025-04-13 18:29:59,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873066909] [2025-04-13 18:29:59,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:29:59,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:29:59,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:29:59,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:29:59,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:29:59,833 INFO L87 Difference]: Start difference. First operand 587 states and 1997 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:03,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:03,833 INFO L93 Difference]: Finished difference Result 794 states and 2626 transitions. [2025-04-13 18:30:03,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-04-13 18:30:03,834 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:30:03,834 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:03,836 INFO L225 Difference]: With dead ends: 794 [2025-04-13 18:30:03,836 INFO L226 Difference]: Without dead ends: 783 [2025-04-13 18:30:03,837 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1479 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=588, Invalid=4382, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 18:30:03,837 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 268 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2025 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:03,837 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 0 Invalid, 2084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2025 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 18:30:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-04-13 18:30:03,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 597. [2025-04-13 18:30:03,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 3.4161073825503356) internal successors, (2036), 596 states have internal predecessors, (2036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 2036 transitions. [2025-04-13 18:30:03,846 INFO L79 Accepts]: Start accepts. Automaton has 597 states and 2036 transitions. Word has length 25 [2025-04-13 18:30:03,846 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:03,846 INFO L485 AbstractCegarLoop]: Abstraction has 597 states and 2036 transitions. [2025-04-13 18:30:03,846 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:03,846 INFO L278 IsEmpty]: Start isEmpty. Operand 597 states and 2036 transitions. [2025-04-13 18:30:03,847 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:30:03,847 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:03,847 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:03,853 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:30:04,047 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:04,048 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:30:04,048 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:04,048 INFO L85 PathProgramCache]: Analyzing trace with hash 849762645, now seen corresponding path program 11 times [2025-04-13 18:30:04,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:04,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242822331] [2025-04-13 18:30:04,048 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:30:04,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:04,052 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:30:04,057 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:30:04,057 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:30:04,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:04,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:04,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:04,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242822331] [2025-04-13 18:30:04,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242822331] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:04,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391818601] [2025-04-13 18:30:04,660 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:30:04,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:04,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:04,661 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:30:04,662 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:30:04,704 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:30:04,718 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:30:04,718 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:30:04,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:04,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 18:30:04,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:04,744 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:30:04,763 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:30:05,193 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:05,194 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 72 [2025-04-13 18:30:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:05,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:08,780 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 118 treesize of output 108 [2025-04-13 18:30:08,788 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:08,788 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 703 treesize of output 643 [2025-04-13 18:30:08,912 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 119 treesize of output 109 [2025-04-13 18:30:08,917 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:08,918 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 372 treesize of output 350 [2025-04-13 18:30:08,992 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 117 treesize of output 107 [2025-04-13 18:30:08,999 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:08,999 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 364 treesize of output 342 [2025-04-13 18:30:09,086 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 119 treesize of output 109 [2025-04-13 18:30:09,094 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:09,094 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 362 treesize of output 342 [2025-04-13 18:30:09,154 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 119 treesize of output 109 [2025-04-13 18:30:09,160 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:09,160 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 246 treesize of output 1 [2025-04-13 18:30:09,164 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 119 treesize of output 109 [2025-04-13 18:30:09,169 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:09,169 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 422 treesize of output 394 [2025-04-13 18:30:09,241 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 143 treesize of output 131 [2025-04-13 18:30:09,246 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:09,246 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 305 treesize of output 1 [2025-04-13 18:30:09,249 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 121 treesize of output 111 [2025-04-13 18:30:09,256 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:09,256 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 430 treesize of output 1 [2025-04-13 18:30:09,261 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 123 treesize of output 113 [2025-04-13 18:30:09,267 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:09,267 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 248 treesize of output 230 [2025-04-13 18:30:09,337 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 118 treesize of output 108 [2025-04-13 18:30:09,344 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:09,344 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 405 treesize of output 371 [2025-04-13 18:30:09,514 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 93 treesize of output 85 [2025-04-13 18:30:09,520 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:09,520 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 193 treesize of output 181 [2025-04-13 18:30:09,581 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 92 treesize of output 84 [2025-04-13 18:30:09,587 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:09,587 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 302 treesize of output 1 [2025-04-13 18:30:09,592 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 97 treesize of output 89 [2025-04-13 18:30:09,599 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:09,599 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 195 treesize of output 1 [2025-04-13 18:30:09,603 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 143 treesize of output 131 [2025-04-13 18:30:09,609 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:09,610 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 523 treesize of output 1 [2025-04-13 18:30:09,613 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 112 treesize of output 102 [2025-04-13 18:30:09,621 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:09,621 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 899 treesize of output 1 [2025-04-13 18:30:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:09,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391818601] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:30:09,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:30:09,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 39 [2025-04-13 18:30:09,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169080316] [2025-04-13 18:30:09,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:30:09,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 18:30:09,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:09,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 18:30:09,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1385, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 18:30:09,644 INFO L87 Difference]: Start difference. First operand 597 states and 2036 transitions. Second operand has 41 states, 40 states have (on average 1.825) internal successors, (73), 40 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:30:14,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:14,881 INFO L93 Difference]: Finished difference Result 946 states and 3093 transitions. [2025-04-13 18:30:14,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-13 18:30:14,881 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.825) internal successors, (73), 40 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 25 [2025-04-13 18:30:14,881 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:14,884 INFO L225 Difference]: With dead ends: 946 [2025-04-13 18:30:14,884 INFO L226 Difference]: Without dead ends: 935 [2025-04-13 18:30:14,884 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=816, Invalid=5504, Unknown=0, NotChecked=0, Total=6320 [2025-04-13 18:30:14,885 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 346 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2798 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:14,885 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 0 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2798 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-04-13 18:30:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-04-13 18:30:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 601. [2025-04-13 18:30:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 600 states have (on average 3.408333333333333) internal successors, (2045), 600 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 2045 transitions. [2025-04-13 18:30:14,894 INFO L79 Accepts]: Start accepts. Automaton has 601 states and 2045 transitions. Word has length 25 [2025-04-13 18:30:14,895 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:14,895 INFO L485 AbstractCegarLoop]: Abstraction has 601 states and 2045 transitions. [2025-04-13 18:30:14,895 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.825) internal successors, (73), 40 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:30:14,895 INFO L278 IsEmpty]: Start isEmpty. Operand 601 states and 2045 transitions. [2025-04-13 18:30:14,896 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:30:14,896 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:14,896 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:14,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-13 18:30:15,097 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:15,097 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:30:15,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:15,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1083841379, now seen corresponding path program 12 times [2025-04-13 18:30:15,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:15,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032925179] [2025-04-13 18:30:15,097 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:30:15,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:15,101 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:30:15,109 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:30:15,109 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:30:15,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:15,752 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:30:15,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:15,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032925179] [2025-04-13 18:30:15,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032925179] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:15,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286550501] [2025-04-13 18:30:15,752 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:30:15,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:15,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:15,754 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:30:15,756 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:30:15,799 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:30:15,813 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:30:15,813 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:30:15,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:15,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:30:15,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:16,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:30:16,371 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:16,371 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 88 [2025-04-13 18:30:16,546 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:30:16,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:18,096 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:18,097 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 441 treesize of output 201 [2025-04-13 18:30:18,947 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:30:18,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286550501] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:30:18,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:30:18,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 18:30:18,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798489785] [2025-04-13 18:30:18,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:30:18,947 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:30:18,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:18,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:30:18,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:30:18,948 INFO L87 Difference]: Start difference. First operand 601 states and 2045 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:25,273 INFO L93 Difference]: Finished difference Result 921 states and 3180 transitions. [2025-04-13 18:30:25,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-04-13 18:30:25,274 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 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:30:25,274 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:25,276 INFO L225 Difference]: With dead ends: 921 [2025-04-13 18:30:25,276 INFO L226 Difference]: Without dead ends: 910 [2025-04-13 18:30:25,277 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2293 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=964, Invalid=6518, Unknown=0, NotChecked=0, Total=7482 [2025-04-13 18:30:25,277 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 243 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2148 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:25,277 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 0 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2148 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:30:25,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-04-13 18:30:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 611. [2025-04-13 18:30:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 610 states have (on average 3.413114754098361) internal successors, (2082), 610 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 2082 transitions. [2025-04-13 18:30:25,287 INFO L79 Accepts]: Start accepts. Automaton has 611 states and 2082 transitions. Word has length 25 [2025-04-13 18:30:25,287 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:25,287 INFO L485 AbstractCegarLoop]: Abstraction has 611 states and 2082 transitions. [2025-04-13 18:30:25,287 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:25,287 INFO L278 IsEmpty]: Start isEmpty. Operand 611 states and 2082 transitions. [2025-04-13 18:30:25,288 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:30:25,288 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:25,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:25,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-13 18:30:25,488 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:25,488 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:30:25,489 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:25,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1431110277, now seen corresponding path program 13 times [2025-04-13 18:30:25,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:25,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691256336] [2025-04-13 18:30:25,489 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:30:25,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:25,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:30:25,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:30:25,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:30:25,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:26,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:30:26,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:26,549 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691256336] [2025-04-13 18:30:26,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691256336] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:26,549 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764772719] [2025-04-13 18:30:26,549 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:30:26,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:26,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:26,551 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:30:26,551 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:30:26,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:30:26,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:30:26,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:30:26,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:26,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:30:26,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:26,647 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 19 treesize of output 1 [2025-04-13 18:30:27,165 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:27,165 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 160 treesize of output 82 [2025-04-13 18:30:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:27,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:29,967 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 230 treesize of output 200 [2025-04-13 18:30:29,971 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:29,971 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 343 treesize of output 275 [2025-04-13 18:30:30,171 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 366 treesize of output 326 [2025-04-13 18:30:30,176 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:30,177 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 439 treesize of output 369 [2025-04-13 18:30:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:30:30,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764772719] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:30:30,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:30:30,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 36 [2025-04-13 18:30:30,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106043376] [2025-04-13 18:30:30,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:30:30,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:30:30,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:30,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:30:30,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1219, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:30:30,452 INFO L87 Difference]: Start difference. First operand 611 states and 2082 transitions. Second operand has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 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:30:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:36,350 INFO L93 Difference]: Finished difference Result 928 states and 3020 transitions. [2025-04-13 18:30:36,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 18:30:36,351 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 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 25 [2025-04-13 18:30:36,351 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:36,353 INFO L225 Difference]: With dead ends: 928 [2025-04-13 18:30:36,353 INFO L226 Difference]: Without dead ends: 917 [2025-04-13 18:30:36,354 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1836 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=881, Invalid=6601, Unknown=0, NotChecked=0, Total=7482 [2025-04-13 18:30:36,354 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 285 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3175 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:36,355 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 0 Invalid, 3236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3175 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 18:30:36,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2025-04-13 18:30:36,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 605. [2025-04-13 18:30:36,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 604 states have (on average 3.415562913907285) internal successors, (2063), 604 states have internal predecessors, (2063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 2063 transitions. [2025-04-13 18:30:36,364 INFO L79 Accepts]: Start accepts. Automaton has 605 states and 2063 transitions. Word has length 25 [2025-04-13 18:30:36,364 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:36,364 INFO L485 AbstractCegarLoop]: Abstraction has 605 states and 2063 transitions. [2025-04-13 18:30:36,364 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 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:30:36,364 INFO L278 IsEmpty]: Start isEmpty. Operand 605 states and 2063 transitions. [2025-04-13 18:30:36,365 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:30:36,365 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:36,365 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:36,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 18:30:36,565 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:36,565 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:30:36,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:36,566 INFO L85 PathProgramCache]: Analyzing trace with hash -893384943, now seen corresponding path program 14 times [2025-04-13 18:30:36,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:36,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538842537] [2025-04-13 18:30:36,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:30:36,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:36,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:30:36,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:30:36,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:30:36,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:37,157 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:30:37,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:37,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538842537] [2025-04-13 18:30:37,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538842537] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:37,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527687500] [2025-04-13 18:30:37,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:30:37,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:37,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:37,159 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:30:37,167 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:30:37,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:30:37,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:30:37,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:30:37,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:37,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:30:37,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:37,621 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:37,621 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 98 [2025-04-13 18:30:38,054 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:30:38,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:39,466 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:39,466 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 433 treesize of output 193 [2025-04-13 18:30:40,337 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:30:40,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527687500] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:30:40,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:30:40,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 18:30:40,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100509081] [2025-04-13 18:30:40,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:30:40,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:30:40,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:40,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:30:40,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:30:40,338 INFO L87 Difference]: Start difference. First operand 605 states and 2063 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 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:30:47,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:47,388 INFO L93 Difference]: Finished difference Result 977 states and 3357 transitions. [2025-04-13 18:30:47,388 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-04-13 18:30:47,388 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 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 25 [2025-04-13 18:30:47,388 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:47,391 INFO L225 Difference]: With dead ends: 977 [2025-04-13 18:30:47,391 INFO L226 Difference]: Without dead ends: 966 [2025-04-13 18:30:47,391 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2693 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1155, Invalid=7217, Unknown=0, NotChecked=0, Total=8372 [2025-04-13 18:30:47,392 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 285 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2324 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:47,392 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 0 Invalid, 2423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2324 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 18:30:47,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2025-04-13 18:30:47,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 613. [2025-04-13 18:30:47,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 612 states have (on average 3.423202614379085) internal successors, (2095), 612 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:47,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 2095 transitions. [2025-04-13 18:30:47,401 INFO L79 Accepts]: Start accepts. Automaton has 613 states and 2095 transitions. Word has length 25 [2025-04-13 18:30:47,401 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:47,401 INFO L485 AbstractCegarLoop]: Abstraction has 613 states and 2095 transitions. [2025-04-13 18:30:47,401 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 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:30:47,401 INFO L278 IsEmpty]: Start isEmpty. Operand 613 states and 2095 transitions. [2025-04-13 18:30:47,402 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:30:47,402 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:47,402 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:47,414 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:30:47,603 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,SelfDestructingSolverStorable45 [2025-04-13 18:30:47,603 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:30:47,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:47,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1554484501, now seen corresponding path program 15 times [2025-04-13 18:30:47,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:47,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207093993] [2025-04-13 18:30:47,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:30:47,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:47,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:30:47,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:30:47,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:30:47,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:30:48,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:48,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207093993] [2025-04-13 18:30:48,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207093993] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:48,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849584827] [2025-04-13 18:30:48,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:30:48,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:48,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:48,213 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:30:48,214 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:30:48,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:30:48,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:30:48,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:30:48,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:48,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:30:48,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:48,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:30:48,867 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:48,867 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 90 [2025-04-13 18:30:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:30:49,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:50,184 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:50,185 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 345 treesize of output 181 [2025-04-13 18:30:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:30:50,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849584827] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:30:50,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:30:50,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 18:30:50,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121597093] [2025-04-13 18:30:50,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:30:50,667 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:30:50,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:50,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:30:50,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:30:50,668 INFO L87 Difference]: Start difference. First operand 613 states and 2095 transitions. Second operand has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 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:30:53,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:53,694 INFO L93 Difference]: Finished difference Result 995 states and 3183 transitions. [2025-04-13 18:30:53,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 18:30:53,694 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 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 25 [2025-04-13 18:30:53,694 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:53,697 INFO L225 Difference]: With dead ends: 995 [2025-04-13 18:30:53,697 INFO L226 Difference]: Without dead ends: 984 [2025-04-13 18:30:53,697 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=524, Invalid=3382, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 18:30:53,697 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 332 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2953 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:53,697 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 0 Invalid, 2992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2953 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 18:30:53,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2025-04-13 18:30:53,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 646. [2025-04-13 18:30:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 645 states have (on average 3.415503875968992) internal successors, (2203), 645 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:53,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 2203 transitions. [2025-04-13 18:30:53,708 INFO L79 Accepts]: Start accepts. Automaton has 646 states and 2203 transitions. Word has length 25 [2025-04-13 18:30:53,708 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:53,708 INFO L485 AbstractCegarLoop]: Abstraction has 646 states and 2203 transitions. [2025-04-13 18:30:53,708 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 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:30:53,708 INFO L278 IsEmpty]: Start isEmpty. Operand 646 states and 2203 transitions. [2025-04-13 18:30:53,709 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:30:53,709 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:53,709 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:53,715 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:30:53,909 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,SelfDestructingSolverStorable46 [2025-04-13 18:30:53,909 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:30:53,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:53,909 INFO L85 PathProgramCache]: Analyzing trace with hash -622815393, now seen corresponding path program 16 times [2025-04-13 18:30:53,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:53,910 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483161587] [2025-04-13 18:30:53,910 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:30:53,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:53,928 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:30:53,934 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:30:53,934 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:30:53,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:54,480 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:30:54,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:54,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483161587] [2025-04-13 18:30:54,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483161587] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:54,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173760743] [2025-04-13 18:30:54,481 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:30:54,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:54,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:54,483 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:30:54,483 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:30:54,527 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:30:54,541 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:30:54,541 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:30:54,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:54,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:30:54,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:54,942 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:54,942 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 82 [2025-04-13 18:30:55,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:30:55,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:58,151 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:58,152 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 961 treesize of output 449 [2025-04-13 18:31:01,608 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:31:01,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173760743] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:31:01,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:31:01,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 32 [2025-04-13 18:31:01,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903533830] [2025-04-13 18:31:01,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:31:01,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:31:01,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:31:01,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:31:01,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:31:01,609 INFO L87 Difference]: Start difference. First operand 646 states and 2203 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:31:06,505 INFO L93 Difference]: Finished difference Result 825 states and 2756 transitions. [2025-04-13 18:31:06,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 18:31:06,506 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:31:06,506 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:31:06,508 INFO L225 Difference]: With dead ends: 825 [2025-04-13 18:31:06,508 INFO L226 Difference]: Without dead ends: 814 [2025-04-13 18:31:06,508 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=520, Invalid=3902, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 18:31:06,509 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 222 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2532 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:31:06,509 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 0 Invalid, 2583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2532 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 18:31:06,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2025-04-13 18:31:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 646. [2025-04-13 18:31:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 645 states have (on average 3.415503875968992) internal successors, (2203), 645 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 2203 transitions. [2025-04-13 18:31:06,517 INFO L79 Accepts]: Start accepts. Automaton has 646 states and 2203 transitions. Word has length 25 [2025-04-13 18:31:06,517 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:31:06,517 INFO L485 AbstractCegarLoop]: Abstraction has 646 states and 2203 transitions. [2025-04-13 18:31:06,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:06,517 INFO L278 IsEmpty]: Start isEmpty. Operand 646 states and 2203 transitions. [2025-04-13 18:31:06,518 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:31:06,518 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:31:06,518 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:31:06,524 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:31:06,719 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,SelfDestructingSolverStorable47 [2025-04-13 18:31:06,719 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:31:06,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:31:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1201204331, now seen corresponding path program 17 times [2025-04-13 18:31:06,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:31:06,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934614993] [2025-04-13 18:31:06,719 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:31:06,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:31:06,723 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:31:06,728 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:31:06,728 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:31:06,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:31:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:31:07,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:31:07,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934614993] [2025-04-13 18:31:07,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934614993] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:31:07,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433204532] [2025-04-13 18:31:07,347 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:31:07,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:31:07,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:31:07,348 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:31:07,349 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:31:07,396 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:31:07,409 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:31:07,410 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:31:07,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:31:07,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 18:31:07,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:31:07,952 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:31:07,952 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 160 treesize of output 82 [2025-04-13 18:31:08,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:31:08,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:31:09,452 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:31:09,453 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 537 treesize of output 263 [2025-04-13 18:31:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:31:11,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433204532] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:31:11,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:31:11,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 18:31:11,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301684761] [2025-04-13 18:31:11,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:31:11,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:31:11,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:31:11,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:31:11,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:31:11,096 INFO L87 Difference]: Start difference. First operand 646 states and 2203 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:14,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:31:14,090 INFO L93 Difference]: Finished difference Result 957 states and 3175 transitions. [2025-04-13 18:31:14,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 18:31:14,091 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 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:31:14,091 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:31:14,094 INFO L225 Difference]: With dead ends: 957 [2025-04-13 18:31:14,094 INFO L226 Difference]: Without dead ends: 946 [2025-04-13 18:31:14,094 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=549, Invalid=3873, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 18:31:14,094 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 282 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2652 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:31:14,094 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 0 Invalid, 2682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2652 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:31:14,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-04-13 18:31:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 662. [2025-04-13 18:31:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 3.4236006051437218) internal successors, (2263), 661 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2263 transitions. [2025-04-13 18:31:14,104 INFO L79 Accepts]: Start accepts. Automaton has 662 states and 2263 transitions. Word has length 25 [2025-04-13 18:31:14,104 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:31:14,104 INFO L485 AbstractCegarLoop]: Abstraction has 662 states and 2263 transitions. [2025-04-13 18:31:14,104 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:14,105 INFO L278 IsEmpty]: Start isEmpty. Operand 662 states and 2263 transitions. [2025-04-13 18:31:14,105 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:31:14,105 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:31:14,106 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:31:14,112 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:31:14,306 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:31:14,306 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:31:14,307 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:31:14,307 INFO L85 PathProgramCache]: Analyzing trace with hash -704214449, now seen corresponding path program 18 times [2025-04-13 18:31:14,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:31:14,307 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251931516] [2025-04-13 18:31:14,307 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:31:14,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:31:14,311 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:31:14,317 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:31:14,317 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:31:14,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:31:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:31:14,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:31:14,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251931516] [2025-04-13 18:31:14,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251931516] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:31:14,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774416929] [2025-04-13 18:31:14,964 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:31:14,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:31:14,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:31:14,966 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:31:14,966 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:31:15,017 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:31:15,031 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:31:15,031 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:31:15,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:31:15,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:31:15,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:31:15,485 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:31:15,485 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 96 [2025-04-13 18:31:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:31:15,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:31:17,084 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:31:17,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 413 treesize of output 189 [2025-04-13 18:31:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:31:18,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774416929] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:31:18,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:31:18,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 36 [2025-04-13 18:31:18,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593052582] [2025-04-13 18:31:18,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:31:18,010 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:31:18,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:31:18,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:31:18,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1226, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:31:18,011 INFO L87 Difference]: Start difference. First operand 662 states and 2263 transitions. Second operand has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:26,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:31:26,322 INFO L93 Difference]: Finished difference Result 1207 states and 4026 transitions. [2025-04-13 18:31:26,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-04-13 18:31:26,322 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 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:31:26,322 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:31:26,324 INFO L225 Difference]: With dead ends: 1207 [2025-04-13 18:31:26,324 INFO L226 Difference]: Without dead ends: 1196 [2025-04-13 18:31:26,325 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3373 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1502, Invalid=10054, Unknown=0, NotChecked=0, Total=11556 [2025-04-13 18:31:26,325 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 450 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3324 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 3324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:31:26,325 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 0 Invalid, 3474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 3324 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 18:31:26,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2025-04-13 18:31:26,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 688. [2025-04-13 18:31:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 3.395924308588064) internal successors, (2333), 687 states have internal predecessors, (2333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:26,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 2333 transitions. [2025-04-13 18:31:26,337 INFO L79 Accepts]: Start accepts. Automaton has 688 states and 2333 transitions. Word has length 25 [2025-04-13 18:31:26,337 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:31:26,338 INFO L485 AbstractCegarLoop]: Abstraction has 688 states and 2333 transitions. [2025-04-13 18:31:26,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:26,338 INFO L278 IsEmpty]: Start isEmpty. Operand 688 states and 2333 transitions. [2025-04-13 18:31:26,338 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:31:26,339 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:31:26,339 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:31:26,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-04-13 18:31:26,539 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,SelfDestructingSolverStorable49 [2025-04-13 18:31:26,539 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:31:26,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:31:26,539 INFO L85 PathProgramCache]: Analyzing trace with hash -718952949, now seen corresponding path program 19 times [2025-04-13 18:31:26,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:31:26,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529965047] [2025-04-13 18:31:26,540 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:31:26,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:31:26,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:31:26,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:31:26,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:31:26,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:31:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:31:27,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:31:27,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529965047] [2025-04-13 18:31:27,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529965047] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:31:27,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475571890] [2025-04-13 18:31:27,285 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:31:27,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:31:27,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:31:27,287 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:31:27,288 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:31:27,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:31:27,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:31:27,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:31:27,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:31:27,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:31:27,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:31:27,389 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 19 treesize of output 1 [2025-04-13 18:31:27,825 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:31:27,825 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 132 treesize of output 72 [2025-04-13 18:31:27,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:31:27,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:31:30,881 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 246 treesize of output 214 [2025-04-13 18:31:30,887 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:31:30,887 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 360 treesize of output 288 [2025-04-13 18:31:31,068 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 455 treesize of output 405 [2025-04-13 18:31:31,074 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:31:31,074 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 550 treesize of output 462 [2025-04-13 18:31:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:31:31,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475571890] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:31:31,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:31:31,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 37 [2025-04-13 18:31:31,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692170765] [2025-04-13 18:31:31,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:31:31,474 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:31:31,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:31:31,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:31:31,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1281, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:31:31,474 INFO L87 Difference]: Start difference. First operand 688 states and 2333 transitions. Second operand has 39 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:31:42,530 INFO L93 Difference]: Finished difference Result 1335 states and 4424 transitions. [2025-04-13 18:31:42,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-13 18:31:42,530 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:31:42,530 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:31:42,532 INFO L225 Difference]: With dead ends: 1335 [2025-04-13 18:31:42,532 INFO L226 Difference]: Without dead ends: 1234 [2025-04-13 18:31:42,533 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2124 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1009, Invalid=7001, Unknown=0, NotChecked=0, Total=8010 [2025-04-13 18:31:42,533 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 375 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2569 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:31:42,533 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 0 Invalid, 2645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2569 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 18:31:42,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2025-04-13 18:31:42,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 694. [2025-04-13 18:31:42,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 3.4054834054834053) internal successors, (2360), 693 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:42,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 2360 transitions. [2025-04-13 18:31:42,545 INFO L79 Accepts]: Start accepts. Automaton has 694 states and 2360 transitions. Word has length 25 [2025-04-13 18:31:42,545 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:31:42,545 INFO L485 AbstractCegarLoop]: Abstraction has 694 states and 2360 transitions. [2025-04-13 18:31:42,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:42,545 INFO L278 IsEmpty]: Start isEmpty. Operand 694 states and 2360 transitions. [2025-04-13 18:31:42,546 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:31:42,546 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:31:42,546 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:31:42,553 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:31:42,747 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,SelfDestructingSolverStorable50 [2025-04-13 18:31:42,747 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:31:42,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:31:42,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1711174847, now seen corresponding path program 20 times [2025-04-13 18:31:42,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:31:42,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563974599] [2025-04-13 18:31:42,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:31:42,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:31:42,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:31:42,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:31:42,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:31:42,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:31:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:31:43,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:31:43,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563974599] [2025-04-13 18:31:43,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563974599] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:31:43,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194754208] [2025-04-13 18:31:43,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:31:43,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:31:43,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:31:43,463 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:31:43,464 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:31:43,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:31:43,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:31:43,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:31:43,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:31:43,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 18:31:43,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:31:43,987 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:31:43,987 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 88 [2025-04-13 18:31:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:31:44,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:31:46,258 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:31:46,258 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 583 treesize of output 279 [2025-04-13 18:31:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:31:47,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194754208] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:31:47,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:31:47,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 18:31:47,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419354760] [2025-04-13 18:31:47,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:31:47,617 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:31:47,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:31:47,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:31:47,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:31:47,617 INFO L87 Difference]: Start difference. First operand 694 states and 2360 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:31:55,602 INFO L93 Difference]: Finished difference Result 1141 states and 3774 transitions. [2025-04-13 18:31:55,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-04-13 18:31:55,602 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 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:31:55,602 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:31:55,604 INFO L225 Difference]: With dead ends: 1141 [2025-04-13 18:31:55,604 INFO L226 Difference]: Without dead ends: 1130 [2025-04-13 18:31:55,605 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2684 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1252, Invalid=7304, Unknown=0, NotChecked=0, Total=8556 [2025-04-13 18:31:55,605 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 308 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2246 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:31:55,605 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 0 Invalid, 2337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2246 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 18:31:55,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-04-13 18:31:55,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 702. [2025-04-13 18:31:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 701 states have (on average 3.403708987161198) internal successors, (2386), 701 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 2386 transitions. [2025-04-13 18:31:55,615 INFO L79 Accepts]: Start accepts. Automaton has 702 states and 2386 transitions. Word has length 25 [2025-04-13 18:31:55,616 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:31:55,616 INFO L485 AbstractCegarLoop]: Abstraction has 702 states and 2386 transitions. [2025-04-13 18:31:55,616 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:55,616 INFO L278 IsEmpty]: Start isEmpty. Operand 702 states and 2386 transitions. [2025-04-13 18:31:55,617 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:31:55,617 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:31:55,617 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:31:55,623 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:31:55,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:31:55,817 INFO L403 AbstractCegarLoop]: === Iteration 53 === 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:31:55,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:31:55,818 INFO L85 PathProgramCache]: Analyzing trace with hash -818470157, now seen corresponding path program 21 times [2025-04-13 18:31:55,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:31:55,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408749863] [2025-04-13 18:31:55,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:31:55,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:31:55,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:31:55,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:31:55,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:31:55,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:31:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:31:56,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:31:56,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408749863] [2025-04-13 18:31:56,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408749863] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:31:56,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:31:56,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:31:56,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731962051] [2025-04-13 18:31:56,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:31:56,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:31:56,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:31:56,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:31:56,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:31:56,679 INFO L87 Difference]: Start difference. First operand 702 states and 2386 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:31:57,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:31:57,231 INFO L93 Difference]: Finished difference Result 802 states and 2716 transitions. [2025-04-13 18:31:57,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:31:57,231 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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 25 [2025-04-13 18:31:57,231 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:31:57,233 INFO L225 Difference]: With dead ends: 802 [2025-04-13 18:31:57,233 INFO L226 Difference]: Without dead ends: 796 [2025-04-13 18:31:57,233 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:31:57,233 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:31:57,233 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:31:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-04-13 18:31:57,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 708. [2025-04-13 18:31:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 707 states have (on average 3.396039603960396) internal successors, (2401), 707 states have internal predecessors, (2401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 2401 transitions. [2025-04-13 18:31:57,242 INFO L79 Accepts]: Start accepts. Automaton has 708 states and 2401 transitions. Word has length 25 [2025-04-13 18:31:57,242 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:31:57,242 INFO L485 AbstractCegarLoop]: Abstraction has 708 states and 2401 transitions. [2025-04-13 18:31:57,242 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:31:57,242 INFO L278 IsEmpty]: Start isEmpty. Operand 708 states and 2401 transitions. [2025-04-13 18:31:57,243 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:31:57,243 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:31:57,243 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:31:57,243 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-04-13 18:31:57,243 INFO L403 AbstractCegarLoop]: === Iteration 54 === 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:31:57,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:31:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash 596663131, now seen corresponding path program 22 times [2025-04-13 18:31:57,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:31:57,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017921107] [2025-04-13 18:31:57,244 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:31:57,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:31:57,248 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:31:57,257 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:31:57,257 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:31:57,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:31:57,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:31:57,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:31:57,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017921107] [2025-04-13 18:31:57,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017921107] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:31:57,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532934669] [2025-04-13 18:31:57,824 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:31:57,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:31:57,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:31:57,825 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:31:57,826 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:31:57,899 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:31:57,912 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:31:57,912 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:31:57,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:31:57,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:31:57,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:31:58,241 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:31:58,241 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 132 treesize of output 72 [2025-04-13 18:31:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:31:58,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:32:00,509 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:00,509 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 789 treesize of output 353 [2025-04-13 18:32:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:32:03,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532934669] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:32:03,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:32:03,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 31 [2025-04-13 18:32:03,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405360450] [2025-04-13 18:32:03,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:32:03,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 18:32:03,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:03,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 18:32:03,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:32:03,984 INFO L87 Difference]: Start difference. First operand 708 states and 2401 transitions. Second operand has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:06,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:06,786 INFO L93 Difference]: Finished difference Result 913 states and 3019 transitions. [2025-04-13 18:32:06,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 18:32:06,787 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 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:32:06,787 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:06,789 INFO L225 Difference]: With dead ends: 913 [2025-04-13 18:32:06,789 INFO L226 Difference]: Without dead ends: 902 [2025-04-13 18:32:06,789 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=516, Invalid=3516, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 18:32:06,789 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 267 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2252 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:06,789 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 0 Invalid, 2291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2252 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 18:32:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2025-04-13 18:32:06,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 714. [2025-04-13 18:32:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 713 states have (on average 3.3716690042075736) internal successors, (2404), 713 states have internal predecessors, (2404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:06,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 2404 transitions. [2025-04-13 18:32:06,798 INFO L79 Accepts]: Start accepts. Automaton has 714 states and 2404 transitions. Word has length 25 [2025-04-13 18:32:06,798 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:06,798 INFO L485 AbstractCegarLoop]: Abstraction has 714 states and 2404 transitions. [2025-04-13 18:32:06,799 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:06,799 INFO L278 IsEmpty]: Start isEmpty. Operand 714 states and 2404 transitions. [2025-04-13 18:32:06,799 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:06,799 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:06,800 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:32:06,805 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:32:07,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:07,000 INFO L403 AbstractCegarLoop]: === Iteration 55 === 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:32:07,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:07,000 INFO L85 PathProgramCache]: Analyzing trace with hash -547900607, now seen corresponding path program 23 times [2025-04-13 18:32:07,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:07,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291524837] [2025-04-13 18:32:07,000 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:32:07,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:07,004 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:07,008 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:07,009 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:32:07,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:07,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:32:07,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:07,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291524837] [2025-04-13 18:32:07,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291524837] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:32:07,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188279479] [2025-04-13 18:32:07,673 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:32:07,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:07,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:32:07,674 INFO L229 MonitoredProcess]: Starting monitored process 34 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:32:07,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 18:32:07,724 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:07,737 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:07,737 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:32:07,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:07,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 18:32:07,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:32:07,762 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:32:07,783 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:32:08,243 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:08,243 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 72 [2025-04-13 18:32:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:32:08,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:32:11,816 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 118 treesize of output 108 [2025-04-13 18:32:11,836 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:11,837 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 405 treesize of output 371 [2025-04-13 18:32:11,928 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 93 treesize of output 85 [2025-04-13 18:32:11,933 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:11,933 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 305 treesize of output 285 [2025-04-13 18:32:11,960 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 143 treesize of output 131 [2025-04-13 18:32:11,965 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:11,965 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 291 treesize of output 1 [2025-04-13 18:32:11,969 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 119 treesize of output 109 [2025-04-13 18:32:11,974 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:11,974 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 562 treesize of output 1 [2025-04-13 18:32:11,979 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 117 treesize of output 107 [2025-04-13 18:32:11,987 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:11,987 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 364 treesize of output 1 [2025-04-13 18:32:11,991 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 97 treesize of output 89 [2025-04-13 18:32:11,995 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:11,995 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 253 treesize of output 1 [2025-04-13 18:32:11,997 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 119 treesize of output 109 [2025-04-13 18:32:12,002 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:12,002 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 538 treesize of output 1 [2025-04-13 18:32:12,004 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 112 treesize of output 102 [2025-04-13 18:32:12,009 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:12,009 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 491 treesize of output 1 [2025-04-13 18:32:12,011 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 92 treesize of output 84 [2025-04-13 18:32:12,016 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:12,017 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 796 treesize of output 1 [2025-04-13 18:32:12,019 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 143 treesize of output 131 [2025-04-13 18:32:12,023 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:12,023 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 305 treesize of output 1 [2025-04-13 18:32:12,025 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 123 treesize of output 113 [2025-04-13 18:32:12,030 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:12,030 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 546 treesize of output 1 [2025-04-13 18:32:12,032 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 121 treesize of output 111 [2025-04-13 18:32:12,037 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:12,037 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 254 treesize of output 1 [2025-04-13 18:32:12,040 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 119 treesize of output 109 [2025-04-13 18:32:12,045 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:12,045 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 422 treesize of output 1 [2025-04-13 18:32:12,047 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 119 treesize of output 109 [2025-04-13 18:32:12,051 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:12,051 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 246 treesize of output 1 [2025-04-13 18:32:12,053 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 118 treesize of output 108 [2025-04-13 18:32:12,057 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:12,058 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 381 treesize of output 1 [2025-04-13 18:32:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:32:12,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188279479] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:32:12,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:32:12,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 38 [2025-04-13 18:32:12,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797790611] [2025-04-13 18:32:12,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:32:12,069 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 18:32:12,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:12,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 18:32:12,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1340, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 18:32:12,070 INFO L87 Difference]: Start difference. First operand 714 states and 2404 transitions. Second operand has 40 states, 39 states have (on average 1.794871794871795) internal successors, (70), 39 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:32:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:21,498 INFO L93 Difference]: Finished difference Result 1279 states and 4278 transitions. [2025-04-13 18:32:21,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-13 18:32:21,498 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.794871794871795) internal successors, (70), 39 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 25 [2025-04-13 18:32:21,498 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:21,501 INFO L225 Difference]: With dead ends: 1279 [2025-04-13 18:32:21,501 INFO L226 Difference]: Without dead ends: 1268 [2025-04-13 18:32:21,501 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2028 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=963, Invalid=6693, Unknown=0, NotChecked=0, Total=7656 [2025-04-13 18:32:21,501 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 407 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:21,501 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 0 Invalid, 2632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 18:32:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2025-04-13 18:32:21,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 712. [2025-04-13 18:32:21,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 711 states have (on average 3.3741209563994374) internal successors, (2399), 711 states have internal predecessors, (2399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 2399 transitions. [2025-04-13 18:32:21,515 INFO L79 Accepts]: Start accepts. Automaton has 712 states and 2399 transitions. Word has length 25 [2025-04-13 18:32:21,515 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:21,515 INFO L485 AbstractCegarLoop]: Abstraction has 712 states and 2399 transitions. [2025-04-13 18:32:21,515 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.794871794871795) internal successors, (70), 39 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:32:21,515 INFO L278 IsEmpty]: Start isEmpty. Operand 712 states and 2399 transitions. [2025-04-13 18:32:21,516 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:21,516 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:21,516 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:32:21,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 18:32:21,716 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-04-13 18:32:21,716 INFO L403 AbstractCegarLoop]: === Iteration 56 === 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:32:21,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:21,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1684209791, now seen corresponding path program 24 times [2025-04-13 18:32:21,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:21,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078225142] [2025-04-13 18:32:21,717 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:32:21,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:21,720 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:21,727 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:21,727 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:32:21,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:32:22,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:22,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078225142] [2025-04-13 18:32:22,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078225142] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:32:22,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901024204] [2025-04-13 18:32:22,673 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:32:22,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:22,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:32:22,674 INFO L229 MonitoredProcess]: Starting monitored process 35 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:32:22,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 18:32:22,728 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:22,743 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:22,743 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:32:22,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:22,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:32:22,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:32:23,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:32:23,321 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:23,321 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 90 [2025-04-13 18:32:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:32:23,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:32:24,743 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:24,743 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 413 treesize of output 189 [2025-04-13 18:32:25,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:32:25,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901024204] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:32:25,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:32:25,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 36 [2025-04-13 18:32:25,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634909704] [2025-04-13 18:32:25,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:32:25,606 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:32:25,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:25,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:32:25,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1204, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:32:25,606 INFO L87 Difference]: Start difference. First operand 712 states and 2399 transitions. Second operand has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:31,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:31,241 INFO L93 Difference]: Finished difference Result 1155 states and 3874 transitions. [2025-04-13 18:32:31,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-13 18:32:31,241 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 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:32:31,241 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:31,243 INFO L225 Difference]: With dead ends: 1155 [2025-04-13 18:32:31,243 INFO L226 Difference]: Without dead ends: 1139 [2025-04-13 18:32:31,244 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2444 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1218, Invalid=7338, Unknown=0, NotChecked=0, Total=8556 [2025-04-13 18:32:31,244 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 340 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:31,244 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 0 Invalid, 2336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2232 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 18:32:31,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2025-04-13 18:32:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 722. [2025-04-13 18:32:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 721 states have (on average 3.36754507628294) internal successors, (2428), 721 states have internal predecessors, (2428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 2428 transitions. [2025-04-13 18:32:31,254 INFO L79 Accepts]: Start accepts. Automaton has 722 states and 2428 transitions. Word has length 25 [2025-04-13 18:32:31,254 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:31,254 INFO L485 AbstractCegarLoop]: Abstraction has 722 states and 2428 transitions. [2025-04-13 18:32:31,254 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:31,255 INFO L278 IsEmpty]: Start isEmpty. Operand 722 states and 2428 transitions. [2025-04-13 18:32:31,255 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:31,255 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:31,255 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:32:31,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 18:32:31,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:31,456 INFO L403 AbstractCegarLoop]: === Iteration 57 === 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:32:31,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:31,456 INFO L85 PathProgramCache]: Analyzing trace with hash -621422335, now seen corresponding path program 25 times [2025-04-13 18:32:31,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:31,456 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30817826] [2025-04-13 18:32:31,456 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:32:31,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:31,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:32:31,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:31,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:31,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:32:32,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:32,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30817826] [2025-04-13 18:32:32,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30817826] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:32:32,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438524765] [2025-04-13 18:32:32,134 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:32:32,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:32,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:32:32,135 INFO L229 MonitoredProcess]: Starting monitored process 36 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:32:32,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 18:32:32,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:32:32,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:32,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:32,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:32,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 18:32:32,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:32:32,240 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:32:32,644 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:32,644 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 71 [2025-04-13 18:32:32,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:32:32,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:32:35,877 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 246 treesize of output 214 [2025-04-13 18:32:35,881 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:35,881 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 360 treesize of output 288 [2025-04-13 18:32:36,049 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 546 treesize of output 484 [2025-04-13 18:32:36,056 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:36,056 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 687 treesize of output 569 [2025-04-13 18:32:36,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:32:36,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438524765] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:32:36,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:32:36,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 34 [2025-04-13 18:32:36,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609574705] [2025-04-13 18:32:36,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:32:36,683 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 18:32:36,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:36,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 18:32:36,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1075, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:32:36,684 INFO L87 Difference]: Start difference. First operand 722 states and 2428 transitions. Second operand has 36 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:43,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:43,835 INFO L93 Difference]: Finished difference Result 1123 states and 3699 transitions. [2025-04-13 18:32:43,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-13 18:32:43,835 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:32:43,835 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:43,838 INFO L225 Difference]: With dead ends: 1123 [2025-04-13 18:32:43,838 INFO L226 Difference]: Without dead ends: 1112 [2025-04-13 18:32:43,838 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1899 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=929, Invalid=6381, Unknown=0, NotChecked=0, Total=7310 [2025-04-13 18:32:43,838 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 363 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2804 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:43,839 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 0 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2804 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 18:32:43,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-04-13 18:32:43,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 724. [2025-04-13 18:32:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 3.3706777316735823) internal successors, (2437), 723 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 2437 transitions. [2025-04-13 18:32:43,848 INFO L79 Accepts]: Start accepts. Automaton has 724 states and 2437 transitions. Word has length 25 [2025-04-13 18:32:43,848 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:43,848 INFO L485 AbstractCegarLoop]: Abstraction has 724 states and 2437 transitions. [2025-04-13 18:32:43,848 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:43,848 INFO L278 IsEmpty]: Start isEmpty. Operand 724 states and 2437 transitions. [2025-04-13 18:32:43,849 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:43,849 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:43,849 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:32:43,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-13 18:32:44,050 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2025-04-13 18:32:44,050 INFO L403 AbstractCegarLoop]: === Iteration 58 === 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:32:44,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:44,050 INFO L85 PathProgramCache]: Analyzing trace with hash 633531183, now seen corresponding path program 26 times [2025-04-13 18:32:44,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:44,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493569732] [2025-04-13 18:32:44,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:32:44,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:44,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:44,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:44,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:32:44,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:32:44,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:44,756 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493569732] [2025-04-13 18:32:44,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493569732] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:32:44,756 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092634422] [2025-04-13 18:32:44,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:32:44,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:44,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:32:44,758 INFO L229 MonitoredProcess]: Starting monitored process 37 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:32:44,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-13 18:32:44,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:44,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:44,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:32:44,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:44,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:32:44,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:32:45,222 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:45,222 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 96 [2025-04-13 18:32:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:32:45,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:32:46,849 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:46,849 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 433 treesize of output 193 [2025-04-13 18:32:47,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:32:47,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092634422] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:32:47,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:32:47,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 18:32:47,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927029497] [2025-04-13 18:32:47,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:32:47,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:32:47,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:47,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:32:47,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=937, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:32:47,747 INFO L87 Difference]: Start difference. First operand 724 states and 2437 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 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:32:53,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:53,568 INFO L93 Difference]: Finished difference Result 1246 states and 4188 transitions. [2025-04-13 18:32:53,568 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-13 18:32:53,568 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 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 25 [2025-04-13 18:32:53,568 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:53,571 INFO L225 Difference]: With dead ends: 1246 [2025-04-13 18:32:53,571 INFO L226 Difference]: Without dead ends: 1235 [2025-04-13 18:32:53,571 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2548 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1243, Invalid=6767, Unknown=0, NotChecked=0, Total=8010 [2025-04-13 18:32:53,572 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 282 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:53,572 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 0 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 2052 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:32:53,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2025-04-13 18:32:53,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 724. [2025-04-13 18:32:53,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 3.376210235131397) internal successors, (2441), 723 states have internal predecessors, (2441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 2441 transitions. [2025-04-13 18:32:53,582 INFO L79 Accepts]: Start accepts. Automaton has 724 states and 2441 transitions. Word has length 25 [2025-04-13 18:32:53,582 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:53,582 INFO L485 AbstractCegarLoop]: Abstraction has 724 states and 2441 transitions. [2025-04-13 18:32:53,582 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 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:32:53,582 INFO L278 IsEmpty]: Start isEmpty. Operand 724 states and 2441 transitions. [2025-04-13 18:32:53,583 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:53,583 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:53,583 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:32:53,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-13 18:32:53,783 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:53,784 INFO L403 AbstractCegarLoop]: === Iteration 59 === 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:32:53,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:53,784 INFO L85 PathProgramCache]: Analyzing trace with hash -855123833, now seen corresponding path program 27 times [2025-04-13 18:32:53,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:53,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363040790] [2025-04-13 18:32:53,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:32:53,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:53,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:53,792 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:32:53,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:32:53,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:54,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:32:54,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:54,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363040790] [2025-04-13 18:32:54,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363040790] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:32:54,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:32:54,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:32:54,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000436243] [2025-04-13 18:32:54,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:32:54,265 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:32:54,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:54,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:32:54,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:32:54,266 INFO L87 Difference]: Start difference. First operand 724 states and 2441 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:32:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:54,878 INFO L93 Difference]: Finished difference Result 848 states and 2866 transitions. [2025-04-13 18:32:54,878 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:32:54,878 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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 25 [2025-04-13 18:32:54,878 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:54,880 INFO L225 Difference]: With dead ends: 848 [2025-04-13 18:32:54,880 INFO L226 Difference]: Without dead ends: 842 [2025-04-13 18:32:54,880 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:32:54,880 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:54,880 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:32:54,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-04-13 18:32:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 722. [2025-04-13 18:32:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 721 states have (on average 3.378640776699029) internal successors, (2436), 721 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 2436 transitions. [2025-04-13 18:32:54,889 INFO L79 Accepts]: Start accepts. Automaton has 722 states and 2436 transitions. Word has length 25 [2025-04-13 18:32:54,889 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:54,889 INFO L485 AbstractCegarLoop]: Abstraction has 722 states and 2436 transitions. [2025-04-13 18:32:54,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:32:54,889 INFO L278 IsEmpty]: Start isEmpty. Operand 722 states and 2436 transitions. [2025-04-13 18:32:54,890 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:32:54,890 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:54,890 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:32:54,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-04-13 18:32:54,890 INFO L403 AbstractCegarLoop]: === Iteration 60 === 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:32:54,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:54,890 INFO L85 PathProgramCache]: Analyzing trace with hash 904100733, now seen corresponding path program 28 times [2025-04-13 18:32:54,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:54,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570981986] [2025-04-13 18:32:54,890 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:32:54,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:54,894 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:54,900 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:54,900 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:32:54,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:32:55,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:55,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570981986] [2025-04-13 18:32:55,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570981986] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:32:55,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159204557] [2025-04-13 18:32:55,407 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:32:55,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:55,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:32:55,409 INFO L229 MonitoredProcess]: Starting monitored process 38 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:32:55,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-13 18:32:55,458 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:32:55,471 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:32:55,471 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:32:55,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:55,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:32:55,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:32:55,874 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:55,874 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 82 [2025-04-13 18:32:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:32:56,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:32:58,867 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:58,867 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 961 treesize of output 449 [2025-04-13 18:33:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:33:02,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159204557] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:33:02,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:33:02,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 32 [2025-04-13 18:33:02,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619941602] [2025-04-13 18:33:02,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:33:02,580 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:33:02,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:33:02,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:33:02,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=955, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:33:02,580 INFO L87 Difference]: Start difference. First operand 722 states and 2436 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:33:05,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:33:05,408 INFO L93 Difference]: Finished difference Result 897 states and 2965 transitions. [2025-04-13 18:33:05,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 18:33:05,408 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:33:05,408 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:33:05,410 INFO L225 Difference]: With dead ends: 897 [2025-04-13 18:33:05,410 INFO L226 Difference]: Without dead ends: 886 [2025-04-13 18:33:05,410 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=454, Invalid=2968, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 18:33:05,411 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 204 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:33:05,411 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 0 Invalid, 2232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:33:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-04-13 18:33:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 716. [2025-04-13 18:33:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 3.3776223776223775) internal successors, (2415), 715 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:33:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 2415 transitions. [2025-04-13 18:33:05,420 INFO L79 Accepts]: Start accepts. Automaton has 716 states and 2415 transitions. Word has length 25 [2025-04-13 18:33:05,420 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:33:05,420 INFO L485 AbstractCegarLoop]: Abstraction has 716 states and 2415 transitions. [2025-04-13 18:33:05,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:33:05,420 INFO L278 IsEmpty]: Start isEmpty. Operand 716 states and 2415 transitions. [2025-04-13 18:33:05,421 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:33:05,421 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:33:05,421 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:33:05,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-13 18:33:05,621 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-04-13 18:33:05,621 INFO L403 AbstractCegarLoop]: === Iteration 61 === 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:33:05,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:33:05,622 INFO L85 PathProgramCache]: Analyzing trace with hash -584554283, now seen corresponding path program 29 times [2025-04-13 18:33:05,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:33:05,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701015754] [2025-04-13 18:33:05,622 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:33:05,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:33:05,626 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:33:05,631 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:33:05,631 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:33:05,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:33:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:33:06,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:33:06,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701015754] [2025-04-13 18:33:06,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701015754] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:33:06,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477648568] [2025-04-13 18:33:06,298 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:33:06,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:33:06,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:33:06,300 INFO L229 MonitoredProcess]: Starting monitored process 39 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:33:06,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-13 18:33:06,352 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:33:06,366 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:33:06,366 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:33:06,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:33:06,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:33:06,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:33:06,845 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:33:06,845 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 82 [2025-04-13 18:33:06,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:33:06,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:33:08,493 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:33:08,493 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 537 treesize of output 263 [2025-04-13 18:33:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:33:09,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477648568] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:33:09,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:33:09,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15, 12] total 35 [2025-04-13 18:33:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323498215] [2025-04-13 18:33:09,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:33:09,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:33:09,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:33:09,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:33:09,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1159, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:33:09,922 INFO L87 Difference]: Start difference. First operand 716 states and 2415 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 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:33:11,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:33:11,290 INFO L93 Difference]: Finished difference Result 838 states and 2789 transitions. [2025-04-13 18:33:11,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:33:11,290 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 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 25 [2025-04-13 18:33:11,290 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:33:11,292 INFO L225 Difference]: With dead ends: 838 [2025-04-13 18:33:11,292 INFO L226 Difference]: Without dead ends: 832 [2025-04-13 18:33:11,292 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=231, Invalid=1749, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 18:33:11,292 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:33:11,293 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:33:11,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-04-13 18:33:11,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 716. [2025-04-13 18:33:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 3.3776223776223775) internal successors, (2415), 715 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:33:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 2415 transitions. [2025-04-13 18:33:11,301 INFO L79 Accepts]: Start accepts. Automaton has 716 states and 2415 transitions. Word has length 25 [2025-04-13 18:33:11,301 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:33:11,301 INFO L485 AbstractCegarLoop]: Abstraction has 716 states and 2415 transitions. [2025-04-13 18:33:11,301 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 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:33:11,302 INFO L278 IsEmpty]: Start isEmpty. Operand 716 states and 2415 transitions. [2025-04-13 18:33:11,302 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:33:11,302 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:33:11,302 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:33:11,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-04-13 18:33:11,503 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2025-04-13 18:33:11,503 INFO L403 AbstractCegarLoop]: === Iteration 62 === 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:33:11,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:33:11,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1301384987, now seen corresponding path program 30 times [2025-04-13 18:33:11,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:33:11,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689011238] [2025-04-13 18:33:11,503 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:33:11,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:33:11,507 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:33:11,513 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:33:11,513 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:33:11,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:33:12,072 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:33:12,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:33:12,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689011238] [2025-04-13 18:33:12,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689011238] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:33:12,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099721351] [2025-04-13 18:33:12,072 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:33:12,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:33:12,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:33:12,074 INFO L229 MonitoredProcess]: Starting monitored process 40 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:33:12,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-13 18:33:12,125 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:33:12,138 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:33:12,139 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:33:12,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:33:12,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:33:12,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:33:12,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:33:12,692 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:33:12,692 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 88 [2025-04-13 18:33:12,872 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:33:12,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:33:14,002 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:33:14,002 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 413 treesize of output 189 [2025-04-13 18:33:14,963 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:33:14,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099721351] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:33:14,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:33:14,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 18:33:14,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265443461] [2025-04-13 18:33:14,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:33:14,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:33:14,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:33:14,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:33:14,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:33:14,964 INFO L87 Difference]: Start difference. First operand 716 states and 2415 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:33:17,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:33:17,642 INFO L93 Difference]: Finished difference Result 1012 states and 3240 transitions. [2025-04-13 18:33:17,642 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:33:17,642 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 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:33:17,642 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:33:17,644 INFO L225 Difference]: With dead ends: 1012 [2025-04-13 18:33:17,644 INFO L226 Difference]: Without dead ends: 1001 [2025-04-13 18:33:17,645 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=436, Invalid=2756, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 18:33:17,645 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 302 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2230 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:33:17,645 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 0 Invalid, 2273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2230 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:33:17,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2025-04-13 18:33:17,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 720. [2025-04-13 18:33:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 719 states have (on average 3.388038942976356) internal successors, (2436), 719 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:33:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 2436 transitions. [2025-04-13 18:33:17,657 INFO L79 Accepts]: Start accepts. Automaton has 720 states and 2436 transitions. Word has length 25 [2025-04-13 18:33:17,657 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:33:17,657 INFO L485 AbstractCegarLoop]: Abstraction has 720 states and 2436 transitions. [2025-04-13 18:33:17,657 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:33:17,657 INFO L278 IsEmpty]: Start isEmpty. Operand 720 states and 2436 transitions. [2025-04-13 18:33:17,658 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:33:17,658 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:33:17,658 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:33:17,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-04-13 18:33:17,859 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:33:17,859 INFO L403 AbstractCegarLoop]: === Iteration 63 === 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:33:17,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:33:17,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1777190775, now seen corresponding path program 31 times [2025-04-13 18:33:17,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:33:17,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450560792] [2025-04-13 18:33:17,860 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:33:17,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:33:17,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:33:17,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:33:17,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:33:17,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:33:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:33:18,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:33:18,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450560792] [2025-04-13 18:33:18,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450560792] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:33:18,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757902914] [2025-04-13 18:33:18,586 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:33:18,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:33:18,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:33:18,588 INFO L229 MonitoredProcess]: Starting monitored process 41 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:33:18,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-04-13 18:33:18,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:33:18,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:33:18,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:33:18,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:33:18,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:33:18,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:33:18,690 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 19 treesize of output 1 [2025-04-13 18:33:19,123 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:33:19,123 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 166 treesize of output 80 [2025-04-13 18:33:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:33:19,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:33:22,386 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 507 treesize of output 449 [2025-04-13 18:33:22,392 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:33:22,392 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 639 treesize of output 529 [2025-04-13 18:33:22,958 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 244 treesize of output 212 [2025-04-13 18:33:22,963 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:33:22,963 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 358 treesize of output 1 [2025-04-13 18:33:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:33:22,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757902914] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:33:22,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:33:22,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 36 [2025-04-13 18:33:22,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466470306] [2025-04-13 18:33:22,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:33:22,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:33:22,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:33:22,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:33:22,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:33:22,983 INFO L87 Difference]: Start difference. First operand 720 states and 2436 transitions. Second operand has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 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:33:32,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:33:32,207 INFO L93 Difference]: Finished difference Result 1163 states and 3769 transitions. [2025-04-13 18:33:32,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-13 18:33:32,207 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 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 25 [2025-04-13 18:33:32,208 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:33:32,210 INFO L225 Difference]: With dead ends: 1163 [2025-04-13 18:33:32,210 INFO L226 Difference]: Without dead ends: 1147 [2025-04-13 18:33:32,210 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2488 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1027, Invalid=8093, Unknown=0, NotChecked=0, Total=9120 [2025-04-13 18:33:32,211 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 472 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3213 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:33:32,211 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 0 Invalid, 3269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3213 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-04-13 18:33:32,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2025-04-13 18:33:32,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 718. [2025-04-13 18:33:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 3.387726638772664) internal successors, (2429), 717 states have internal predecessors, (2429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:33:32,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 2429 transitions. [2025-04-13 18:33:32,221 INFO L79 Accepts]: Start accepts. Automaton has 718 states and 2429 transitions. Word has length 25 [2025-04-13 18:33:32,221 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:33:32,221 INFO L485 AbstractCegarLoop]: Abstraction has 718 states and 2429 transitions. [2025-04-13 18:33:32,221 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 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:33:32,221 INFO L278 IsEmpty]: Start isEmpty. Operand 718 states and 2429 transitions. [2025-04-13 18:33:32,222 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:33:32,222 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:33:32,222 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:33:32,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2025-04-13 18:33:32,422 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2025-04-13 18:33:32,422 INFO L403 AbstractCegarLoop]: === Iteration 64 === 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:33:32,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:33:32,423 INFO L85 PathProgramCache]: Analyzing trace with hash 948104817, now seen corresponding path program 32 times [2025-04-13 18:33:32,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:33:32,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319835800] [2025-04-13 18:33:32,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:33:32,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:33:32,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:33:32,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:33:32,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:33:32,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:33:33,231 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:33:33,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:33:33,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319835800] [2025-04-13 18:33:33,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319835800] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:33:33,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191395403] [2025-04-13 18:33:33,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:33:33,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:33:33,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:33:33,233 INFO L229 MonitoredProcess]: Starting monitored process 42 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:33:33,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-04-13 18:33:33,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:33:33,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:33:33,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:33:33,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:33:33,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:33:33,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:33:33,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:33:33,865 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:33:33,865 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 90 [2025-04-13 18:33:34,068 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:33:34,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:33:35,211 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:33:35,211 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 413 treesize of output 189 [2025-04-13 18:33:36,066 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:33:36,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191395403] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:33:36,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:33:36,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 18:33:36,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773592320] [2025-04-13 18:33:36,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:33:36,067 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:33:36,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:33:36,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:33:36,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:33:36,067 INFO L87 Difference]: Start difference. First operand 718 states and 2429 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:33:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:33:39,702 INFO L93 Difference]: Finished difference Result 1087 states and 3501 transitions. [2025-04-13 18:33:39,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 18:33:39,702 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 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:33:39,702 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:33:39,704 INFO L225 Difference]: With dead ends: 1087 [2025-04-13 18:33:39,704 INFO L226 Difference]: Without dead ends: 1076 [2025-04-13 18:33:39,704 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=687, Invalid=4283, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 18:33:39,705 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 302 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:33:39,705 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 0 Invalid, 2614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2547 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:33:39,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2025-04-13 18:33:39,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 724. [2025-04-13 18:33:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 3.392807745504841) internal successors, (2453), 723 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:33:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 2453 transitions. [2025-04-13 18:33:39,714 INFO L79 Accepts]: Start accepts. Automaton has 724 states and 2453 transitions. Word has length 25 [2025-04-13 18:33:39,715 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:33:39,715 INFO L485 AbstractCegarLoop]: Abstraction has 724 states and 2453 transitions. [2025-04-13 18:33:39,715 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:33:39,715 INFO L278 IsEmpty]: Start isEmpty. Operand 724 states and 2453 transitions. [2025-04-13 18:33:39,716 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:33:39,716 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:33:39,716 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:33:39,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2025-04-13 18:33:39,916 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:33:39,916 INFO L403 AbstractCegarLoop]: === Iteration 65 === 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:33:39,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:33:39,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1026386675, now seen corresponding path program 33 times [2025-04-13 18:33:39,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:33:39,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480589963] [2025-04-13 18:33:39,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:33:39,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:33:39,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:33:39,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:33:39,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:33:39,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:33:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:33:40,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:33:40,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480589963] [2025-04-13 18:33:40,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480589963] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:33:40,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:33:40,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:33:40,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012388440] [2025-04-13 18:33:40,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:33:40,650 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:33:40,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:33:40,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:33:40,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:33:40,651 INFO L87 Difference]: Start difference. First operand 724 states and 2453 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:33:41,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:33:41,007 INFO L93 Difference]: Finished difference Result 810 states and 2741 transitions. [2025-04-13 18:33:41,007 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:33:41,007 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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 25 [2025-04-13 18:33:41,007 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:33:41,009 INFO L225 Difference]: With dead ends: 810 [2025-04-13 18:33:41,009 INFO L226 Difference]: Without dead ends: 804 [2025-04-13 18:33:41,009 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:33:41,009 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:33:41,009 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:33:41,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-04-13 18:33:41,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 724. [2025-04-13 18:33:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 3.392807745504841) internal successors, (2453), 723 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:33:41,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 2453 transitions. [2025-04-13 18:33:41,017 INFO L79 Accepts]: Start accepts. Automaton has 724 states and 2453 transitions. Word has length 25 [2025-04-13 18:33:41,017 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:33:41,017 INFO L485 AbstractCegarLoop]: Abstraction has 724 states and 2453 transitions. [2025-04-13 18:33:41,018 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:33:41,018 INFO L278 IsEmpty]: Start isEmpty. Operand 724 states and 2453 transitions. [2025-04-13 18:33:41,018 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:33:41,018 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:33:41,019 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:33:41,019 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-04-13 18:33:41,019 INFO L403 AbstractCegarLoop]: === Iteration 66 === 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:33:41,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:33:41,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1029121505, now seen corresponding path program 34 times [2025-04-13 18:33:41,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:33:41,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374499136] [2025-04-13 18:33:41,019 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:33:41,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:33:41,022 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:33:41,027 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:33:41,027 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:33:41,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:33:41,397 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:33:41,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:33:41,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374499136] [2025-04-13 18:33:41,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374499136] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:33:41,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167583104] [2025-04-13 18:33:41,398 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:33:41,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:33:41,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:33:41,400 INFO L229 MonitoredProcess]: Starting monitored process 43 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:33:41,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-04-13 18:33:41,453 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:33:41,466 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:33:41,466 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:33:41,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:33:41,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:33:41,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:33:41,900 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:33:41,900 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 80 [2025-04-13 18:33:42,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:33:42,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:33:43,437 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:33:43,438 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 585 treesize of output 273 [2025-04-13 18:33:45,915 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:33:45,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167583104] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:33:45,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:33:45,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 32 [2025-04-13 18:33:45,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504816291] [2025-04-13 18:33:45,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:33:45,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:33:45,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:33:45,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:33:45,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=962, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:33:45,916 INFO L87 Difference]: Start difference. First operand 724 states and 2453 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:33:48,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:33:48,208 INFO L93 Difference]: Finished difference Result 895 states and 2973 transitions. [2025-04-13 18:33:48,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 18:33:48,209 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 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:33:48,209 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:33:48,211 INFO L225 Difference]: With dead ends: 895 [2025-04-13 18:33:48,211 INFO L226 Difference]: Without dead ends: 884 [2025-04-13 18:33:48,211 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=378, Invalid=2702, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 18:33:48,211 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 232 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2742 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:33:48,211 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 0 Invalid, 2764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2742 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 18:33:48,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-04-13 18:33:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 718. [2025-04-13 18:33:48,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 3.3765690376569037) internal successors, (2421), 717 states have internal predecessors, (2421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:33:48,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 2421 transitions. [2025-04-13 18:33:48,220 INFO L79 Accepts]: Start accepts. Automaton has 718 states and 2421 transitions. Word has length 25 [2025-04-13 18:33:48,220 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:33:48,220 INFO L485 AbstractCegarLoop]: Abstraction has 718 states and 2421 transitions. [2025-04-13 18:33:48,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:33:48,220 INFO L278 IsEmpty]: Start isEmpty. Operand 718 states and 2421 transitions. [2025-04-13 18:33:48,221 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:33:48,221 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:33:48,221 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:33:48,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2025-04-13 18:33:48,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:33:48,421 INFO L403 AbstractCegarLoop]: === Iteration 67 === 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:33:48,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:33:48,422 INFO L85 PathProgramCache]: Analyzing trace with hash -638891789, now seen corresponding path program 35 times [2025-04-13 18:33:48,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:33:48,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070606729] [2025-04-13 18:33:48,422 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:33:48,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:33:48,425 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:33:48,430 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:33:48,430 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:33:48,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:33:49,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:33:49,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:33:49,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070606729] [2025-04-13 18:33:49,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070606729] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:33:49,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625457892] [2025-04-13 18:33:49,308 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:33:49,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:33:49,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:33:49,310 INFO L229 MonitoredProcess]: Starting monitored process 44 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:33:49,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-04-13 18:33:49,363 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:33:49,377 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:33:49,377 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:33:49,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:33:49,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:33:49,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:33:49,926 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:33:49,926 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 82 [2025-04-13 18:33:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:33:50,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:33:51,489 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:33:51,489 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 537 treesize of output 263 [2025-04-13 18:33:53,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:33:53,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625457892] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:33:53,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:33:53,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 9] total 34 [2025-04-13 18:33:53,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293097577] [2025-04-13 18:33:53,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:33:53,093 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 18:33:53,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:33:53,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 18:33:53,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:33:53,093 INFO L87 Difference]: Start difference. First operand 718 states and 2421 transitions. Second operand has 36 states, 35 states have (on average 2.0) internal successors, (70), 35 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:33:57,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:33:57,274 INFO L93 Difference]: Finished difference Result 1145 states and 3793 transitions. [2025-04-13 18:33:57,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 18:33:57,274 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.0) internal successors, (70), 35 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 25 [2025-04-13 18:33:57,274 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:33:57,276 INFO L225 Difference]: With dead ends: 1145 [2025-04-13 18:33:57,276 INFO L226 Difference]: Without dead ends: 1134 [2025-04-13 18:33:57,277 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=613, Invalid=4499, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 18:33:57,277 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 366 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2755 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:33:57,277 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 0 Invalid, 2858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2755 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 18:33:57,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2025-04-13 18:33:57,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 722. [2025-04-13 18:33:57,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 721 states have (on average 3.3869625520110955) internal successors, (2442), 721 states have internal predecessors, (2442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:33:57,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 2442 transitions. [2025-04-13 18:33:57,287 INFO L79 Accepts]: Start accepts. Automaton has 722 states and 2442 transitions. Word has length 25 [2025-04-13 18:33:57,287 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:33:57,287 INFO L485 AbstractCegarLoop]: Abstraction has 722 states and 2442 transitions. [2025-04-13 18:33:57,287 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.0) internal successors, (70), 35 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:33:57,287 INFO L278 IsEmpty]: Start isEmpty. Operand 722 states and 2442 transitions. [2025-04-13 18:33:57,288 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:33:57,288 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:33:57,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:33:57,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2025-04-13 18:33:57,488 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2025-04-13 18:33:57,488 INFO L403 AbstractCegarLoop]: === Iteration 68 === 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:33:57,489 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:33:57,489 INFO L85 PathProgramCache]: Analyzing trace with hash 536325685, now seen corresponding path program 36 times [2025-04-13 18:33:57,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:33:57,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211433222] [2025-04-13 18:33:57,489 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:33:57,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:33:57,492 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:33:57,498 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:33:57,498 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:33:57,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:33:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:33:58,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:33:58,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211433222] [2025-04-13 18:33:58,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211433222] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:33:58,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261364834] [2025-04-13 18:33:58,374 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:33:58,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:33:58,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:33:58,376 INFO L229 MonitoredProcess]: Starting monitored process 45 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:33:58,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-04-13 18:33:58,430 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:33:58,443 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:33:58,443 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:33:58,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:33:58,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 18:33:58,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:33:58,939 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:33:58,939 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 88 [2025-04-13 18:33:59,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:33:59,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:34:01,691 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:34:01,691 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 529 treesize of output 249 [2025-04-13 18:34:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:34:03,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261364834] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:34:03,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:34:03,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 18:34:03,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231410187] [2025-04-13 18:34:03,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:34:03,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:34:03,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:34:03,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:34:03,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:34:03,357 INFO L87 Difference]: Start difference. First operand 722 states and 2442 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:34:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:34:13,202 INFO L93 Difference]: Finished difference Result 966 states and 3187 transitions. [2025-04-13 18:34:13,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-13 18:34:13,203 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 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:34:13,203 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:34:13,205 INFO L225 Difference]: With dead ends: 966 [2025-04-13 18:34:13,205 INFO L226 Difference]: Without dead ends: 950 [2025-04-13 18:34:13,205 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2042 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=916, Invalid=6224, Unknown=0, NotChecked=0, Total=7140 [2025-04-13 18:34:13,205 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 282 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2376 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:34:13,205 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 0 Invalid, 2469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2376 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 18:34:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-04-13 18:34:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 736. [2025-04-13 18:34:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 735 states have (on average 3.4027210884353742) internal successors, (2501), 735 states have internal predecessors, (2501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:34:13,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 2501 transitions. [2025-04-13 18:34:13,215 INFO L79 Accepts]: Start accepts. Automaton has 736 states and 2501 transitions. Word has length 25 [2025-04-13 18:34:13,215 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:34:13,215 INFO L485 AbstractCegarLoop]: Abstraction has 736 states and 2501 transitions. [2025-04-13 18:34:13,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:34:13,215 INFO L278 IsEmpty]: Start isEmpty. Operand 736 states and 2501 transitions. [2025-04-13 18:34:13,216 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:34:13,216 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:34:13,216 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:34:13,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2025-04-13 18:34:13,416 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2025-04-13 18:34:13,416 INFO L403 AbstractCegarLoop]: === Iteration 69 === 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:34:13,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:34:13,417 INFO L85 PathProgramCache]: Analyzing trace with hash 556078473, now seen corresponding path program 37 times [2025-04-13 18:34:13,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:34:13,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025591701] [2025-04-13 18:34:13,417 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:34:13,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:34:13,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:34:13,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:34:13,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:34:13,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:34:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:34:14,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:34:14,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025591701] [2025-04-13 18:34:14,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025591701] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:34:14,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357417824] [2025-04-13 18:34:14,443 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:34:14,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:34:14,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:34:14,445 INFO L229 MonitoredProcess]: Starting monitored process 46 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:34:14,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-04-13 18:34:14,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:34:14,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:34:14,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:34:14,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:34:14,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:34:14,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:34:14,553 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 19 treesize of output 1 [2025-04-13 18:34:14,957 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:34:14,957 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 132 treesize of output 72 [2025-04-13 18:34:15,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:34:15,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:34:18,510 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 455 treesize of output 405 [2025-04-13 18:34:18,516 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:34:18,516 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 550 treesize of output 462 [2025-04-13 18:34:18,976 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 246 treesize of output 214 [2025-04-13 18:34:18,981 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:34:18,981 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 360 treesize of output 1 [2025-04-13 18:34:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:34:19,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357417824] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:34:19,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:34:19,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 36 [2025-04-13 18:34:19,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612432539] [2025-04-13 18:34:19,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:34:19,002 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:34:19,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:34:19,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:34:19,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1227, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:34:19,003 INFO L87 Difference]: Start difference. First operand 736 states and 2501 transitions. Second operand has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 37 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:34:24,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:34:24,421 INFO L93 Difference]: Finished difference Result 1019 states and 3382 transitions. [2025-04-13 18:34:24,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 18:34:24,422 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 37 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 25 [2025-04-13 18:34:24,422 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:34:24,424 INFO L225 Difference]: With dead ends: 1019 [2025-04-13 18:34:24,424 INFO L226 Difference]: Without dead ends: 1008 [2025-04-13 18:34:24,424 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=480, Invalid=3552, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 18:34:24,425 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 320 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2177 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:34:24,425 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 0 Invalid, 2214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2177 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 18:34:24,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2025-04-13 18:34:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 756. [2025-04-13 18:34:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 3.410596026490066) internal successors, (2575), 755 states have internal predecessors, (2575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:34:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 2575 transitions. [2025-04-13 18:34:24,434 INFO L79 Accepts]: Start accepts. Automaton has 756 states and 2575 transitions. Word has length 25 [2025-04-13 18:34:24,434 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:34:24,434 INFO L485 AbstractCegarLoop]: Abstraction has 756 states and 2575 transitions. [2025-04-13 18:34:24,434 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 37 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:34:24,434 INFO L278 IsEmpty]: Start isEmpty. Operand 756 states and 2575 transitions. [2025-04-13 18:34:24,435 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:34:24,435 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:34:24,435 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:34:24,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2025-04-13 18:34:24,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2025-04-13 18:34:24,636 INFO L403 AbstractCegarLoop]: === Iteration 70 === 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:34:24,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:34:24,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1606785289, now seen corresponding path program 38 times [2025-04-13 18:34:24,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:34:24,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39194912] [2025-04-13 18:34:24,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:34:24,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:34:24,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:34:24,644 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:34:24,644 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:34:24,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:34:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:34:25,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:34:25,269 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39194912] [2025-04-13 18:34:25,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39194912] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:34:25,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:34:25,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:34:25,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489228522] [2025-04-13 18:34:25,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:34:25,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:34:25,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:34:25,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:34:25,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:34:25,270 INFO L87 Difference]: Start difference. First operand 756 states and 2575 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:34:25,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:34:25,669 INFO L93 Difference]: Finished difference Result 852 states and 2895 transitions. [2025-04-13 18:34:25,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:34:25,670 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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 25 [2025-04-13 18:34:25,670 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:34:25,672 INFO L225 Difference]: With dead ends: 852 [2025-04-13 18:34:25,672 INFO L226 Difference]: Without dead ends: 846 [2025-04-13 18:34:25,672 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:34:25,672 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:34:25,672 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:34:25,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-04-13 18:34:25,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 772. [2025-04-13 18:34:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 771 states have (on average 3.4202334630350193) internal successors, (2637), 771 states have internal predecessors, (2637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:34:25,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 2637 transitions. [2025-04-13 18:34:25,682 INFO L79 Accepts]: Start accepts. Automaton has 772 states and 2637 transitions. Word has length 25 [2025-04-13 18:34:25,682 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:34:25,682 INFO L485 AbstractCegarLoop]: Abstraction has 772 states and 2637 transitions. [2025-04-13 18:34:25,682 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:34:25,682 INFO L278 IsEmpty]: Start isEmpty. Operand 772 states and 2637 transitions. [2025-04-13 18:34:25,683 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:34:25,683 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:34:25,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:34:25,683 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-04-13 18:34:25,683 INFO L403 AbstractCegarLoop]: === Iteration 71 === 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:34:25,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:34:25,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1625251981, now seen corresponding path program 39 times [2025-04-13 18:34:25,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:34:25,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707393767] [2025-04-13 18:34:25,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:34:25,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:34:25,687 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:34:25,691 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:34:25,691 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:34:25,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:34:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:34:26,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:34:26,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707393767] [2025-04-13 18:34:26,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707393767] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:34:26,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:34:26,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:34:26,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296914432] [2025-04-13 18:34:26,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:34:26,360 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:34:26,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:34:26,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:34:26,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:34:26,360 INFO L87 Difference]: Start difference. First operand 772 states and 2637 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:34:26,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:34:26,831 INFO L93 Difference]: Finished difference Result 876 states and 2980 transitions. [2025-04-13 18:34:26,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:34:26,831 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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 25 [2025-04-13 18:34:26,831 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:34:26,833 INFO L225 Difference]: With dead ends: 876 [2025-04-13 18:34:26,833 INFO L226 Difference]: Without dead ends: 870 [2025-04-13 18:34:26,833 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:34:26,833 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:34:26,833 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:34:26,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-04-13 18:34:26,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 774. [2025-04-13 18:34:26,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 3.4230271668822767) internal successors, (2646), 773 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:34:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 2646 transitions. [2025-04-13 18:34:26,842 INFO L79 Accepts]: Start accepts. Automaton has 774 states and 2646 transitions. Word has length 25 [2025-04-13 18:34:26,843 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:34:26,843 INFO L485 AbstractCegarLoop]: Abstraction has 774 states and 2646 transitions. [2025-04-13 18:34:26,843 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:34:26,843 INFO L278 IsEmpty]: Start isEmpty. Operand 774 states and 2646 transitions. [2025-04-13 18:34:26,844 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:34:26,844 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:34:26,844 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:34:26,844 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-04-13 18:34:26,844 INFO L403 AbstractCegarLoop]: === Iteration 72 === 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:34:26,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:34:26,844 INFO L85 PathProgramCache]: Analyzing trace with hash -380344029, now seen corresponding path program 40 times [2025-04-13 18:34:26,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:34:26,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047597605] [2025-04-13 18:34:26,844 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:34:26,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:34:26,848 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:34:26,852 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:34:26,852 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:34:26,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:34:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:34:27,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:34:27,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047597605] [2025-04-13 18:34:27,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047597605] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:34:27,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228401926] [2025-04-13 18:34:27,364 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:34:27,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:34:27,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:34:27,365 INFO L229 MonitoredProcess]: Starting monitored process 47 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:34:27,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-04-13 18:34:27,422 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:34:27,436 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:34:27,436 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:34:27,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:34:27,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:34:27,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:34:27,842 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:34:27,842 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 72 [2025-04-13 18:34:28,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:34:28,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:34:29,698 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:34:29,699 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 661 treesize of output 257 [2025-04-13 18:34:32,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:34:32,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228401926] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:34:32,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:34:32,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 32 [2025-04-13 18:34:32,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934798923] [2025-04-13 18:34:32,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:34:32,459 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:34:32,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:34:32,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:34:32,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:34:32,460 INFO L87 Difference]: Start difference. First operand 774 states and 2646 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:34:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:34:39,753 INFO L93 Difference]: Finished difference Result 1109 states and 3771 transitions. [2025-04-13 18:34:39,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-04-13 18:34:39,753 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 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:34:39,754 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:34:39,756 INFO L225 Difference]: With dead ends: 1109 [2025-04-13 18:34:39,756 INFO L226 Difference]: Without dead ends: 1098 [2025-04-13 18:34:39,756 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3035 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1175, Invalid=8527, Unknown=0, NotChecked=0, Total=9702 [2025-04-13 18:34:39,757 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 275 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2982 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:34:39,757 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 0 Invalid, 3077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2982 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 18:34:39,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2025-04-13 18:34:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 800. [2025-04-13 18:34:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 3.4455569461827285) internal successors, (2753), 799 states have internal predecessors, (2753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:34:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 2753 transitions. [2025-04-13 18:34:39,767 INFO L79 Accepts]: Start accepts. Automaton has 800 states and 2753 transitions. Word has length 25 [2025-04-13 18:34:39,767 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:34:39,767 INFO L485 AbstractCegarLoop]: Abstraction has 800 states and 2753 transitions. [2025-04-13 18:34:39,767 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:34:39,767 INFO L278 IsEmpty]: Start isEmpty. Operand 800 states and 2753 transitions. [2025-04-13 18:34:39,768 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:34:39,768 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:34:39,768 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:34:39,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2025-04-13 18:34:39,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:34:39,969 INFO L403 AbstractCegarLoop]: === Iteration 73 === 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:34:39,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:34:39,969 INFO L85 PathProgramCache]: Analyzing trace with hash -361877337, now seen corresponding path program 41 times [2025-04-13 18:34:39,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:34:39,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988729451] [2025-04-13 18:34:39,969 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:34:39,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:34:39,973 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:34:39,977 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:34:39,977 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:34:39,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:34:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:34:40,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:34:40,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988729451] [2025-04-13 18:34:40,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988729451] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:34:40,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101121182] [2025-04-13 18:34:40,527 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:34:40,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:34:40,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:34:40,528 INFO L229 MonitoredProcess]: Starting monitored process 48 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:34:40,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-04-13 18:34:40,583 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:34:40,596 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:34:40,596 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:34:40,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:34:40,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:34:40,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:34:41,041 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:34:41,041 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 72 [2025-04-13 18:34:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:34:41,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:34:43,326 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:34:43,326 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 557 treesize of output 271 [2025-04-13 18:34:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:34:44,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101121182] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:34:44,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:34:44,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 12] total 34 [2025-04-13 18:34:44,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346823864] [2025-04-13 18:34:44,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:34:44,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:34:44,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:34:44,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:34:44,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:34:44,801 INFO L87 Difference]: Start difference. First operand 800 states and 2753 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 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:34:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:34:46,440 INFO L93 Difference]: Finished difference Result 898 states and 3071 transitions. [2025-04-13 18:34:46,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:34:46,440 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 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 25 [2025-04-13 18:34:46,440 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:34:46,442 INFO L225 Difference]: With dead ends: 898 [2025-04-13 18:34:46,442 INFO L226 Difference]: Without dead ends: 892 [2025-04-13 18:34:46,442 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=192, Invalid=1614, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:34:46,442 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:34:46,442 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:34:46,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2025-04-13 18:34:46,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 798. [2025-04-13 18:34:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 3.4479297365119197) internal successors, (2748), 797 states have internal predecessors, (2748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:34:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2748 transitions. [2025-04-13 18:34:46,452 INFO L79 Accepts]: Start accepts. Automaton has 798 states and 2748 transitions. Word has length 25 [2025-04-13 18:34:46,452 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:34:46,452 INFO L485 AbstractCegarLoop]: Abstraction has 798 states and 2748 transitions. [2025-04-13 18:34:46,452 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 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:34:46,452 INFO L278 IsEmpty]: Start isEmpty. Operand 798 states and 2748 transitions. [2025-04-13 18:34:46,453 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:34:46,453 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:34:46,453 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:34:46,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2025-04-13 18:34:46,653 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:34:46,654 INFO L403 AbstractCegarLoop]: === Iteration 74 === 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:34:46,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:34:46,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1957149899, now seen corresponding path program 42 times [2025-04-13 18:34:46,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:34:46,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260821541] [2025-04-13 18:34:46,654 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:34:46,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:34:46,658 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:34:46,664 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:34:46,664 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:34:46,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:34:47,573 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:34:47,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:34:47,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260821541] [2025-04-13 18:34:47,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260821541] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:34:47,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457884347] [2025-04-13 18:34:47,573 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:34:47,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:34:47,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:34:47,575 INFO L229 MonitoredProcess]: Starting monitored process 49 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:34:47,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2025-04-13 18:34:47,633 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:34:47,646 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:34:47,646 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:34:47,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:34:47,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 18:34:47,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:34:48,094 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:34:48,095 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 88 [2025-04-13 18:34:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:34:48,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:34:51,507 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:34:51,507 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 583 treesize of output 279 [2025-04-13 18:34:53,025 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:34:53,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457884347] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:34:53,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:34:53,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 18:34:53,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023325246] [2025-04-13 18:34:53,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:34:53,026 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:34:53,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:34:53,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:34:53,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1016, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:34:53,027 INFO L87 Difference]: Start difference. First operand 798 states and 2748 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:02,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:02,184 INFO L93 Difference]: Finished difference Result 1035 states and 3455 transitions. [2025-04-13 18:35:02,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-13 18:35:02,184 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 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:35:02,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:02,186 INFO L225 Difference]: With dead ends: 1035 [2025-04-13 18:35:02,186 INFO L226 Difference]: Without dead ends: 1024 [2025-04-13 18:35:02,187 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=813, Invalid=5349, Unknown=0, NotChecked=0, Total=6162 [2025-04-13 18:35:02,187 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 238 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:02,187 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 0 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:35:02,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2025-04-13 18:35:02,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 800. [2025-04-13 18:35:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 3.4455569461827285) internal successors, (2753), 799 states have internal predecessors, (2753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:02,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 2753 transitions. [2025-04-13 18:35:02,197 INFO L79 Accepts]: Start accepts. Automaton has 800 states and 2753 transitions. Word has length 25 [2025-04-13 18:35:02,197 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:02,197 INFO L485 AbstractCegarLoop]: Abstraction has 800 states and 2753 transitions. [2025-04-13 18:35:02,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:02,198 INFO L278 IsEmpty]: Start isEmpty. Operand 800 states and 2753 transitions. [2025-04-13 18:35:02,199 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:35:02,199 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:02,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:02,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2025-04-13 18:35:02,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:02,399 INFO L403 AbstractCegarLoop]: === Iteration 75 === 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:35:02,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:02,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1652217037, now seen corresponding path program 43 times [2025-04-13 18:35:02,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:02,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562357732] [2025-04-13 18:35:02,400 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:35:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:02,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:35:02,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:35:02,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:02,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:03,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:35:03,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:03,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562357732] [2025-04-13 18:35:03,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562357732] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:03,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537073923] [2025-04-13 18:35:03,100 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:35:03,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:03,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:03,101 INFO L229 MonitoredProcess]: Starting monitored process 50 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:35:03,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2025-04-13 18:35:03,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:35:03,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:35:03,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:35:03,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:03,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:35:03,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:03,221 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 19 treesize of output 1 [2025-04-13 18:35:03,727 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:35:03,728 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 166 treesize of output 80 [2025-04-13 18:35:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:35:03,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:07,636 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 507 treesize of output 449 [2025-04-13 18:35:07,642 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:35:07,642 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 639 treesize of output 529 [2025-04-13 18:35:08,116 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 244 treesize of output 212 [2025-04-13 18:35:08,121 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:35:08,121 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 358 treesize of output 1 [2025-04-13 18:35:08,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:08,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537073923] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:08,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:08,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 36 [2025-04-13 18:35:08,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176965699] [2025-04-13 18:35:08,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:08,141 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:35:08,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:08,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:35:08,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1219, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:35:08,142 INFO L87 Difference]: Start difference. First operand 800 states and 2753 transitions. Second operand has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 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:35:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:13,885 INFO L93 Difference]: Finished difference Result 1119 states and 3768 transitions. [2025-04-13 18:35:13,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 18:35:13,886 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 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 25 [2025-04-13 18:35:13,886 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:13,888 INFO L225 Difference]: With dead ends: 1119 [2025-04-13 18:35:13,888 INFO L226 Difference]: Without dead ends: 1108 [2025-04-13 18:35:13,888 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=516, Invalid=3774, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 18:35:13,888 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 247 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2889 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:13,889 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 0 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2889 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 18:35:13,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-04-13 18:35:13,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 804. [2025-04-13 18:35:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 803 states have (on average 3.4508094645080947) internal successors, (2771), 803 states have internal predecessors, (2771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 2771 transitions. [2025-04-13 18:35:13,899 INFO L79 Accepts]: Start accepts. Automaton has 804 states and 2771 transitions. Word has length 25 [2025-04-13 18:35:13,899 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:13,899 INFO L485 AbstractCegarLoop]: Abstraction has 804 states and 2771 transitions. [2025-04-13 18:35:13,899 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 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:35:13,899 INFO L278 IsEmpty]: Start isEmpty. Operand 804 states and 2771 transitions. [2025-04-13 18:35:13,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:35:13,900 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:13,900 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:13,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2025-04-13 18:35:14,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2025-04-13 18:35:14,101 INFO L403 AbstractCegarLoop]: === Iteration 76 === 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:35:14,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:14,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1686580349, now seen corresponding path program 44 times [2025-04-13 18:35:14,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:14,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010756724] [2025-04-13 18:35:14,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:35:14,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:14,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:35:14,111 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:35:14,111 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:14,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:15,269 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:35:15,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:15,269 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010756724] [2025-04-13 18:35:15,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010756724] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:15,269 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443737158] [2025-04-13 18:35:15,269 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:35:15,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:15,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:15,271 INFO L229 MonitoredProcess]: Starting monitored process 51 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:35:15,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2025-04-13 18:35:15,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:35:15,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:35:15,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:15,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:15,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 18:35:15,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:15,797 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:35:15,797 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 88 [2025-04-13 18:35:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:16,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:17,724 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:35:17,724 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 497 treesize of output 225 [2025-04-13 18:35:18,884 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:35:18,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443737158] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:18,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:18,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 18:35:18,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832063762] [2025-04-13 18:35:18,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:18,885 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:35:18,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:18,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:35:18,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1013, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:35:18,885 INFO L87 Difference]: Start difference. First operand 804 states and 2771 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:27,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:27,173 INFO L93 Difference]: Finished difference Result 1067 states and 3545 transitions. [2025-04-13 18:35:27,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-13 18:35:27,173 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 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:35:27,173 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:27,175 INFO L225 Difference]: With dead ends: 1067 [2025-04-13 18:35:27,175 INFO L226 Difference]: Without dead ends: 1056 [2025-04-13 18:35:27,176 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2354 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1020, Invalid=6462, Unknown=0, NotChecked=0, Total=7482 [2025-04-13 18:35:27,176 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 260 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:27,176 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 0 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:35:27,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-04-13 18:35:27,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 806. [2025-04-13 18:35:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 3.4509316770186333) internal successors, (2778), 805 states have internal predecessors, (2778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 2778 transitions. [2025-04-13 18:35:27,188 INFO L79 Accepts]: Start accepts. Automaton has 806 states and 2778 transitions. Word has length 25 [2025-04-13 18:35:27,188 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:27,188 INFO L485 AbstractCegarLoop]: Abstraction has 806 states and 2778 transitions. [2025-04-13 18:35:27,188 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:27,188 INFO L278 IsEmpty]: Start isEmpty. Operand 806 states and 2778 transitions. [2025-04-13 18:35:27,189 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:35:27,189 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:27,189 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:27,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2025-04-13 18:35:27,389 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2025-04-13 18:35:27,390 INFO L403 AbstractCegarLoop]: === Iteration 77 === 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:35:27,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:27,390 INFO L85 PathProgramCache]: Analyzing trace with hash 275495449, now seen corresponding path program 45 times [2025-04-13 18:35:27,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:27,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389542733] [2025-04-13 18:35:27,390 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:35:27,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:27,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:35:27,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:35:27,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:35:27,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:28,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:35:28,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:28,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389542733] [2025-04-13 18:35:28,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389542733] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:35:28,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:35:28,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:35:28,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483274267] [2025-04-13 18:35:28,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:35:28,074 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:35:28,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:28,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:35:28,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:35:28,074 INFO L87 Difference]: Start difference. First operand 806 states and 2778 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:35:28,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:28,548 INFO L93 Difference]: Finished difference Result 900 states and 3082 transitions. [2025-04-13 18:35:28,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:35:28,548 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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 25 [2025-04-13 18:35:28,548 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:28,550 INFO L225 Difference]: With dead ends: 900 [2025-04-13 18:35:28,550 INFO L226 Difference]: Without dead ends: 894 [2025-04-13 18:35:28,550 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:35:28,550 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:28,551 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:35:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-04-13 18:35:28,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 814. [2025-04-13 18:35:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 3.4612546125461257) internal successors, (2814), 813 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 2814 transitions. [2025-04-13 18:35:28,560 INFO L79 Accepts]: Start accepts. Automaton has 814 states and 2814 transitions. Word has length 25 [2025-04-13 18:35:28,560 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:28,560 INFO L485 AbstractCegarLoop]: Abstraction has 814 states and 2814 transitions. [2025-04-13 18:35:28,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:35:28,560 INFO L278 IsEmpty]: Start isEmpty. Operand 814 states and 2814 transitions. [2025-04-13 18:35:28,561 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:35:28,561 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:28,562 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:28,562 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-04-13 18:35:28,562 INFO L403 AbstractCegarLoop]: === Iteration 78 === 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:35:28,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:28,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1253755811, now seen corresponding path program 46 times [2025-04-13 18:35:28,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:28,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272022828] [2025-04-13 18:35:28,562 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:35:28,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:28,566 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:35:28,570 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:35:28,570 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:35:28,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:35:28,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:28,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272022828] [2025-04-13 18:35:28,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272022828] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:28,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028585686] [2025-04-13 18:35:28,985 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:35:28,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:28,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:28,986 INFO L229 MonitoredProcess]: Starting monitored process 52 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:35:28,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-04-13 18:35:29,048 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:35:29,061 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:35:29,062 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:35:29,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:29,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:35:29,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:29,515 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:35:29,515 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 72 [2025-04-13 18:35:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:29,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:31,237 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:35:31,238 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 605 treesize of output 273 [2025-04-13 18:35:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:35:33,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028585686] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:33,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:33,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 32 [2025-04-13 18:35:33,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613946107] [2025-04-13 18:35:33,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:33,875 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:35:33,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:33,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:35:33,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:35:33,875 INFO L87 Difference]: Start difference. First operand 814 states and 2814 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:40,774 INFO L93 Difference]: Finished difference Result 1089 states and 3655 transitions. [2025-04-13 18:35:40,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 18:35:40,774 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:35:40,774 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:40,776 INFO L225 Difference]: With dead ends: 1089 [2025-04-13 18:35:40,776 INFO L226 Difference]: Without dead ends: 1078 [2025-04-13 18:35:40,777 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1919 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=789, Invalid=5531, Unknown=0, NotChecked=0, Total=6320 [2025-04-13 18:35:40,777 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 235 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2294 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:40,777 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 0 Invalid, 2357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2294 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:35:40,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2025-04-13 18:35:40,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 818. [2025-04-13 18:35:40,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 817 states have (on average 3.466340269277846) internal successors, (2832), 817 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 2832 transitions. [2025-04-13 18:35:40,787 INFO L79 Accepts]: Start accepts. Automaton has 818 states and 2832 transitions. Word has length 25 [2025-04-13 18:35:40,787 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:40,787 INFO L485 AbstractCegarLoop]: Abstraction has 818 states and 2832 transitions. [2025-04-13 18:35:40,787 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:40,787 INFO L278 IsEmpty]: Start isEmpty. Operand 818 states and 2832 transitions. [2025-04-13 18:35:40,788 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:35:40,788 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:40,788 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:40,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2025-04-13 18:35:40,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2025-04-13 18:35:40,989 INFO L403 AbstractCegarLoop]: === Iteration 79 === 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:35:40,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:40,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1711633869, now seen corresponding path program 47 times [2025-04-13 18:35:40,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:40,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85656366] [2025-04-13 18:35:40,989 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:35:40,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:40,993 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:35:40,999 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:35:40,999 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:40,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:35:42,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:42,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85656366] [2025-04-13 18:35:42,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85656366] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:42,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477885809] [2025-04-13 18:35:42,318 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:35:42,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:42,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:42,319 INFO L229 MonitoredProcess]: Starting monitored process 53 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:35:42,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-04-13 18:35:42,379 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:35:42,393 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:35:42,393 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:35:42,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:42,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:35:42,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:42,900 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:35:42,900 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 72 [2025-04-13 18:35:43,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:35:43,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:45,217 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:35:45,218 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 541 treesize of output 255 [2025-04-13 18:35:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:35:46,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477885809] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:46,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:46,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 9] total 34 [2025-04-13 18:35:46,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273790932] [2025-04-13 18:35:46,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:46,741 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 18:35:46,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:46,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 18:35:46,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1106, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:35:46,741 INFO L87 Difference]: Start difference. First operand 818 states and 2832 transitions. Second operand has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:51,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:35:51,110 INFO L93 Difference]: Finished difference Result 1085 states and 3674 transitions. [2025-04-13 18:35:51,110 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 18:35:51,110 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 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:35:51,110 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:35:51,112 INFO L225 Difference]: With dead ends: 1085 [2025-04-13 18:35:51,113 INFO L226 Difference]: Without dead ends: 1074 [2025-04-13 18:35:51,113 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=473, Invalid=3433, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 18:35:51,113 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 202 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:35:51,113 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 0 Invalid, 2383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:35:51,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2025-04-13 18:35:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 814. [2025-04-13 18:35:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 3.4661746617466176) internal successors, (2818), 813 states have internal predecessors, (2818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 2818 transitions. [2025-04-13 18:35:51,124 INFO L79 Accepts]: Start accepts. Automaton has 814 states and 2818 transitions. Word has length 25 [2025-04-13 18:35:51,124 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:35:51,124 INFO L485 AbstractCegarLoop]: Abstraction has 814 states and 2818 transitions. [2025-04-13 18:35:51,124 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:35:51,124 INFO L278 IsEmpty]: Start isEmpty. Operand 814 states and 2818 transitions. [2025-04-13 18:35:51,126 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:35:51,126 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:35:51,126 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:35:51,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2025-04-13 18:35:51,326 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2025-04-13 18:35:51,326 INFO L403 AbstractCegarLoop]: === Iteration 80 === 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:35:51,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:35:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash -844401615, now seen corresponding path program 48 times [2025-04-13 18:35:51,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:35:51,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117389668] [2025-04-13 18:35:51,327 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:35:51,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:35:51,331 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:35:51,337 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:35:51,337 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:35:51,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:51,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:35:51,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:35:51,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117389668] [2025-04-13 18:35:51,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117389668] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:35:51,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787896749] [2025-04-13 18:35:51,919 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:35:51,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:35:51,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:35:51,921 INFO L229 MonitoredProcess]: Starting monitored process 54 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:35:51,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-04-13 18:35:51,979 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:35:51,992 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:35:51,992 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:35:51,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:35:51,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:35:51,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:35:52,433 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:35:52,434 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 96 [2025-04-13 18:35:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:35:52,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:35:53,864 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:35:53,864 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 381 treesize of output 173 [2025-04-13 18:35:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:35:54,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787896749] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:35:54,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:35:54,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 18:35:54,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908071819] [2025-04-13 18:35:54,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:35:54,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:35:54,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:35:54,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:35:54,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:35:54,704 INFO L87 Difference]: Start difference. First operand 814 states and 2818 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 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:36:01,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:36:01,661 INFO L93 Difference]: Finished difference Result 1279 states and 4185 transitions. [2025-04-13 18:36:01,662 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-13 18:36:01,662 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 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 25 [2025-04-13 18:36:01,662 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:36:01,664 INFO L225 Difference]: With dead ends: 1279 [2025-04-13 18:36:01,664 INFO L226 Difference]: Without dead ends: 1268 [2025-04-13 18:36:01,665 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2805 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1484, Invalid=7258, Unknown=0, NotChecked=0, Total=8742 [2025-04-13 18:36:01,665 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 401 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2637 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:36:01,665 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 0 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2637 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 18:36:01,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2025-04-13 18:36:01,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 822. [2025-04-13 18:36:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 821 states have (on average 3.459196102314251) internal successors, (2840), 821 states have internal predecessors, (2840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:36:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 2840 transitions. [2025-04-13 18:36:01,676 INFO L79 Accepts]: Start accepts. Automaton has 822 states and 2840 transitions. Word has length 25 [2025-04-13 18:36:01,676 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:36:01,676 INFO L485 AbstractCegarLoop]: Abstraction has 822 states and 2840 transitions. [2025-04-13 18:36:01,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 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:36:01,676 INFO L278 IsEmpty]: Start isEmpty. Operand 822 states and 2840 transitions. [2025-04-13 18:36:01,678 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:36:01,678 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:36:01,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:36:01,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2025-04-13 18:36:01,878 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2025-04-13 18:36:01,878 INFO L403 AbstractCegarLoop]: === Iteration 81 === 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:36:01,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:36:01,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1614312011, now seen corresponding path program 49 times [2025-04-13 18:36:01,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:36:01,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565920675] [2025-04-13 18:36:01,879 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:36:01,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:36:01,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:36:01,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:36:01,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:36:01,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:36:03,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:36:03,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565920675] [2025-04-13 18:36:03,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565920675] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:36:03,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326852893] [2025-04-13 18:36:03,181 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:36:03,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:36:03,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:36:03,183 INFO L229 MonitoredProcess]: Starting monitored process 55 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:36:03,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-04-13 18:36:03,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:36:03,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:36:03,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:36:03,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:03,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 18:36:03,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:36:03,302 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:36:03,775 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:36:03,775 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 72 [2025-04-13 18:36:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:36:03,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:36:08,597 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 479 treesize of output 427 [2025-04-13 18:36:08,603 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:36:08,603 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 580 treesize of output 488 [2025-04-13 18:36:09,087 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 258 treesize of output 224 [2025-04-13 18:36:09,094 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:36:09,094 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 373 treesize of output 1 [2025-04-13 18:36:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:36:09,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326852893] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:36:09,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:36:09,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 37 [2025-04-13 18:36:09,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800746209] [2025-04-13 18:36:09,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:36:09,119 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:36:09,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:36:09,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:36:09,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1295, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:36:09,120 INFO L87 Difference]: Start difference. First operand 822 states and 2840 transitions. Second operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 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:36:19,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:36:19,120 INFO L93 Difference]: Finished difference Result 1204 states and 4031 transitions. [2025-04-13 18:36:19,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 18:36:19,120 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 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 25 [2025-04-13 18:36:19,120 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:36:19,122 INFO L225 Difference]: With dead ends: 1204 [2025-04-13 18:36:19,123 INFO L226 Difference]: Without dead ends: 1193 [2025-04-13 18:36:19,123 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1727 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=686, Invalid=5794, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 18:36:19,123 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 378 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3191 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:36:19,123 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 0 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3191 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-04-13 18:36:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-04-13 18:36:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 840. [2025-04-13 18:36:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 839 states have (on average 3.469606674612634) internal successors, (2911), 839 states have internal predecessors, (2911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:36:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 2911 transitions. [2025-04-13 18:36:19,134 INFO L79 Accepts]: Start accepts. Automaton has 840 states and 2911 transitions. Word has length 25 [2025-04-13 18:36:19,134 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:36:19,134 INFO L485 AbstractCegarLoop]: Abstraction has 840 states and 2911 transitions. [2025-04-13 18:36:19,134 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 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:36:19,134 INFO L278 IsEmpty]: Start isEmpty. Operand 840 states and 2911 transitions. [2025-04-13 18:36:19,135 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:36:19,135 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:36:19,135 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:36:19,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2025-04-13 18:36:19,335 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:36:19,336 INFO L403 AbstractCegarLoop]: === Iteration 82 === 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:36:19,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:36:19,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1867597281, now seen corresponding path program 50 times [2025-04-13 18:36:19,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:36:19,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984128746] [2025-04-13 18:36:19,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:36:19,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:36:19,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:36:19,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:36:19,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:36:19,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:36:19,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:36:19,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984128746] [2025-04-13 18:36:19,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984128746] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:36:19,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:36:19,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:36:19,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443393736] [2025-04-13 18:36:19,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:36:19,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:36:19,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:36:19,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:36:19,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:36:19,883 INFO L87 Difference]: Start difference. First operand 840 states and 2911 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:36:20,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:36:20,238 INFO L93 Difference]: Finished difference Result 916 states and 3159 transitions. [2025-04-13 18:36:20,238 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:36:20,238 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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 25 [2025-04-13 18:36:20,238 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:36:20,240 INFO L225 Difference]: With dead ends: 916 [2025-04-13 18:36:20,240 INFO L226 Difference]: Without dead ends: 910 [2025-04-13 18:36:20,240 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:36:20,241 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:36:20,241 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:36:20,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-04-13 18:36:20,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 838. [2025-04-13 18:36:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 3.4719235364396654) internal successors, (2906), 837 states have internal predecessors, (2906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:36:20,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 2906 transitions. [2025-04-13 18:36:20,250 INFO L79 Accepts]: Start accepts. Automaton has 838 states and 2906 transitions. Word has length 25 [2025-04-13 18:36:20,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:36:20,251 INFO L485 AbstractCegarLoop]: Abstraction has 838 states and 2906 transitions. [2025-04-13 18:36:20,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:36:20,251 INFO L278 IsEmpty]: Start isEmpty. Operand 838 states and 2906 transitions. [2025-04-13 18:36:20,252 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:36:20,252 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:36:20,252 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:36:20,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-04-13 18:36:20,252 INFO L403 AbstractCegarLoop]: === Iteration 83 === 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:36:20,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:36:20,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1437588493, now seen corresponding path program 51 times [2025-04-13 18:36:20,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:36:20,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135859544] [2025-04-13 18:36:20,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:36:20,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:36:20,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:36:20,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:36:20,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:36:20,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:36:20,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:36:20,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135859544] [2025-04-13 18:36:20,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135859544] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:36:20,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:36:20,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:36:20,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420203870] [2025-04-13 18:36:20,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:36:20,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:36:20,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:36:20,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:36:20,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:36:20,783 INFO L87 Difference]: Start difference. First operand 838 states and 2906 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:36:21,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:36:21,142 INFO L93 Difference]: Finished difference Result 926 states and 3194 transitions. [2025-04-13 18:36:21,143 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:36:21,143 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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 25 [2025-04-13 18:36:21,143 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:36:21,145 INFO L225 Difference]: With dead ends: 926 [2025-04-13 18:36:21,145 INFO L226 Difference]: Without dead ends: 920 [2025-04-13 18:36:21,145 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:36:21,145 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:36:21,145 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:36:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-04-13 18:36:21,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 832. [2025-04-13 18:36:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 831 states have (on average 3.4620938628158844) internal successors, (2877), 831 states have internal predecessors, (2877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:36:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 2877 transitions. [2025-04-13 18:36:21,154 INFO L79 Accepts]: Start accepts. Automaton has 832 states and 2877 transitions. Word has length 25 [2025-04-13 18:36:21,154 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:36:21,155 INFO L485 AbstractCegarLoop]: Abstraction has 832 states and 2877 transitions. [2025-04-13 18:36:21,155 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:36:21,155 INFO L278 IsEmpty]: Start isEmpty. Operand 832 states and 2877 transitions. [2025-04-13 18:36:21,156 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:36:21,156 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:36:21,156 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:36:21,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-04-13 18:36:21,156 INFO L403 AbstractCegarLoop]: === Iteration 84 === 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:36:21,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:36:21,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2061152825, now seen corresponding path program 52 times [2025-04-13 18:36:21,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:36:21,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165081365] [2025-04-13 18:36:21,156 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:36:21,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:36:21,160 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:36:21,164 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:36:21,164 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:36:21,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:36:21,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:36:21,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165081365] [2025-04-13 18:36:21,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165081365] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:36:21,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:36:21,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:36:21,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501771620] [2025-04-13 18:36:21,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:36:21,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:36:21,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:36:21,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:36:21,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:36:21,722 INFO L87 Difference]: Start difference. First operand 832 states and 2877 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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:36:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:36:22,165 INFO L93 Difference]: Finished difference Result 902 states and 3090 transitions. [2025-04-13 18:36:22,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:36:22,165 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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 25 [2025-04-13 18:36:22,165 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:36:22,168 INFO L225 Difference]: With dead ends: 902 [2025-04-13 18:36:22,168 INFO L226 Difference]: Without dead ends: 896 [2025-04-13 18:36:22,168 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:36:22,168 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:36:22,168 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:36:22,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-04-13 18:36:22,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 832. [2025-04-13 18:36:22,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 831 states have (on average 3.4620938628158844) internal successors, (2877), 831 states have internal predecessors, (2877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:36:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 2877 transitions. [2025-04-13 18:36:22,177 INFO L79 Accepts]: Start accepts. Automaton has 832 states and 2877 transitions. Word has length 25 [2025-04-13 18:36:22,177 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:36:22,177 INFO L485 AbstractCegarLoop]: Abstraction has 832 states and 2877 transitions. [2025-04-13 18:36:22,177 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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:36:22,177 INFO L278 IsEmpty]: Start isEmpty. Operand 832 states and 2877 transitions. [2025-04-13 18:36:22,178 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:36:22,178 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:36:22,178 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:36:22,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-04-13 18:36:22,179 INFO L403 AbstractCegarLoop]: === Iteration 85 === 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:36:22,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:36:22,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1167018943, now seen corresponding path program 53 times [2025-04-13 18:36:22,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:36:22,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344192370] [2025-04-13 18:36:22,179 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:36:22,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:36:22,182 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:36:22,188 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:36:22,188 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:36:22,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:36:22,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:36:22,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344192370] [2025-04-13 18:36:22,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344192370] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:36:22,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264972404] [2025-04-13 18:36:22,812 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:36:22,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:36:22,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:36:22,814 INFO L229 MonitoredProcess]: Starting monitored process 56 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:36:22,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-04-13 18:36:22,876 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:36:22,889 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:36:22,889 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:36:22,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:22,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:36:22,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:36:23,357 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:36:23,357 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 72 [2025-04-13 18:36:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:36:23,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:36:25,561 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:36:25,562 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 549 treesize of output 263 [2025-04-13 18:36:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:36:27,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264972404] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:36:27,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:36:27,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 12] total 34 [2025-04-13 18:36:27,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715828318] [2025-04-13 18:36:27,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:36:27,428 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:36:27,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:36:27,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:36:27,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1120, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:36:27,429 INFO L87 Difference]: Start difference. First operand 832 states and 2877 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 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:36:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:36:29,570 INFO L93 Difference]: Finished difference Result 970 states and 3363 transitions. [2025-04-13 18:36:29,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:36:29,570 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 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 25 [2025-04-13 18:36:29,570 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:36:29,572 INFO L225 Difference]: With dead ends: 970 [2025-04-13 18:36:29,572 INFO L226 Difference]: Without dead ends: 964 [2025-04-13 18:36:29,572 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=189, Invalid=1617, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:36:29,572 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:36:29,572 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:36:29,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2025-04-13 18:36:29,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 836. [2025-04-13 18:36:29,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 835 states have (on average 3.467065868263473) internal successors, (2895), 835 states have internal predecessors, (2895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:36:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 2895 transitions. [2025-04-13 18:36:29,590 INFO L79 Accepts]: Start accepts. Automaton has 836 states and 2895 transitions. Word has length 25 [2025-04-13 18:36:29,590 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:36:29,590 INFO L485 AbstractCegarLoop]: Abstraction has 836 states and 2895 transitions. [2025-04-13 18:36:29,590 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 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:36:29,590 INFO L278 IsEmpty]: Start isEmpty. Operand 836 states and 2895 transitions. [2025-04-13 18:36:29,592 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:36:29,592 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:36:29,592 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:36:29,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2025-04-13 18:36:29,792 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:36:29,792 INFO L403 AbstractCegarLoop]: === Iteration 86 === 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:36:29,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:36:29,792 INFO L85 PathProgramCache]: Analyzing trace with hash 344593057, now seen corresponding path program 54 times [2025-04-13 18:36:29,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:36:29,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837101578] [2025-04-13 18:36:29,793 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:36:29,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:36:29,796 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:36:29,800 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:36:29,800 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:36:29,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:36:30,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:36:30,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837101578] [2025-04-13 18:36:30,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837101578] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:36:30,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:36:30,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:36:30,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685369100] [2025-04-13 18:36:30,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:36:30,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:36:30,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:36:30,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:36:30,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:36:30,801 INFO L87 Difference]: Start difference. First operand 836 states and 2895 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:36:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:36:31,149 INFO L93 Difference]: Finished difference Result 902 states and 3112 transitions. [2025-04-13 18:36:31,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:36:31,150 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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 25 [2025-04-13 18:36:31,150 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:36:31,152 INFO L225 Difference]: With dead ends: 902 [2025-04-13 18:36:31,152 INFO L226 Difference]: Without dead ends: 896 [2025-04-13 18:36:31,152 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:36:31,152 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:36:31,152 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:36:31,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-04-13 18:36:31,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 832. [2025-04-13 18:36:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 831 states have (on average 3.459687123947052) internal successors, (2875), 831 states have internal predecessors, (2875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:36:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 2875 transitions. [2025-04-13 18:36:31,162 INFO L79 Accepts]: Start accepts. Automaton has 832 states and 2875 transitions. Word has length 25 [2025-04-13 18:36:31,162 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:36:31,162 INFO L485 AbstractCegarLoop]: Abstraction has 832 states and 2875 transitions. [2025-04-13 18:36:31,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:36:31,162 INFO L278 IsEmpty]: Start isEmpty. Operand 832 states and 2875 transitions. [2025-04-13 18:36:31,163 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:36:31,163 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:36:31,163 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:36:31,163 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2025-04-13 18:36:31,163 INFO L403 AbstractCegarLoop]: === Iteration 87 === 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:36:31,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:36:31,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1067088551, now seen corresponding path program 55 times [2025-04-13 18:36:31,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:36:31,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747853121] [2025-04-13 18:36:31,164 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:36:31,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:36:31,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:36:31,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:36:31,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:36:31,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:32,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:36:32,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:36:32,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747853121] [2025-04-13 18:36:32,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747853121] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:36:32,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266302140] [2025-04-13 18:36:32,522 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:36:32,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:36:32,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:36:32,523 INFO L229 MonitoredProcess]: Starting monitored process 57 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:36:32,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-04-13 18:36:32,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:36:32,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:36:32,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:36:32,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:32,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:36:32,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:36:32,645 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 19 treesize of output 1 [2025-04-13 18:36:33,071 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:36:33,071 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 132 treesize of output 72 [2025-04-13 18:36:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:36:33,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:36:37,102 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 538 treesize of output 476 [2025-04-13 18:36:37,109 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:36:37,109 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 666 treesize of output 548 [2025-04-13 18:36:37,833 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 258 treesize of output 224 [2025-04-13 18:36:37,839 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:36:37,839 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 373 treesize of output 1 [2025-04-13 18:36:37,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:36:37,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266302140] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:36:37,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:36:37,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 36 [2025-04-13 18:36:37,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650117056] [2025-04-13 18:36:37,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:36:37,864 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:36:37,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:36:37,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:36:37,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:36:37,865 INFO L87 Difference]: Start difference. First operand 832 states and 2875 transitions. Second operand has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 37 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:36:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:36:43,840 INFO L93 Difference]: Finished difference Result 1195 states and 4103 transitions. [2025-04-13 18:36:43,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 18:36:43,840 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 37 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 25 [2025-04-13 18:36:43,840 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:36:43,843 INFO L225 Difference]: With dead ends: 1195 [2025-04-13 18:36:43,843 INFO L226 Difference]: Without dead ends: 1184 [2025-04-13 18:36:43,843 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=505, Invalid=3917, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 18:36:43,843 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 276 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2928 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:36:43,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 0 Invalid, 2987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2928 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-04-13 18:36:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2025-04-13 18:36:43,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 830. [2025-04-13 18:36:43,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 3.457177322074789) internal successors, (2866), 829 states have internal predecessors, (2866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:36:43,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2866 transitions. [2025-04-13 18:36:43,854 INFO L79 Accepts]: Start accepts. Automaton has 830 states and 2866 transitions. Word has length 25 [2025-04-13 18:36:43,854 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:36:43,854 INFO L485 AbstractCegarLoop]: Abstraction has 830 states and 2866 transitions. [2025-04-13 18:36:43,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 37 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:36:43,854 INFO L278 IsEmpty]: Start isEmpty. Operand 830 states and 2866 transitions. [2025-04-13 18:36:43,855 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:36:43,855 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:36:43,855 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:36:43,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2025-04-13 18:36:44,056 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:36:44,056 INFO L403 AbstractCegarLoop]: === Iteration 88 === 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:36:44,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:36:44,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1794075553, now seen corresponding path program 56 times [2025-04-13 18:36:44,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:36:44,056 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976404684] [2025-04-13 18:36:44,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:36:44,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:36:44,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:36:44,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:36:44,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:36:44,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:44,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:36:44,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:36:44,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976404684] [2025-04-13 18:36:44,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976404684] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:36:44,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066458167] [2025-04-13 18:36:44,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:36:44,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:36:44,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:36:44,645 INFO L229 MonitoredProcess]: Starting monitored process 58 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:36:44,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-04-13 18:36:44,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:36:44,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:36:44,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:36:44,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:44,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 18:36:44,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:36:45,120 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:36:45,121 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 88 [2025-04-13 18:36:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:36:45,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:36:47,043 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:36:47,043 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 503 treesize of output 223 [2025-04-13 18:36:48,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:36:48,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066458167] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:36:48,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:36:48,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 18:36:48,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833512792] [2025-04-13 18:36:48,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:36:48,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:36:48,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:36:48,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:36:48,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:36:48,008 INFO L87 Difference]: Start difference. First operand 830 states and 2866 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:36:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:36:57,191 INFO L93 Difference]: Finished difference Result 1367 states and 4582 transitions. [2025-04-13 18:36:57,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-04-13 18:36:57,191 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 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:36:57,191 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:36:57,194 INFO L225 Difference]: With dead ends: 1367 [2025-04-13 18:36:57,194 INFO L226 Difference]: Without dead ends: 1356 [2025-04-13 18:36:57,194 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3104 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1533, Invalid=7973, Unknown=0, NotChecked=0, Total=9506 [2025-04-13 18:36:57,194 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 323 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2528 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:36:57,194 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 0 Invalid, 2617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2528 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 18:36:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-04-13 18:36:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 834. [2025-04-13 18:36:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 833 states have (on average 3.458583433373349) internal successors, (2881), 833 states have internal predecessors, (2881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:36:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 2881 transitions. [2025-04-13 18:36:57,205 INFO L79 Accepts]: Start accepts. Automaton has 834 states and 2881 transitions. Word has length 25 [2025-04-13 18:36:57,205 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:36:57,205 INFO L485 AbstractCegarLoop]: Abstraction has 834 states and 2881 transitions. [2025-04-13 18:36:57,205 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:36:57,205 INFO L278 IsEmpty]: Start isEmpty. Operand 834 states and 2881 transitions. [2025-04-13 18:36:57,206 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:36:57,206 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:36:57,206 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:36:57,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2025-04-13 18:36:57,407 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2025-04-13 18:36:57,407 INFO L403 AbstractCegarLoop]: === Iteration 89 === 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:36:57,407 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:36:57,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1681679373, now seen corresponding path program 57 times [2025-04-13 18:36:57,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:36:57,407 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907619176] [2025-04-13 18:36:57,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:36:57,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:36:57,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:36:57,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:36:57,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:36:57,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:36:58,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:36:58,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907619176] [2025-04-13 18:36:58,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907619176] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:36:58,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257896735] [2025-04-13 18:36:58,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:36:58,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:36:58,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:36:58,379 INFO L229 MonitoredProcess]: Starting monitored process 59 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:36:58,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-04-13 18:36:58,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:36:58,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:36:58,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:36:58,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:36:58,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:36:58,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:36:59,026 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:36:59,027 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 88 [2025-04-13 18:36:59,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:36:59,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:37:01,266 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:37:01,267 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 413 treesize of output 217 [2025-04-13 18:37:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:37:01,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257896735] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:37:01,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:37:01,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 36 [2025-04-13 18:37:01,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030605974] [2025-04-13 18:37:01,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:37:01,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:37:01,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:37:01,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:37:01,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1263, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:37:01,902 INFO L87 Difference]: Start difference. First operand 834 states and 2881 transitions. Second operand has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:37:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:37:06,391 INFO L93 Difference]: Finished difference Result 1093 states and 3725 transitions. [2025-04-13 18:37:06,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 18:37:06,391 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 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:37:06,391 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:37:06,393 INFO L225 Difference]: With dead ends: 1093 [2025-04-13 18:37:06,394 INFO L226 Difference]: Without dead ends: 1082 [2025-04-13 18:37:06,394 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=407, Invalid=4285, Unknown=0, NotChecked=0, Total=4692 [2025-04-13 18:37:06,394 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 291 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2687 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:37:06,394 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 0 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2687 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 18:37:06,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2025-04-13 18:37:06,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 836. [2025-04-13 18:37:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 835 states have (on average 3.461077844311377) internal successors, (2890), 835 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:37:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 2890 transitions. [2025-04-13 18:37:06,404 INFO L79 Accepts]: Start accepts. Automaton has 836 states and 2890 transitions. Word has length 25 [2025-04-13 18:37:06,404 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:37:06,404 INFO L485 AbstractCegarLoop]: Abstraction has 836 states and 2890 transitions. [2025-04-13 18:37:06,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:37:06,404 INFO L278 IsEmpty]: Start isEmpty. Operand 836 states and 2890 transitions. [2025-04-13 18:37:06,405 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:37:06,405 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:37:06,405 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:37:06,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2025-04-13 18:37:06,605 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2025-04-13 18:37:06,606 INFO L403 AbstractCegarLoop]: === Iteration 90 === 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:37:06,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:37:06,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1324232093, now seen corresponding path program 58 times [2025-04-13 18:37:06,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:37:06,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984857226] [2025-04-13 18:37:06,606 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:37:06,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:37:06,610 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:37:06,615 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:37:06,615 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:37:06,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:37:07,357 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:37:07,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:37:07,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984857226] [2025-04-13 18:37:07,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984857226] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:37:07,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88516937] [2025-04-13 18:37:07,357 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:37:07,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:37:07,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:37:07,359 INFO L229 MonitoredProcess]: Starting monitored process 60 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:37:07,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-04-13 18:37:07,420 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:37:07,433 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:37:07,434 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:37:07,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:37:07,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:37:07,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:37:07,841 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:37:07,841 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 72 [2025-04-13 18:37:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:37:07,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:37:09,767 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:37:09,768 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 981 treesize of output 449 [2025-04-13 18:37:15,000 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:37:15,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88516937] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:37:15,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:37:15,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 32 [2025-04-13 18:37:15,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557230633] [2025-04-13 18:37:15,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:37:15,000 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:37:15,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:37:15,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:37:15,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:37:15,001 INFO L87 Difference]: Start difference. First operand 836 states and 2890 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:37:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:37:20,280 INFO L93 Difference]: Finished difference Result 1085 states and 3562 transitions. [2025-04-13 18:37:20,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 18:37:20,280 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:37:20,281 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:37:20,283 INFO L225 Difference]: With dead ends: 1085 [2025-04-13 18:37:20,283 INFO L226 Difference]: Without dead ends: 1064 [2025-04-13 18:37:20,284 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1531 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=558, Invalid=4992, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 18:37:20,284 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 200 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2626 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:37:20,284 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 0 Invalid, 2667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2626 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 18:37:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2025-04-13 18:37:20,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 842. [2025-04-13 18:37:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 3.463733650416171) internal successors, (2913), 841 states have internal predecessors, (2913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:37:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 2913 transitions. [2025-04-13 18:37:20,294 INFO L79 Accepts]: Start accepts. Automaton has 842 states and 2913 transitions. Word has length 25 [2025-04-13 18:37:20,294 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:37:20,295 INFO L485 AbstractCegarLoop]: Abstraction has 842 states and 2913 transitions. [2025-04-13 18:37:20,295 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:37:20,295 INFO L278 IsEmpty]: Start isEmpty. Operand 842 states and 2913 transitions. [2025-04-13 18:37:20,296 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:37:20,296 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:37:20,296 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:37:20,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2025-04-13 18:37:20,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2025-04-13 18:37:20,497 INFO L403 AbstractCegarLoop]: === Iteration 91 === 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:37:20,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:37:20,497 INFO L85 PathProgramCache]: Analyzing trace with hash 863240771, now seen corresponding path program 59 times [2025-04-13 18:37:20,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:37:20,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653724921] [2025-04-13 18:37:20,497 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:37:20,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:37:20,501 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:37:20,505 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:37:20,505 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:37:20,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:37:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:37:21,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:37:21,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653724921] [2025-04-13 18:37:21,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653724921] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:37:21,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415645601] [2025-04-13 18:37:21,229 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:37:21,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:37:21,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:37:21,230 INFO L229 MonitoredProcess]: Starting monitored process 61 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:37:21,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2025-04-13 18:37:21,294 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:37:21,307 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:37:21,308 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:37:21,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:37:21,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:37:21,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:37:21,832 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:37:21,832 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 72 [2025-04-13 18:37:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:37:21,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:37:24,142 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:37:24,142 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 553 treesize of output 271 [2025-04-13 18:37:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:37:26,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415645601] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:37:26,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:37:26,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 12] total 34 [2025-04-13 18:37:26,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328001657] [2025-04-13 18:37:26,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:37:26,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:37:26,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:37:26,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:37:26,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1143, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:37:26,096 INFO L87 Difference]: Start difference. First operand 842 states and 2913 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 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:37:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:37:27,928 INFO L93 Difference]: Finished difference Result 930 states and 3178 transitions. [2025-04-13 18:37:27,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:37:27,929 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 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 25 [2025-04-13 18:37:27,929 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:37:27,931 INFO L225 Difference]: With dead ends: 930 [2025-04-13 18:37:27,931 INFO L226 Difference]: Without dead ends: 924 [2025-04-13 18:37:27,931 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=170, Invalid=1722, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 18:37:27,931 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:37:27,931 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:37:27,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2025-04-13 18:37:27,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 846. [2025-04-13 18:37:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 845 states have (on average 3.4662721893491124) internal successors, (2929), 845 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:37:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 2929 transitions. [2025-04-13 18:37:27,943 INFO L79 Accepts]: Start accepts. Automaton has 846 states and 2929 transitions. Word has length 25 [2025-04-13 18:37:27,943 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:37:27,943 INFO L485 AbstractCegarLoop]: Abstraction has 846 states and 2929 transitions. [2025-04-13 18:37:27,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 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:37:27,943 INFO L278 IsEmpty]: Start isEmpty. Operand 846 states and 2929 transitions. [2025-04-13 18:37:27,944 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:37:27,944 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:37:27,944 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:37:27,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2025-04-13 18:37:28,145 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:37:28,145 INFO L403 AbstractCegarLoop]: === Iteration 92 === 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:37:28,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:37:28,145 INFO L85 PathProgramCache]: Analyzing trace with hash -568758561, now seen corresponding path program 60 times [2025-04-13 18:37:28,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:37:28,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925895678] [2025-04-13 18:37:28,145 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:37:28,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:37:28,155 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:37:28,160 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:37:28,161 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:37:28,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:37:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:37:28,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:37:28,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925895678] [2025-04-13 18:37:28,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925895678] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:37:28,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717622454] [2025-04-13 18:37:28,779 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:37:28,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:37:28,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:37:28,781 INFO L229 MonitoredProcess]: Starting monitored process 62 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:37:28,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-04-13 18:37:28,855 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:37:28,868 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:37:28,868 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:37:28,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:37:28,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:37:28,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:37:29,337 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:37:29,338 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 88 [2025-04-13 18:37:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:37:29,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:37:30,455 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:37:30,456 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 605 treesize of output 283 [2025-04-13 18:37:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:37:34,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717622454] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:37:34,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:37:34,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 18:37:34,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459924683] [2025-04-13 18:37:34,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:37:34,516 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:37:34,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:37:34,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:37:34,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:37:34,516 INFO L87 Difference]: Start difference. First operand 846 states and 2929 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 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:37:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:37:40,071 INFO L93 Difference]: Finished difference Result 1165 states and 3862 transitions. [2025-04-13 18:37:40,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 18:37:40,072 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 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 25 [2025-04-13 18:37:40,072 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:37:40,074 INFO L225 Difference]: With dead ends: 1165 [2025-04-13 18:37:40,074 INFO L226 Difference]: Without dead ends: 1139 [2025-04-13 18:37:40,074 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1678 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=783, Invalid=5379, Unknown=0, NotChecked=0, Total=6162 [2025-04-13 18:37:40,075 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 236 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:37:40,075 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 0 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2069 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:37:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2025-04-13 18:37:40,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 858. [2025-04-13 18:37:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 857 states have (on average 3.4947491248541422) internal successors, (2995), 857 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:37:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 2995 transitions. [2025-04-13 18:37:40,085 INFO L79 Accepts]: Start accepts. Automaton has 858 states and 2995 transitions. Word has length 25 [2025-04-13 18:37:40,085 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:37:40,085 INFO L485 AbstractCegarLoop]: Abstraction has 858 states and 2995 transitions. [2025-04-13 18:37:40,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 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:37:40,085 INFO L278 IsEmpty]: Start isEmpty. Operand 858 states and 2995 transitions. [2025-04-13 18:37:40,086 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:37:40,086 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:37:40,086 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:37:40,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2025-04-13 18:37:40,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:37:40,287 INFO L403 AbstractCegarLoop]: === Iteration 93 === 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:37:40,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:37:40,287 INFO L85 PathProgramCache]: Analyzing trace with hash 689993079, now seen corresponding path program 61 times [2025-04-13 18:37:40,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:37:40,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827569681] [2025-04-13 18:37:40,287 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:37:40,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:37:40,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:37:40,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:37:40,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:37:40,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:37:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:37:41,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:37:41,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827569681] [2025-04-13 18:37:41,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827569681] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:37:41,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803345378] [2025-04-13 18:37:41,184 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:37:41,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:37:41,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:37:41,186 INFO L229 MonitoredProcess]: Starting monitored process 63 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:37:41,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2025-04-13 18:37:41,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:37:41,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:37:41,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:37:41,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:37:41,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:37:41,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:37:41,305 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 19 treesize of output 1 [2025-04-13 18:37:41,742 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:37:41,743 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 132 treesize of output 72 [2025-04-13 18:37:41,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:37:41,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:37:45,650 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 451 treesize of output 401 [2025-04-13 18:37:45,655 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:37:45,655 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 546 treesize of output 462 [2025-04-13 18:37:46,269 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 246 treesize of output 214 [2025-04-13 18:37:46,275 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:37:46,275 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 360 treesize of output 1 [2025-04-13 18:37:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:37:46,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803345378] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:37:46,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:37:46,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 36 [2025-04-13 18:37:46,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113085754] [2025-04-13 18:37:46,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:37:46,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:37:46,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:37:46,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:37:46,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1246, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:37:46,294 INFO L87 Difference]: Start difference. First operand 858 states and 2995 transitions. Second operand has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 37 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:37:56,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:37:56,072 INFO L93 Difference]: Finished difference Result 1317 states and 4451 transitions. [2025-04-13 18:37:56,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-13 18:37:56,073 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 37 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 25 [2025-04-13 18:37:56,073 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:37:56,075 INFO L225 Difference]: With dead ends: 1317 [2025-04-13 18:37:56,075 INFO L226 Difference]: Without dead ends: 1306 [2025-04-13 18:37:56,076 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=655, Invalid=5507, Unknown=0, NotChecked=0, Total=6162 [2025-04-13 18:37:56,076 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 386 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3184 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 3184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:37:56,076 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 0 Invalid, 3264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 3184 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-04-13 18:37:56,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2025-04-13 18:37:56,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 880. [2025-04-13 18:37:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 3.5130830489192264) internal successors, (3088), 879 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:37:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 3088 transitions. [2025-04-13 18:37:56,088 INFO L79 Accepts]: Start accepts. Automaton has 880 states and 3088 transitions. Word has length 25 [2025-04-13 18:37:56,088 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:37:56,088 INFO L485 AbstractCegarLoop]: Abstraction has 880 states and 3088 transitions. [2025-04-13 18:37:56,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 37 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:37:56,088 INFO L278 IsEmpty]: Start isEmpty. Operand 880 states and 3088 transitions. [2025-04-13 18:37:56,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:37:56,089 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:37:56,089 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:37:56,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2025-04-13 18:37:56,290 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:37:56,290 INFO L403 AbstractCegarLoop]: === Iteration 94 === 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:37:56,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:37:56,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1142390657, now seen corresponding path program 62 times [2025-04-13 18:37:56,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:37:56,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150435965] [2025-04-13 18:37:56,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:37:56,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:37:56,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:37:56,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:37:56,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:37:56,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:37:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:37:57,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:37:57,326 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150435965] [2025-04-13 18:37:57,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150435965] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:37:57,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:37:57,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:37:57,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65003027] [2025-04-13 18:37:57,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:37:57,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:37:57,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:37:57,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:37:57,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:37:57,326 INFO L87 Difference]: Start difference. First operand 880 states and 3088 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:37:57,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:37:57,744 INFO L93 Difference]: Finished difference Result 928 states and 3220 transitions. [2025-04-13 18:37:57,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:37:57,744 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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 25 [2025-04-13 18:37:57,745 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:37:57,746 INFO L225 Difference]: With dead ends: 928 [2025-04-13 18:37:57,746 INFO L226 Difference]: Without dead ends: 922 [2025-04-13 18:37:57,747 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:37:57,747 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:37:57,747 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:37:57,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-04-13 18:37:57,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 874. [2025-04-13 18:37:57,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 3.506300114547537) internal successors, (3061), 873 states have internal predecessors, (3061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:37:57,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 3061 transitions. [2025-04-13 18:37:57,756 INFO L79 Accepts]: Start accepts. Automaton has 874 states and 3061 transitions. Word has length 25 [2025-04-13 18:37:57,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:37:57,756 INFO L485 AbstractCegarLoop]: Abstraction has 874 states and 3061 transitions. [2025-04-13 18:37:57,756 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:37:57,756 INFO L278 IsEmpty]: Start isEmpty. Operand 874 states and 3061 transitions. [2025-04-13 18:37:57,757 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:37:57,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:37:57,757 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:37:57,757 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-04-13 18:37:57,758 INFO L403 AbstractCegarLoop]: === Iteration 95 === 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:37:57,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:37:57,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1638713981, now seen corresponding path program 63 times [2025-04-13 18:37:57,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:37:57,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437296116] [2025-04-13 18:37:57,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:37:57,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:37:57,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:37:57,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:37:57,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:37:57,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:37:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:37:58,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:37:58,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437296116] [2025-04-13 18:37:58,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437296116] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:37:58,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535549191] [2025-04-13 18:37:58,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:37:58,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:37:58,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:37:58,452 INFO L229 MonitoredProcess]: Starting monitored process 64 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:37:58,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2025-04-13 18:37:58,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:37:58,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:37:58,533 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:37:58,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:37:58,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:37:58,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:37:58,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:37:58,948 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:37:58,948 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 88 [2025-04-13 18:37:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:37:59,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:38:01,542 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:38:01,543 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 413 treesize of output 217 [2025-04-13 18:38:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:38:02,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535549191] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:38:02,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:38:02,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 18:38:02,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748331231] [2025-04-13 18:38:02,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:38:02,189 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:38:02,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:38:02,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:38:02,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:38:02,190 INFO L87 Difference]: Start difference. First operand 874 states and 3061 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:38:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:38:11,220 INFO L93 Difference]: Finished difference Result 1230 states and 4238 transitions. [2025-04-13 18:38:11,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-13 18:38:11,220 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 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:38:11,220 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:38:11,222 INFO L225 Difference]: With dead ends: 1230 [2025-04-13 18:38:11,223 INFO L226 Difference]: Without dead ends: 1224 [2025-04-13 18:38:11,223 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1939 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=751, Invalid=6221, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 18:38:11,223 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2882 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:38:11,223 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 3007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2882 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 18:38:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2025-04-13 18:38:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 878. [2025-04-13 18:38:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 3.517673888255416) internal successors, (3085), 877 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:38:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 3085 transitions. [2025-04-13 18:38:11,234 INFO L79 Accepts]: Start accepts. Automaton has 878 states and 3085 transitions. Word has length 25 [2025-04-13 18:38:11,234 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:38:11,234 INFO L485 AbstractCegarLoop]: Abstraction has 878 states and 3085 transitions. [2025-04-13 18:38:11,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:38:11,234 INFO L278 IsEmpty]: Start isEmpty. Operand 878 states and 3085 transitions. [2025-04-13 18:38:11,235 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:38:11,235 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:38:11,235 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:38:11,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2025-04-13 18:38:11,436 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:38:11,436 INFO L403 AbstractCegarLoop]: === Iteration 96 === 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:38:11,436 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:38:11,436 INFO L85 PathProgramCache]: Analyzing trace with hash -790342561, now seen corresponding path program 64 times [2025-04-13 18:38:11,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:38:11,436 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743332283] [2025-04-13 18:38:11,436 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:38:11,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:38:11,440 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:38:11,446 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:38:11,446 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:38:11,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:38:12,564 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:38:12,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:38:12,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743332283] [2025-04-13 18:38:12,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743332283] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:38:12,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125042829] [2025-04-13 18:38:12,565 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:38:12,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:38:12,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:38:12,566 INFO L229 MonitoredProcess]: Starting monitored process 65 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:38:12,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2025-04-13 18:38:12,632 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:38:12,646 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:38:12,646 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:38:12,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:38:12,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:38:12,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:38:13,074 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:38:13,074 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 72 [2025-04-13 18:38:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:38:13,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:38:14,067 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:38:14,067 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 605 treesize of output 273 [2025-04-13 18:38:17,043 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:38:17,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125042829] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:38:17,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:38:17,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 32 [2025-04-13 18:38:17,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548987844] [2025-04-13 18:38:17,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:38:17,044 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:38:17,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:38:17,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:38:17,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:38:17,044 INFO L87 Difference]: Start difference. First operand 878 states and 3085 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:38:20,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:38:20,551 INFO L93 Difference]: Finished difference Result 1057 states and 3596 transitions. [2025-04-13 18:38:20,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 18:38:20,552 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:38:20,552 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:38:20,554 INFO L225 Difference]: With dead ends: 1057 [2025-04-13 18:38:20,554 INFO L226 Difference]: Without dead ends: 1046 [2025-04-13 18:38:20,554 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=399, Invalid=3383, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 18:38:20,555 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 168 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:38:20,555 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 0 Invalid, 2481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:38:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-04-13 18:38:20,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 884. [2025-04-13 18:38:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.5152887882219708) internal successors, (3104), 883 states have internal predecessors, (3104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:38:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3104 transitions. [2025-04-13 18:38:20,565 INFO L79 Accepts]: Start accepts. Automaton has 884 states and 3104 transitions. Word has length 25 [2025-04-13 18:38:20,565 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:38:20,565 INFO L485 AbstractCegarLoop]: Abstraction has 884 states and 3104 transitions. [2025-04-13 18:38:20,565 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:38:20,565 INFO L278 IsEmpty]: Start isEmpty. Operand 884 states and 3104 transitions. [2025-04-13 18:38:20,566 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:38:20,566 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:38:20,566 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:38:20,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2025-04-13 18:38:20,767 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:38:20,767 INFO L403 AbstractCegarLoop]: === Iteration 97 === 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:38:20,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:38:20,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1305651775, now seen corresponding path program 65 times [2025-04-13 18:38:20,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:38:20,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291276966] [2025-04-13 18:38:20,767 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:38:20,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:38:20,771 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:38:20,777 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:38:20,777 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:38:20,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:38:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:38:21,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:38:21,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291276966] [2025-04-13 18:38:21,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291276966] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:38:21,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265060465] [2025-04-13 18:38:21,407 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:38:21,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:38:21,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:38:21,409 INFO L229 MonitoredProcess]: Starting monitored process 66 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:38:21,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-04-13 18:38:21,473 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:38:21,486 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:38:21,486 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:38:21,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:38:21,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:38:21,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:38:21,808 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-13 18:38:21,808 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 138 treesize of output 80 [2025-04-13 18:38:22,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:38:22,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:38:24,132 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:38:24,133 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 545 treesize of output 263 [2025-04-13 18:38:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:38:25,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265060465] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:38:25,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:38:25,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 28 [2025-04-13 18:38:25,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743314210] [2025-04-13 18:38:25,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:38:25,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 18:38:25,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:38:25,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 18:38:25,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:38:25,910 INFO L87 Difference]: Start difference. First operand 884 states and 3104 transitions. Second operand has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 29 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:38:31,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:38:31,247 INFO L93 Difference]: Finished difference Result 1357 states and 4648 transitions. [2025-04-13 18:38:31,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 18:38:31,247 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 29 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 25 [2025-04-13 18:38:31,247 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:38:31,249 INFO L225 Difference]: With dead ends: 1357 [2025-04-13 18:38:31,249 INFO L226 Difference]: Without dead ends: 1346 [2025-04-13 18:38:31,250 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=445, Invalid=3215, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 18:38:31,250 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 267 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3004 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:38:31,250 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 0 Invalid, 3066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 3004 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 18:38:31,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2025-04-13 18:38:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 902. [2025-04-13 18:38:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 3.5016648168701443) internal successors, (3155), 901 states have internal predecessors, (3155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:38:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 3155 transitions. [2025-04-13 18:38:31,262 INFO L79 Accepts]: Start accepts. Automaton has 902 states and 3155 transitions. Word has length 25 [2025-04-13 18:38:31,262 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:38:31,262 INFO L485 AbstractCegarLoop]: Abstraction has 902 states and 3155 transitions. [2025-04-13 18:38:31,262 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 29 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:38:31,262 INFO L278 IsEmpty]: Start isEmpty. Operand 902 states and 3155 transitions. [2025-04-13 18:38:31,263 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:38:31,263 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:38:31,263 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:38:31,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2025-04-13 18:38:31,463 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable96 [2025-04-13 18:38:31,463 INFO L403 AbstractCegarLoop]: === Iteration 98 === 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:38:31,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:38:31,464 INFO L85 PathProgramCache]: Analyzing trace with hash -346961365, now seen corresponding path program 66 times [2025-04-13 18:38:31,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:38:31,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963168779] [2025-04-13 18:38:31,464 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:38:31,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:38:31,468 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:38:31,472 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:38:31,472 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:38:31,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:38:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:38:32,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:38:32,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963168779] [2025-04-13 18:38:32,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963168779] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:38:32,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:38:32,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:38:32,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402879935] [2025-04-13 18:38:32,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:38:32,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:38:32,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:38:32,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:38:32,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:38:32,588 INFO L87 Difference]: Start difference. First operand 902 states and 3155 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:38:32,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:38:32,986 INFO L93 Difference]: Finished difference Result 952 states and 3320 transitions. [2025-04-13 18:38:32,986 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:38:32,986 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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 25 [2025-04-13 18:38:32,986 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:38:32,988 INFO L225 Difference]: With dead ends: 952 [2025-04-13 18:38:32,988 INFO L226 Difference]: Without dead ends: 946 [2025-04-13 18:38:32,989 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:38:32,989 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:38:32,989 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:38:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-04-13 18:38:32,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 906. [2025-04-13 18:38:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 905 states have (on average 3.5060773480662983) internal successors, (3173), 905 states have internal predecessors, (3173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:38:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 3173 transitions. [2025-04-13 18:38:32,998 INFO L79 Accepts]: Start accepts. Automaton has 906 states and 3173 transitions. Word has length 25 [2025-04-13 18:38:32,999 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:38:32,999 INFO L485 AbstractCegarLoop]: Abstraction has 906 states and 3173 transitions. [2025-04-13 18:38:32,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:38:32,999 INFO L278 IsEmpty]: Start isEmpty. Operand 906 states and 3173 transitions. [2025-04-13 18:38:33,000 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:38:33,000 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:38:33,000 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:38:33,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-04-13 18:38:33,000 INFO L403 AbstractCegarLoop]: === Iteration 99 === 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:38:33,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:38:33,000 INFO L85 PathProgramCache]: Analyzing trace with hash -18805939, now seen corresponding path program 67 times [2025-04-13 18:38:33,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:38:33,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104415242] [2025-04-13 18:38:33,000 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:38:33,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:38:33,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:38:33,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:38:33,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:38:33,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:38:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:38:33,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:38:33,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104415242] [2025-04-13 18:38:33,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104415242] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:38:33,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507391129] [2025-04-13 18:38:33,971 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:38:33,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:38:33,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:38:33,973 INFO L229 MonitoredProcess]: Starting monitored process 67 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:38:33,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-04-13 18:38:34,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:38:34,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:38:34,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:38:34,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:38:34,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 18:38:34,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:38:34,100 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:38:34,582 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:38:34,582 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 72 [2025-04-13 18:38:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:38:34,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:38:39,341 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 452 treesize of output 402 [2025-04-13 18:38:39,347 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:38:39,347 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 548 treesize of output 464 [2025-04-13 18:38:39,875 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 258 treesize of output 224 [2025-04-13 18:38:39,881 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:38:39,881 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 373 treesize of output 1 [2025-04-13 18:38:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:38:39,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507391129] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:38:39,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:38:39,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 37 [2025-04-13 18:38:39,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782965155] [2025-04-13 18:38:39,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:38:39,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:38:39,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:38:39,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:38:39,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1307, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:38:39,903 INFO L87 Difference]: Start difference. First operand 906 states and 3173 transitions. Second operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 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:38:46,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:38:46,223 INFO L93 Difference]: Finished difference Result 1186 states and 4085 transitions. [2025-04-13 18:38:46,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 18:38:46,223 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 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 25 [2025-04-13 18:38:46,223 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:38:46,226 INFO L225 Difference]: With dead ends: 1186 [2025-04-13 18:38:46,226 INFO L226 Difference]: Without dead ends: 1175 [2025-04-13 18:38:46,226 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=541, Invalid=4429, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 18:38:46,226 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 301 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2846 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:38:46,226 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 0 Invalid, 2909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2846 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 18:38:46,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-04-13 18:38:46,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 918. [2025-04-13 18:38:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 917 states have (on average 3.5016357688113415) internal successors, (3211), 917 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:38:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 3211 transitions. [2025-04-13 18:38:46,237 INFO L79 Accepts]: Start accepts. Automaton has 918 states and 3211 transitions. Word has length 25 [2025-04-13 18:38:46,237 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:38:46,237 INFO L485 AbstractCegarLoop]: Abstraction has 918 states and 3211 transitions. [2025-04-13 18:38:46,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 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:38:46,237 INFO L278 IsEmpty]: Start isEmpty. Operand 918 states and 3211 transitions. [2025-04-13 18:38:46,239 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:38:46,239 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:38:46,239 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:38:46,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2025-04-13 18:38:46,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2025-04-13 18:38:46,439 INFO L403 AbstractCegarLoop]: === Iteration 100 === 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:38:46,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:38:46,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1960876613, now seen corresponding path program 68 times [2025-04-13 18:38:46,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:38:46,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421136297] [2025-04-13 18:38:46,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:38:46,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:38:46,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:38:46,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:38:46,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:38:46,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:38:47,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:38:47,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:38:47,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421136297] [2025-04-13 18:38:47,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421136297] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:38:47,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191140176] [2025-04-13 18:38:47,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:38:47,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:38:47,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:38:47,407 INFO L229 MonitoredProcess]: Starting monitored process 68 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:38:47,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2025-04-13 18:38:47,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:38:47,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:38:47,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:38:47,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:38:47,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:38:47,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:38:47,977 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:38:47,977 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 88 [2025-04-13 18:38:48,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:38:48,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:38:49,266 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:38:49,267 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 605 treesize of output 283 [2025-04-13 18:38:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:38:53,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191140176] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:38:53,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:38:53,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 36 [2025-04-13 18:38:53,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967214394] [2025-04-13 18:38:53,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:38:53,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:38:53,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:38:53,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:38:53,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:38:53,105 INFO L87 Difference]: Start difference. First operand 918 states and 3211 transitions. Second operand has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:38:59,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:38:59,106 INFO L93 Difference]: Finished difference Result 1229 states and 4121 transitions. [2025-04-13 18:38:59,106 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 18:38:59,106 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 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:38:59,106 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:38:59,108 INFO L225 Difference]: With dead ends: 1229 [2025-04-13 18:38:59,108 INFO L226 Difference]: Without dead ends: 1208 [2025-04-13 18:38:59,109 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2050 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=830, Invalid=6652, Unknown=0, NotChecked=0, Total=7482 [2025-04-13 18:38:59,109 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 186 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2345 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:38:59,109 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 0 Invalid, 2437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2345 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 18:38:59,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2025-04-13 18:38:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 922. [2025-04-13 18:38:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 921 states have (on average 3.510314875135722) internal successors, (3233), 921 states have internal predecessors, (3233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:38:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 3233 transitions. [2025-04-13 18:38:59,121 INFO L79 Accepts]: Start accepts. Automaton has 922 states and 3233 transitions. Word has length 25 [2025-04-13 18:38:59,121 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:38:59,121 INFO L485 AbstractCegarLoop]: Abstraction has 922 states and 3233 transitions. [2025-04-13 18:38:59,121 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:38:59,121 INFO L278 IsEmpty]: Start isEmpty. Operand 922 states and 3233 transitions. [2025-04-13 18:38:59,122 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:38:59,122 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:38:59,122 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:38:59,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2025-04-13 18:38:59,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2025-04-13 18:38:59,322 INFO L403 AbstractCegarLoop]: === Iteration 101 === 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:38:59,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:38:59,323 INFO L85 PathProgramCache]: Analyzing trace with hash 260892809, now seen corresponding path program 69 times [2025-04-13 18:38:59,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:38:59,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073088050] [2025-04-13 18:38:59,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:38:59,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:38:59,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:38:59,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:38:59,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:38:59,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:00,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:39:00,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:39:00,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073088050] [2025-04-13 18:39:00,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073088050] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:39:00,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250278897] [2025-04-13 18:39:00,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:39:00,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:39:00,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:39:00,109 INFO L229 MonitoredProcess]: Starting monitored process 69 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:39:00,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-04-13 18:39:00,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:39:00,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:39:00,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:39:00,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:00,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:39:00,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:39:00,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:39:00,770 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:39:00,771 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 80 [2025-04-13 18:39:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:39:00,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:39:02,882 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:39:02,883 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 357 treesize of output 191 [2025-04-13 18:39:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:39:03,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250278897] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:39:03,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:39:03,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 18:39:03,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603081919] [2025-04-13 18:39:03,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:39:03,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:39:03,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:39:03,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:39:03,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:39:03,618 INFO L87 Difference]: Start difference. First operand 922 states and 3233 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 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:39:09,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:39:09,218 INFO L93 Difference]: Finished difference Result 1211 states and 4212 transitions. [2025-04-13 18:39:09,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 18:39:09,219 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 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 25 [2025-04-13 18:39:09,219 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:39:09,221 INFO L225 Difference]: With dead ends: 1211 [2025-04-13 18:39:09,221 INFO L226 Difference]: Without dead ends: 1195 [2025-04-13 18:39:09,222 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=641, Invalid=4615, Unknown=0, NotChecked=0, Total=5256 [2025-04-13 18:39:09,222 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 288 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:39:09,222 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 0 Invalid, 2294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 18:39:09,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2025-04-13 18:39:09,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 944. [2025-04-13 18:39:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 943 states have (on average 3.5026511134676563) internal successors, (3303), 943 states have internal predecessors, (3303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:39:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 3303 transitions. [2025-04-13 18:39:09,233 INFO L79 Accepts]: Start accepts. Automaton has 944 states and 3303 transitions. Word has length 25 [2025-04-13 18:39:09,233 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:39:09,233 INFO L485 AbstractCegarLoop]: Abstraction has 944 states and 3303 transitions. [2025-04-13 18:39:09,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 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:39:09,233 INFO L278 IsEmpty]: Start isEmpty. Operand 944 states and 3303 transitions. [2025-04-13 18:39:09,234 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:39:09,234 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:39:09,234 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:39:09,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2025-04-13 18:39:09,434 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2025-04-13 18:39:09,435 INFO L403 AbstractCegarLoop]: === Iteration 102 === 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:39:09,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:39:09,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2063521133, now seen corresponding path program 70 times [2025-04-13 18:39:09,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:39:09,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542093872] [2025-04-13 18:39:09,435 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:39:09,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:39:09,439 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:39:09,443 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:39:09,443 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:39:09,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:09,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:39:09,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:39:09,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542093872] [2025-04-13 18:39:09,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542093872] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:39:09,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440012169] [2025-04-13 18:39:09,923 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:39:09,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:39:09,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:39:09,925 INFO L229 MonitoredProcess]: Starting monitored process 70 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:39:09,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2025-04-13 18:39:09,995 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:39:10,009 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:39:10,009 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:39:10,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:10,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:39:10,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:39:10,382 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:39:10,382 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 132 treesize of output 72 [2025-04-13 18:39:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:39:10,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:39:11,255 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:39:11,255 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 605 treesize of output 273 [2025-04-13 18:39:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:39:14,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440012169] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:39:14,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:39:14,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 31 [2025-04-13 18:39:14,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378691799] [2025-04-13 18:39:14,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:39:14,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 18:39:14,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:39:14,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 18:39:14,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=910, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:39:14,232 INFO L87 Difference]: Start difference. First operand 944 states and 3303 transitions. Second operand has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:39:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:39:16,565 INFO L93 Difference]: Finished difference Result 1101 states and 3759 transitions. [2025-04-13 18:39:16,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 18:39:16,565 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:39:16,565 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:39:16,568 INFO L225 Difference]: With dead ends: 1101 [2025-04-13 18:39:16,568 INFO L226 Difference]: Without dead ends: 1090 [2025-04-13 18:39:16,568 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=337, Invalid=2633, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 18:39:16,568 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:39:16,568 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:39:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2025-04-13 18:39:16,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 944. [2025-04-13 18:39:16,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 943 states have (on average 3.5026511134676563) internal successors, (3303), 943 states have internal predecessors, (3303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:39:16,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 3303 transitions. [2025-04-13 18:39:16,579 INFO L79 Accepts]: Start accepts. Automaton has 944 states and 3303 transitions. Word has length 25 [2025-04-13 18:39:16,579 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:39:16,579 INFO L485 AbstractCegarLoop]: Abstraction has 944 states and 3303 transitions. [2025-04-13 18:39:16,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:39:16,579 INFO L278 IsEmpty]: Start isEmpty. Operand 944 states and 3303 transitions. [2025-04-13 18:39:16,580 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:39:16,580 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:39:16,580 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:39:16,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2025-04-13 18:39:16,780 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:39:16,780 INFO L403 AbstractCegarLoop]: === Iteration 103 === 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:39:16,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:39:16,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1845329717, now seen corresponding path program 71 times [2025-04-13 18:39:16,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:39:16,781 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601533996] [2025-04-13 18:39:16,781 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:39:16,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:39:16,785 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:39:16,789 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:39:16,789 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:39:16,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:39:17,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:39:17,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601533996] [2025-04-13 18:39:17,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601533996] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:39:17,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742310329] [2025-04-13 18:39:17,387 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:39:17,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:39:17,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:39:17,389 INFO L229 MonitoredProcess]: Starting monitored process 71 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:39:17,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2025-04-13 18:39:17,460 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:39:17,486 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:39:17,486 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:39:17,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:17,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 18:39:17,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:39:17,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:39:17,958 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:39:17,958 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 88 [2025-04-13 18:39:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:39:18,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:39:20,540 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:39:20,540 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 525 treesize of output 263 [2025-04-13 18:39:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:39:22,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742310329] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:39:22,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:39:22,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 32 [2025-04-13 18:39:22,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713433514] [2025-04-13 18:39:22,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:39:22,566 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:39:22,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:39:22,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:39:22,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=989, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:39:22,567 INFO L87 Difference]: Start difference. First operand 944 states and 3303 transitions. Second operand has 34 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 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:39:27,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:39:27,534 INFO L93 Difference]: Finished difference Result 1265 states and 4444 transitions. [2025-04-13 18:39:27,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 18:39:27,534 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 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 25 [2025-04-13 18:39:27,534 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:39:27,537 INFO L225 Difference]: With dead ends: 1265 [2025-04-13 18:39:27,537 INFO L226 Difference]: Without dead ends: 1259 [2025-04-13 18:39:27,537 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=488, Invalid=4068, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 18:39:27,537 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 293 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3308 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:39:27,537 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 0 Invalid, 3355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3308 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 18:39:27,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2025-04-13 18:39:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 948. [2025-04-13 18:39:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 947 states have (on average 3.500527983104541) internal successors, (3315), 947 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:39:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 3315 transitions. [2025-04-13 18:39:27,549 INFO L79 Accepts]: Start accepts. Automaton has 948 states and 3315 transitions. Word has length 25 [2025-04-13 18:39:27,549 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:39:27,549 INFO L485 AbstractCegarLoop]: Abstraction has 948 states and 3315 transitions. [2025-04-13 18:39:27,549 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.121212121212121) internal successors, (70), 33 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:39:27,549 INFO L278 IsEmpty]: Start isEmpty. Operand 948 states and 3315 transitions. [2025-04-13 18:39:27,550 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:39:27,550 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:39:27,550 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:39:27,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2025-04-13 18:39:27,751 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2025-04-13 18:39:27,751 INFO L403 AbstractCegarLoop]: === Iteration 104 === 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:39:27,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:39:27,751 INFO L85 PathProgramCache]: Analyzing trace with hash -936850197, now seen corresponding path program 72 times [2025-04-13 18:39:27,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:39:27,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699828118] [2025-04-13 18:39:27,751 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:39:27,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:39:27,755 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:39:27,759 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:39:27,759 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:39:27,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:39:29,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:39:29,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699828118] [2025-04-13 18:39:29,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699828118] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:39:29,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:39:29,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:39:29,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843808299] [2025-04-13 18:39:29,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:39:29,047 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:39:29,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:39:29,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:39:29,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:39:29,047 INFO L87 Difference]: Start difference. First operand 948 states and 3315 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:39:29,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:39:29,505 INFO L93 Difference]: Finished difference Result 978 states and 3390 transitions. [2025-04-13 18:39:29,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:39:29,505 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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 25 [2025-04-13 18:39:29,505 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:39:29,507 INFO L225 Difference]: With dead ends: 978 [2025-04-13 18:39:29,507 INFO L226 Difference]: Without dead ends: 972 [2025-04-13 18:39:29,507 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:39:29,508 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:39:29,508 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:39:29,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2025-04-13 18:39:29,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 948. [2025-04-13 18:39:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 947 states have (on average 3.500527983104541) internal successors, (3315), 947 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:39:29,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 3315 transitions. [2025-04-13 18:39:29,517 INFO L79 Accepts]: Start accepts. Automaton has 948 states and 3315 transitions. Word has length 25 [2025-04-13 18:39:29,517 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:39:29,517 INFO L485 AbstractCegarLoop]: Abstraction has 948 states and 3315 transitions. [2025-04-13 18:39:29,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:39:29,517 INFO L278 IsEmpty]: Start isEmpty. Operand 948 states and 3315 transitions. [2025-04-13 18:39:29,518 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:39:29,518 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:39:29,518 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:39:29,518 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2025-04-13 18:39:29,519 INFO L403 AbstractCegarLoop]: === Iteration 105 === 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:39:29,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:39:29,519 INFO L85 PathProgramCache]: Analyzing trace with hash 972772009, now seen corresponding path program 73 times [2025-04-13 18:39:29,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:39:29,519 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125909100] [2025-04-13 18:39:29,519 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:39:29,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:39:29,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:39:29,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:39:29,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:39:29,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:39:30,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:39:30,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125909100] [2025-04-13 18:39:30,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125909100] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:39:30,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697007532] [2025-04-13 18:39:30,344 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:39:30,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:39:30,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:39:30,346 INFO L229 MonitoredProcess]: Starting monitored process 72 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:39:30,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2025-04-13 18:39:30,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:39:30,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:39:30,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:39:30,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:30,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:39:30,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:39:30,474 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 19 treesize of output 1 [2025-04-13 18:39:30,890 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-13 18:39:30,890 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 138 treesize of output 80 [2025-04-13 18:39:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:39:31,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:39:35,077 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 451 treesize of output 401 [2025-04-13 18:39:35,083 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:39:35,084 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 546 treesize of output 462 [2025-04-13 18:39:35,522 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 246 treesize of output 214 [2025-04-13 18:39:35,528 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:39:35,528 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 360 treesize of output 1 [2025-04-13 18:39:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:39:35,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697007532] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:39:35,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:39:35,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 36 [2025-04-13 18:39:35,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276678313] [2025-04-13 18:39:35,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:39:35,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:39:35,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:39:35,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:39:35,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1243, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:39:35,556 INFO L87 Difference]: Start difference. First operand 948 states and 3315 transitions. Second operand has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 37 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:39:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:39:46,439 INFO L93 Difference]: Finished difference Result 1474 states and 4977 transitions. [2025-04-13 18:39:46,439 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-04-13 18:39:46,439 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 37 states have internal predecessors, (72), 0 states have call successors, (0), 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:39:46,439 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:39:46,442 INFO L225 Difference]: With dead ends: 1474 [2025-04-13 18:39:46,442 INFO L226 Difference]: Without dead ends: 1463 [2025-04-13 18:39:46,443 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=767, Invalid=6543, Unknown=0, NotChecked=0, Total=7310 [2025-04-13 18:39:46,443 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 334 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3430 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 3430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:39:46,443 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 0 Invalid, 3538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 3430 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-04-13 18:39:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2025-04-13 18:39:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1006. [2025-04-13 18:39:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 1005 states have (on average 3.5014925373134327) internal successors, (3519), 1005 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:39:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3519 transitions. [2025-04-13 18:39:46,455 INFO L79 Accepts]: Start accepts. Automaton has 1006 states and 3519 transitions. Word has length 25 [2025-04-13 18:39:46,455 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:39:46,455 INFO L485 AbstractCegarLoop]: Abstraction has 1006 states and 3519 transitions. [2025-04-13 18:39:46,455 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 37 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:39:46,455 INFO L278 IsEmpty]: Start isEmpty. Operand 1006 states and 3519 transitions. [2025-04-13 18:39:46,456 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:39:46,457 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:39:46,457 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:39:46,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2025-04-13 18:39:46,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:39:46,657 INFO L403 AbstractCegarLoop]: === Iteration 106 === 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:39:46,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:39:46,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1398558271, now seen corresponding path program 74 times [2025-04-13 18:39:46,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:39:46,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661737419] [2025-04-13 18:39:46,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:39:46,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:39:46,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:39:46,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:39:46,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:39:46,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:47,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:39:47,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:39:47,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661737419] [2025-04-13 18:39:47,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661737419] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:39:47,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885646932] [2025-04-13 18:39:47,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:39:47,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:39:47,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:39:47,880 INFO L229 MonitoredProcess]: Starting monitored process 73 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:39:47,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2025-04-13 18:39:47,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:39:47,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:39:47,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:39:47,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:47,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 18:39:47,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:39:48,522 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:39:48,522 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 88 [2025-04-13 18:39:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:39:48,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:39:49,973 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:39:49,973 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 657 treesize of output 283 [2025-04-13 18:39:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:39:54,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885646932] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:39:54,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:39:54,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 18:39:54,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358029717] [2025-04-13 18:39:54,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:39:54,265 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:39:54,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:39:54,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:39:54,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:39:54,265 INFO L87 Difference]: Start difference. First operand 1006 states and 3519 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:39:58,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:39:58,000 INFO L93 Difference]: Finished difference Result 1154 states and 3916 transitions. [2025-04-13 18:39:58,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 18:39:58,000 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 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:39:58,001 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:39:58,003 INFO L225 Difference]: With dead ends: 1154 [2025-04-13 18:39:58,003 INFO L226 Difference]: Without dead ends: 1138 [2025-04-13 18:39:58,003 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=462, Invalid=2960, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 18:39:58,003 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2218 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:39:58,003 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 2268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2218 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 18:39:58,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-04-13 18:39:58,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1006. [2025-04-13 18:39:58,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 1005 states have (on average 3.5014925373134327) internal successors, (3519), 1005 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:39:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3519 transitions. [2025-04-13 18:39:58,014 INFO L79 Accepts]: Start accepts. Automaton has 1006 states and 3519 transitions. Word has length 25 [2025-04-13 18:39:58,014 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:39:58,014 INFO L485 AbstractCegarLoop]: Abstraction has 1006 states and 3519 transitions. [2025-04-13 18:39:58,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:39:58,015 INFO L278 IsEmpty]: Start isEmpty. Operand 1006 states and 3519 transitions. [2025-04-13 18:39:58,016 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:39:58,016 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:39:58,016 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:39:58,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2025-04-13 18:39:58,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2025-04-13 18:39:58,216 INFO L403 AbstractCegarLoop]: === Iteration 107 === 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:39:58,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:39:58,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1638642351, now seen corresponding path program 75 times [2025-04-13 18:39:58,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:39:58,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931635928] [2025-04-13 18:39:58,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:39:58,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:39:58,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:39:58,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:39:58,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:39:58,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:39:58,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:39:58,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:39:58,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931635928] [2025-04-13 18:39:58,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931635928] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:39:58,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:39:58,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:39:58,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014708928] [2025-04-13 18:39:58,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:39:58,978 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:39:58,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:39:58,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:39:58,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:39:58,979 INFO L87 Difference]: Start difference. First operand 1006 states and 3519 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:39:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:39:59,365 INFO L93 Difference]: Finished difference Result 1082 states and 3757 transitions. [2025-04-13 18:39:59,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:39:59,365 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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 25 [2025-04-13 18:39:59,365 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:39:59,367 INFO L225 Difference]: With dead ends: 1082 [2025-04-13 18:39:59,367 INFO L226 Difference]: Without dead ends: 1076 [2025-04-13 18:39:59,367 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:39:59,368 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:39:59,368 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:39:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2025-04-13 18:39:59,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1012. [2025-04-13 18:39:59,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.507418397626113) internal successors, (3546), 1011 states have internal predecessors, (3546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:39:59,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3546 transitions. [2025-04-13 18:39:59,378 INFO L79 Accepts]: Start accepts. Automaton has 1012 states and 3546 transitions. Word has length 25 [2025-04-13 18:39:59,378 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:39:59,378 INFO L485 AbstractCegarLoop]: Abstraction has 1012 states and 3546 transitions. [2025-04-13 18:39:59,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:39:59,378 INFO L278 IsEmpty]: Start isEmpty. Operand 1012 states and 3546 transitions. [2025-04-13 18:39:59,379 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:39:59,379 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:39:59,379 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:39:59,379 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2025-04-13 18:39:59,379 INFO L403 AbstractCegarLoop]: === Iteration 108 === 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:39:59,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:39:59,380 INFO L85 PathProgramCache]: Analyzing trace with hash -26455841, now seen corresponding path program 76 times [2025-04-13 18:39:59,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:39:59,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000076316] [2025-04-13 18:39:59,380 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:39:59,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:39:59,390 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:39:59,394 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:39:59,395 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:39:59,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:40:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:40:00,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:40:00,111 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000076316] [2025-04-13 18:40:00,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000076316] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:40:00,112 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384559689] [2025-04-13 18:40:00,112 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:40:00,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:40:00,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:40:00,113 INFO L229 MonitoredProcess]: Starting monitored process 74 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:40:00,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2025-04-13 18:40:00,182 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:40:00,197 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:40:00,197 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:40:00,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:40:00,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:40:00,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:40:00,579 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:00,580 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 132 treesize of output 72 [2025-04-13 18:40:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:40:00,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:40:01,622 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:01,622 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 605 treesize of output 273 [2025-04-13 18:40:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:40:04,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384559689] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:40:04,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:40:04,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 31 [2025-04-13 18:40:04,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195505763] [2025-04-13 18:40:04,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:40:04,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 18:40:04,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:40:04,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 18:40:04,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:40:04,602 INFO L87 Difference]: Start difference. First operand 1012 states and 3546 transitions. Second operand has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:40:07,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:40:07,270 INFO L93 Difference]: Finished difference Result 1159 states and 3977 transitions. [2025-04-13 18:40:07,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:40:07,270 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:40:07,270 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:40:07,272 INFO L225 Difference]: With dead ends: 1159 [2025-04-13 18:40:07,272 INFO L226 Difference]: Without dead ends: 1148 [2025-04-13 18:40:07,273 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=305, Invalid=2245, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:40:07,273 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 128 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2852 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:40:07,273 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 0 Invalid, 2876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2852 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:40:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-04-13 18:40:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1022. [2025-04-13 18:40:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1021 states have (on average 3.5093046033300688) internal successors, (3583), 1021 states have internal predecessors, (3583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:40:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 3583 transitions. [2025-04-13 18:40:07,284 INFO L79 Accepts]: Start accepts. Automaton has 1022 states and 3583 transitions. Word has length 25 [2025-04-13 18:40:07,284 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:40:07,284 INFO L485 AbstractCegarLoop]: Abstraction has 1022 states and 3583 transitions. [2025-04-13 18:40:07,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:40:07,284 INFO L278 IsEmpty]: Start isEmpty. Operand 1022 states and 3583 transitions. [2025-04-13 18:40:07,285 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:40:07,285 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:40:07,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:40:07,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2025-04-13 18:40:07,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:40:07,486 INFO L403 AbstractCegarLoop]: === Iteration 109 === 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:40:07,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:40:07,486 INFO L85 PathProgramCache]: Analyzing trace with hash 669195627, now seen corresponding path program 77 times [2025-04-13 18:40:07,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:40:07,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569167953] [2025-04-13 18:40:07,486 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:40:07,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:40:07,490 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:40:07,494 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:40:07,494 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:40:07,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:40:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:40:08,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:40:08,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569167953] [2025-04-13 18:40:08,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569167953] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:40:08,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064859936] [2025-04-13 18:40:08,130 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:40:08,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:40:08,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:40:08,131 INFO L229 MonitoredProcess]: Starting monitored process 75 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:40:08,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2025-04-13 18:40:08,201 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:40:08,215 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:40:08,215 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:40:08,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:40:08,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 18:40:08,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:40:08,241 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:40:08,260 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:40:08,696 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:08,697 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 72 [2025-04-13 18:40:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:40:08,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:40:13,249 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 117 treesize of output 107 [2025-04-13 18:40:13,254 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:13,254 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 364 treesize of output 342 [2025-04-13 18:40:13,317 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 119 treesize of output 109 [2025-04-13 18:40:13,322 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:13,322 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 450 treesize of output 430 [2025-04-13 18:40:13,380 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 119 treesize of output 109 [2025-04-13 18:40:13,385 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:13,386 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 362 treesize of output 342 [2025-04-13 18:40:13,446 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 119 treesize of output 109 [2025-04-13 18:40:13,451 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:13,452 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 362 treesize of output 342 [2025-04-13 18:40:13,510 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 121 treesize of output 111 [2025-04-13 18:40:13,516 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:13,516 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 254 treesize of output 1 [2025-04-13 18:40:13,520 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 119 treesize of output 109 [2025-04-13 18:40:13,526 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:13,527 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 422 treesize of output 394 [2025-04-13 18:40:13,588 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 97 treesize of output 89 [2025-04-13 18:40:13,593 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:13,594 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 371 treesize of output 345 [2025-04-13 18:40:13,647 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 143 treesize of output 131 [2025-04-13 18:40:13,653 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:13,653 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 305 treesize of output 1 [2025-04-13 18:40:13,656 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 123 treesize of output 113 [2025-04-13 18:40:13,662 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:13,662 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 488 treesize of output 454 [2025-04-13 18:40:13,732 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 118 treesize of output 108 [2025-04-13 18:40:13,740 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:13,740 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 703 treesize of output 1 [2025-04-13 18:40:13,752 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 93 treesize of output 85 [2025-04-13 18:40:13,758 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:13,759 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 421 treesize of output 397 [2025-04-13 18:40:13,807 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 92 treesize of output 84 [2025-04-13 18:40:13,813 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:13,813 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 302 treesize of output 1 [2025-04-13 18:40:13,817 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 143 treesize of output 131 [2025-04-13 18:40:13,823 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:13,823 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 291 treesize of output 1 [2025-04-13 18:40:13,826 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 112 treesize of output 102 [2025-04-13 18:40:13,832 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:13,832 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 345 treesize of output 1 [2025-04-13 18:40:13,835 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 118 treesize of output 108 [2025-04-13 18:40:13,841 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:13,841 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 405 treesize of output 1 [2025-04-13 18:40:13,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:40:13,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064859936] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:40:13,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:40:13,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 39 [2025-04-13 18:40:13,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378119339] [2025-04-13 18:40:13,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:40:13,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 18:40:13,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:40:13,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 18:40:13,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1428, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 18:40:13,871 INFO L87 Difference]: Start difference. First operand 1022 states and 3583 transitions. Second operand has 41 states, 40 states have (on average 1.875) internal successors, (75), 40 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:40:21,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:40:21,741 INFO L93 Difference]: Finished difference Result 1407 states and 4933 transitions. [2025-04-13 18:40:21,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-13 18:40:21,742 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.875) internal successors, (75), 40 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 18:40:21,742 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:40:21,745 INFO L225 Difference]: With dead ends: 1407 [2025-04-13 18:40:21,745 INFO L226 Difference]: Without dead ends: 1396 [2025-04-13 18:40:21,745 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1504 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=605, Invalid=5401, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 18:40:21,745 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 326 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3367 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 3367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:40:21,745 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 0 Invalid, 3473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 3367 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-04-13 18:40:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2025-04-13 18:40:21,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1062. [2025-04-13 18:40:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1061 states have (on average 3.539114043355325) internal successors, (3755), 1061 states have internal predecessors, (3755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:40:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 3755 transitions. [2025-04-13 18:40:21,759 INFO L79 Accepts]: Start accepts. Automaton has 1062 states and 3755 transitions. Word has length 25 [2025-04-13 18:40:21,760 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:40:21,760 INFO L485 AbstractCegarLoop]: Abstraction has 1062 states and 3755 transitions. [2025-04-13 18:40:21,760 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.875) internal successors, (75), 40 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:40:21,760 INFO L278 IsEmpty]: Start isEmpty. Operand 1062 states and 3755 transitions. [2025-04-13 18:40:21,761 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:40:21,761 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:40:21,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:40:21,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2025-04-13 18:40:21,961 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:40:21,961 INFO L403 AbstractCegarLoop]: === Iteration 110 === 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:40:21,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:40:21,962 INFO L85 PathProgramCache]: Analyzing trace with hash 452828835, now seen corresponding path program 78 times [2025-04-13 18:40:21,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:40:21,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599372993] [2025-04-13 18:40:21,962 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:40:21,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:40:21,966 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:40:21,972 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:40:21,972 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:40:21,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:40:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:40:23,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:40:23,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599372993] [2025-04-13 18:40:23,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599372993] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:40:23,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345998557] [2025-04-13 18:40:23,223 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:40:23,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:40:23,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:40:23,225 INFO L229 MonitoredProcess]: Starting monitored process 76 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:40:23,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2025-04-13 18:40:23,308 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:40:23,321 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:40:23,321 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:40:23,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:40:23,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 18:40:23,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:40:23,822 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:23,822 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 88 [2025-04-13 18:40:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:40:24,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:40:25,584 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:25,584 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 773 treesize of output 315 [2025-04-13 18:40:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:40:30,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345998557] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:40:30,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:40:30,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 18:40:30,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578384783] [2025-04-13 18:40:30,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:40:30,499 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:40:30,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:40:30,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:40:30,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:40:30,500 INFO L87 Difference]: Start difference. First operand 1062 states and 3755 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:40:34,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:40:34,529 INFO L93 Difference]: Finished difference Result 1218 states and 4217 transitions. [2025-04-13 18:40:34,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 18:40:34,530 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 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:40:34,530 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:40:34,532 INFO L225 Difference]: With dead ends: 1218 [2025-04-13 18:40:34,532 INFO L226 Difference]: Without dead ends: 1207 [2025-04-13 18:40:34,533 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=495, Invalid=2927, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 18:40:34,533 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:40:34,533 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:40:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2025-04-13 18:40:34,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1066. [2025-04-13 18:40:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 1065 states have (on average 3.5370892018779343) internal successors, (3767), 1065 states have internal predecessors, (3767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:40:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 3767 transitions. [2025-04-13 18:40:34,545 INFO L79 Accepts]: Start accepts. Automaton has 1066 states and 3767 transitions. Word has length 25 [2025-04-13 18:40:34,546 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:40:34,546 INFO L485 AbstractCegarLoop]: Abstraction has 1066 states and 3767 transitions. [2025-04-13 18:40:34,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:40:34,546 INFO L278 IsEmpty]: Start isEmpty. Operand 1066 states and 3767 transitions. [2025-04-13 18:40:34,547 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:40:34,547 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:40:34,547 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:40:34,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2025-04-13 18:40:34,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable109 [2025-04-13 18:40:34,747 INFO L403 AbstractCegarLoop]: === Iteration 111 === 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:40:34,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:40:34,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1611677295, now seen corresponding path program 79 times [2025-04-13 18:40:34,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:40:34,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373013914] [2025-04-13 18:40:34,748 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:40:34,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:40:34,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:40:34,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:40:34,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:40:34,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:40:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:40:35,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:40:35,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373013914] [2025-04-13 18:40:35,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373013914] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:40:35,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747504845] [2025-04-13 18:40:35,623 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:40:35,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:40:35,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:40:35,625 INFO L229 MonitoredProcess]: Starting monitored process 77 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:40:35,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2025-04-13 18:40:35,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:40:35,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:40:35,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:40:35,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:40:35,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 18:40:35,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:40:35,752 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 19 treesize of output 1 [2025-04-13 18:40:36,271 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:36,271 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 166 treesize of output 80 [2025-04-13 18:40:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:40:36,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:40:41,786 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 256 treesize of output 222 [2025-04-13 18:40:41,790 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:41,791 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 371 treesize of output 297 [2025-04-13 18:40:42,011 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 422 treesize of output 376 [2025-04-13 18:40:42,017 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:42,018 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 509 treesize of output 429 [2025-04-13 18:40:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:40:42,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747504845] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:40:42,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:40:42,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 36 [2025-04-13 18:40:42,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765880935] [2025-04-13 18:40:42,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:40:42,442 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:40:42,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:40:42,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:40:42,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1229, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:40:42,442 INFO L87 Difference]: Start difference. First operand 1066 states and 3767 transitions. Second operand has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 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:40:48,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:40:48,837 INFO L93 Difference]: Finished difference Result 1382 states and 4868 transitions. [2025-04-13 18:40:48,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 18:40:48,837 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 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 25 [2025-04-13 18:40:48,837 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:40:48,840 INFO L225 Difference]: With dead ends: 1382 [2025-04-13 18:40:48,840 INFO L226 Difference]: Without dead ends: 1371 [2025-04-13 18:40:48,841 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=433, Invalid=3857, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 18:40:48,841 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 268 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2657 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:40:48,841 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 0 Invalid, 2725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2657 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-04-13 18:40:48,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-04-13 18:40:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1066. [2025-04-13 18:40:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 1065 states have (on average 3.5370892018779343) internal successors, (3767), 1065 states have internal predecessors, (3767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:40:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 3767 transitions. [2025-04-13 18:40:48,853 INFO L79 Accepts]: Start accepts. Automaton has 1066 states and 3767 transitions. Word has length 25 [2025-04-13 18:40:48,853 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:40:48,853 INFO L485 AbstractCegarLoop]: Abstraction has 1066 states and 3767 transitions. [2025-04-13 18:40:48,853 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 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:40:48,853 INFO L278 IsEmpty]: Start isEmpty. Operand 1066 states and 3767 transitions. [2025-04-13 18:40:48,854 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:40:48,854 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:40:48,855 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:40:48,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2025-04-13 18:40:49,055 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:40:49,055 INFO L403 AbstractCegarLoop]: === Iteration 112 === 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:40:49,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:40:49,055 INFO L85 PathProgramCache]: Analyzing trace with hash 732527583, now seen corresponding path program 80 times [2025-04-13 18:40:49,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:40:49,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616928568] [2025-04-13 18:40:49,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:40:49,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:40:49,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:40:49,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:40:49,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:40:49,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:40:49,751 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:40:49,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:40:49,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616928568] [2025-04-13 18:40:49,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616928568] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:40:49,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262984482] [2025-04-13 18:40:49,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:40:49,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:40:49,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:40:49,754 INFO L229 MonitoredProcess]: Starting monitored process 78 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:40:49,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2025-04-13 18:40:49,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:40:49,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:40:49,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:40:49,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:40:49,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 18:40:49,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:40:50,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:40:50,423 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:50,423 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 80 [2025-04-13 18:40:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:40:50,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:40:51,761 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:40:51,761 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 585 treesize of output 283 [2025-04-13 18:40:55,343 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:40:55,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262984482] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:40:55,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:40:55,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 18:40:55,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638979737] [2025-04-13 18:40:55,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:40:55,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 18:40:55,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:40:55,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 18:40:55,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:40:55,344 INFO L87 Difference]: Start difference. First operand 1066 states and 3767 transitions. Second operand has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 35 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:40:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:40:58,436 INFO L93 Difference]: Finished difference Result 1248 states and 4356 transitions. [2025-04-13 18:40:58,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 18:40:58,436 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 35 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 25 [2025-04-13 18:40:58,436 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:40:58,439 INFO L225 Difference]: With dead ends: 1248 [2025-04-13 18:40:58,439 INFO L226 Difference]: Without dead ends: 1237 [2025-04-13 18:40:58,440 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=424, Invalid=2998, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 18:40:58,440 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 170 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:40:58,440 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 0 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:40:58,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2025-04-13 18:40:58,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1080. [2025-04-13 18:40:58,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1079 states have (on average 3.531047265987025) internal successors, (3810), 1079 states have internal predecessors, (3810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:40:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3810 transitions. [2025-04-13 18:40:58,452 INFO L79 Accepts]: Start accepts. Automaton has 1080 states and 3810 transitions. Word has length 25 [2025-04-13 18:40:58,452 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:40:58,452 INFO L485 AbstractCegarLoop]: Abstraction has 1080 states and 3810 transitions. [2025-04-13 18:40:58,452 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 35 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:40:58,452 INFO L278 IsEmpty]: Start isEmpty. Operand 1080 states and 3810 transitions. [2025-04-13 18:40:58,453 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:40:58,453 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:40:58,453 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:40:58,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2025-04-13 18:40:58,654 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:40:58,654 INFO L403 AbstractCegarLoop]: === Iteration 113 === 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:40:58,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:40:58,654 INFO L85 PathProgramCache]: Analyzing trace with hash 60235341, now seen corresponding path program 81 times [2025-04-13 18:40:58,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:40:58,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282755989] [2025-04-13 18:40:58,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:40:58,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:40:58,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:40:58,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 18:40:58,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:40:58,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:40:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:40:59,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:40:59,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282755989] [2025-04-13 18:40:59,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282755989] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:40:59,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:40:59,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:40:59,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788058431] [2025-04-13 18:40:59,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:40:59,410 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:40:59,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:40:59,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:40:59,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:40:59,410 INFO L87 Difference]: Start difference. First operand 1080 states and 3810 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:40:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:40:59,756 INFO L93 Difference]: Finished difference Result 1150 states and 4029 transitions. [2025-04-13 18:40:59,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:40:59,756 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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 25 [2025-04-13 18:40:59,756 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:40:59,758 INFO L225 Difference]: With dead ends: 1150 [2025-04-13 18:40:59,758 INFO L226 Difference]: Without dead ends: 1144 [2025-04-13 18:40:59,759 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:40:59,759 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:40:59,759 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:40:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2025-04-13 18:40:59,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1082. [2025-04-13 18:40:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 1081 states have (on average 3.5328399629972247) internal successors, (3819), 1081 states have internal predecessors, (3819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:40:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 3819 transitions. [2025-04-13 18:40:59,770 INFO L79 Accepts]: Start accepts. Automaton has 1082 states and 3819 transitions. Word has length 25 [2025-04-13 18:40:59,770 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:40:59,770 INFO L485 AbstractCegarLoop]: Abstraction has 1082 states and 3819 transitions. [2025-04-13 18:40:59,770 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:40:59,771 INFO L278 IsEmpty]: Start isEmpty. Operand 1082 states and 3819 transitions. [2025-04-13 18:40:59,772 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:40:59,772 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:40:59,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:40:59,772 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2025-04-13 18:40:59,772 INFO L403 AbstractCegarLoop]: === Iteration 114 === 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:40:59,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:40:59,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1373694943, now seen corresponding path program 82 times [2025-04-13 18:40:59,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:40:59,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937199843] [2025-04-13 18:40:59,772 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:40:59,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:40:59,776 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:40:59,781 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:40:59,781 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:40:59,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:41:00,637 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:41:00,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:41:00,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937199843] [2025-04-13 18:41:00,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937199843] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:41:00,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338627536] [2025-04-13 18:41:00,638 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:41:00,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:41:00,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:41:00,640 INFO L229 MonitoredProcess]: Starting monitored process 79 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:41:00,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2025-04-13 18:41:00,719 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:41:00,733 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:41:00,733 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:41:00,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:41:00,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:41:00,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:41:01,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:41:01,168 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:41:01,168 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 88 [2025-04-13 18:41:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:41:01,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:41:03,395 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:41:03,396 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 961 treesize of output 449 [2025-04-13 18:41:04,852 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 18:41:04,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-13 18:41:04,853 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 18:41:04,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2025-04-13 18:41:05,053 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:41:05,054 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:583) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 61 more [2025-04-13 18:41:05,058 INFO L158 Benchmark]: Toolchain (without parser) took 796454.41ms. Allocated memory was 155.2MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 108.7MB in the beginning and 577.8MB in the end (delta: -469.0MB). Peak memory consumption was 648.2MB. Max. memory is 8.0GB. [2025-04-13 18:41:05,058 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:41:05,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.74ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 94.0MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 18:41:05,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.73ms. Allocated memory is still 155.2MB. Free memory was 94.0MB in the beginning and 92.4MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:41:05,058 INFO L158 Benchmark]: Boogie Preprocessor took 38.13ms. Allocated memory is still 155.2MB. Free memory was 92.4MB in the beginning and 90.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:41:05,058 INFO L158 Benchmark]: RCFGBuilder took 488.67ms. Allocated memory is still 155.2MB. Free memory was 90.7MB in the beginning and 42.9MB in the end (delta: 47.7MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-13 18:41:05,058 INFO L158 Benchmark]: TraceAbstraction took 795647.85ms. Allocated memory was 155.2MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 42.9MB in the beginning and 577.8MB in the end (delta: -534.8MB). Peak memory consumption was 585.3MB. Max. memory is 8.0GB. [2025-04-13 18:41:05,059 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 249.74ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 94.0MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.73ms. Allocated memory is still 155.2MB. Free memory was 94.0MB in the beginning and 92.4MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.13ms. Allocated memory is still 155.2MB. Free memory was 92.4MB in the beginning and 90.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 488.67ms. Allocated memory is still 155.2MB. Free memory was 90.7MB in the beginning and 42.9MB in the end (delta: 47.7MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 795647.85ms. Allocated memory was 155.2MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 42.9MB in the beginning and 577.8MB in the end (delta: -534.8MB). Peak memory consumption was 585.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...