/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:34:30,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:34:30,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 22:34:30,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:34:30,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:34:30,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:34:30,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:34:30,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:34:30,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:34:30,314 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:34:30,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:34:30,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:34:30,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:34:30,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:34:30,315 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:34:30,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:34:30,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:34:30,315 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:34:30,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:34:30,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:34:30,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:34:30,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:34:30,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:34:30,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:34:30,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:34:30,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:34:30,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:34:30,316 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:34:30,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:34:30,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:34:30,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:34:30,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:34:30,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:34:30,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:34:30,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:34:30,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:34:30,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:34:30,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:34:30,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:34:30,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:34:30,317 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:34:30,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:34:30,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:34:30,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:34:30,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:34:30,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:34:30,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:34:30,317 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 22:34:30,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:34:30,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:34:30,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:34:30,543 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:34:30,543 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:34:30,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2025-04-13 22:34:31,833 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec04c915a/1508915e007e4715b387e74b9f59e751/FLAGd3180663d [2025-04-13 22:34:32,034 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:34:32,035 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2025-04-13 22:34:32,040 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec04c915a/1508915e007e4715b387e74b9f59e751/FLAGd3180663d [2025-04-13 22:34:32,833 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec04c915a/1508915e007e4715b387e74b9f59e751 [2025-04-13 22:34:32,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:34:32,836 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:34:32,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:34:32,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:34:32,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:34:32,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:34:32" (1/1) ... [2025-04-13 22:34:32,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10968ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:34:32, skipping insertion in model container [2025-04-13 22:34:32,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:34:32" (1/1) ... [2025-04-13 22:34:32,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:34:33,035 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/parallel-parallel-sum-equiv.wvr.c[3822,3835] [2025-04-13 22:34:33,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:34:33,062 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:34:33,095 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/parallel-parallel-sum-equiv.wvr.c[3822,3835] [2025-04-13 22:34:33,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:34:33,111 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:34:33,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:34:33 WrapperNode [2025-04-13 22:34:33,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:34:33,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:34:33,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:34:33,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:34:33,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:34:33" (1/1) ... [2025-04-13 22:34:33,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:34:33" (1/1) ... [2025-04-13 22:34:33,148 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 245 [2025-04-13 22:34:33,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:34:33,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:34:33,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:34:33,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:34:33,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:34:33" (1/1) ... [2025-04-13 22:34:33,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:34:33" (1/1) ... [2025-04-13 22:34:33,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:34:33" (1/1) ... [2025-04-13 22:34:33,179 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 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 22:34:33,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:34:33" (1/1) ... [2025-04-13 22:34:33,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:34:33" (1/1) ... [2025-04-13 22:34:33,184 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:34:33" (1/1) ... [2025-04-13 22:34:33,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:34:33" (1/1) ... [2025-04-13 22:34:33,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:34:33" (1/1) ... [2025-04-13 22:34:33,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:34:33" (1/1) ... [2025-04-13 22:34:33,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:34:33,190 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:34:33,190 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:34:33,190 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:34:33,190 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:34:33" (1/1) ... [2025-04-13 22:34:33,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:34:33,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:33,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 22:34:33,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 22:34:33,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:34:33,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:34:33,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:34:33,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:34:33,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:34:33,230 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:34:33,230 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:34:33,230 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:34:33,230 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:34:33,230 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:34:33,230 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:34:33,230 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 22:34:33,230 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 22:34:33,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:34:33,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:34:33,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 22:34:33,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 22:34:33,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:34:33,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:34:33,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:34:33,232 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 22:34:33,328 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:34:33,330 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:34:33,644 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:34:33,645 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:34:33,645 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:34:33,901 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:34:33,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:34:33 BoogieIcfgContainer [2025-04-13 22:34:33,901 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:34:33,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:34:33,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:34:33,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:34:33,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:34:32" (1/3) ... [2025-04-13 22:34:33,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e26783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:34:33, skipping insertion in model container [2025-04-13 22:34:33,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:34:33" (2/3) ... [2025-04-13 22:34:33,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e26783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:34:33, skipping insertion in model container [2025-04-13 22:34:33,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:34:33" (3/3) ... [2025-04-13 22:34:33,909 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2025-04-13 22:34:33,920 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:34:33,921 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-equiv.wvr.c that has 5 procedures, 44 locations, 43 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 22:34:33,922 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:34:33,977 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-04-13 22:34:33,997 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 52 transitions, 144 flow [2025-04-13 22:34:34,130 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2263 states, 2262 states have (on average 3.8417329796640143) internal successors, (8690), 2262 states have internal predecessors, (8690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:34,152 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:34:34,159 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;@427b07d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:34:34,159 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 22:34:34,166 INFO L278 IsEmpty]: Start isEmpty. Operand has 2263 states, 2262 states have (on average 3.8417329796640143) internal successors, (8690), 2262 states have internal predecessors, (8690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:34,185 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 22:34:34,185 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:34,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:34,186 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:34,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:34,191 INFO L85 PathProgramCache]: Analyzing trace with hash 472389476, now seen corresponding path program 1 times [2025-04-13 22:34:34,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:34,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505411829] [2025-04-13 22:34:34,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:34,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:34,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 22:34:34,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:34:34,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:34,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:34,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:34:34,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:34,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505411829] [2025-04-13 22:34:34,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505411829] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:34,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:34,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:34:34,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041616149] [2025-04-13 22:34:34,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:34,529 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:34:34,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:34,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:34:34,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:34:34,550 INFO L87 Difference]: Start difference. First operand has 2263 states, 2262 states have (on average 3.8417329796640143) internal successors, (8690), 2262 states have internal predecessors, (8690), 0 states have call successors, (0), 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 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:34,834 INFO L93 Difference]: Finished difference Result 5255 states and 20382 transitions. [2025-04-13 22:34:34,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:34:34,836 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 22:34:34,836 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:34,893 INFO L225 Difference]: With dead ends: 5255 [2025-04-13 22:34:34,893 INFO L226 Difference]: Without dead ends: 5112 [2025-04-13 22:34:34,902 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:34:34,904 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 68 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:34,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 13 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:34:34,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5112 states. [2025-04-13 22:34:35,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5112 to 2694. [2025-04-13 22:34:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2694 states, 2693 states have (on average 3.8362421091719274) internal successors, (10331), 2693 states have internal predecessors, (10331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 10331 transitions. [2025-04-13 22:34:35,087 INFO L79 Accepts]: Start accepts. Automaton has 2694 states and 10331 transitions. Word has length 32 [2025-04-13 22:34:35,088 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:35,088 INFO L485 AbstractCegarLoop]: Abstraction has 2694 states and 10331 transitions. [2025-04-13 22:34:35,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:35,088 INFO L278 IsEmpty]: Start isEmpty. Operand 2694 states and 10331 transitions. [2025-04-13 22:34:35,097 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 22:34:35,098 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:35,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:35,098 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:34:35,098 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:35,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:35,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1127197988, now seen corresponding path program 2 times [2025-04-13 22:34:35,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:35,099 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953191218] [2025-04-13 22:34:35,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:35,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:35,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-04-13 22:34:35,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:34:35,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:34:35,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:34:35,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:35,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953191218] [2025-04-13 22:34:35,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953191218] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:35,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:35,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:34:35,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107730954] [2025-04-13 22:34:35,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:35,221 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:34:35,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:35,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:34:35,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:34:35,222 INFO L87 Difference]: Start difference. First operand 2694 states and 10331 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:35,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:35,493 INFO L93 Difference]: Finished difference Result 6294 states and 24391 transitions. [2025-04-13 22:34:35,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:34:35,494 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 22:34:35,494 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:35,557 INFO L225 Difference]: With dead ends: 6294 [2025-04-13 22:34:35,557 INFO L226 Difference]: Without dead ends: 6151 [2025-04-13 22:34:35,559 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:34:35,559 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:35,560 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 13 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:34:35,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6151 states. [2025-04-13 22:34:35,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6151 to 3074. [2025-04-13 22:34:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3074 states, 3073 states have (on average 3.827855515782623) internal successors, (11763), 3073 states have internal predecessors, (11763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 11763 transitions. [2025-04-13 22:34:35,710 INFO L79 Accepts]: Start accepts. Automaton has 3074 states and 11763 transitions. Word has length 32 [2025-04-13 22:34:35,711 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:35,711 INFO L485 AbstractCegarLoop]: Abstraction has 3074 states and 11763 transitions. [2025-04-13 22:34:35,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:35,711 INFO L278 IsEmpty]: Start isEmpty. Operand 3074 states and 11763 transitions. [2025-04-13 22:34:35,720 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:34:35,720 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:35,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:35,721 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:34:35,721 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:35,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:35,721 INFO L85 PathProgramCache]: Analyzing trace with hash 980208052, now seen corresponding path program 1 times [2025-04-13 22:34:35,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:35,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778503915] [2025-04-13 22:34:35,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:35,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:35,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:34:35,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:34:35,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:35,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:35,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:34:35,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:35,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778503915] [2025-04-13 22:34:35,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778503915] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:35,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:35,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:34:35,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357410736] [2025-04-13 22:34:35,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:35,877 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:34:35,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:35,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:34:35,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:34:35,878 INFO L87 Difference]: Start difference. First operand 3074 states and 11763 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:36,192 INFO L93 Difference]: Finished difference Result 7340 states and 28222 transitions. [2025-04-13 22:34:36,192 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:34:36,192 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:34:36,192 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:36,230 INFO L225 Difference]: With dead ends: 7340 [2025-04-13 22:34:36,230 INFO L226 Difference]: Without dead ends: 5394 [2025-04-13 22:34:36,236 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:34:36,236 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 65 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:36,236 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 16 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:34:36,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5394 states. [2025-04-13 22:34:36,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5394 to 4399. [2025-04-13 22:34:36,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4399 states, 4398 states have (on average 3.813324238290132) internal successors, (16771), 4398 states have internal predecessors, (16771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4399 states to 4399 states and 16771 transitions. [2025-04-13 22:34:36,457 INFO L79 Accepts]: Start accepts. Automaton has 4399 states and 16771 transitions. Word has length 35 [2025-04-13 22:34:36,457 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:36,457 INFO L485 AbstractCegarLoop]: Abstraction has 4399 states and 16771 transitions. [2025-04-13 22:34:36,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:36,458 INFO L278 IsEmpty]: Start isEmpty. Operand 4399 states and 16771 transitions. [2025-04-13 22:34:36,468 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:34:36,468 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:36,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:36,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:34:36,469 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:36,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:36,469 INFO L85 PathProgramCache]: Analyzing trace with hash 249092447, now seen corresponding path program 1 times [2025-04-13 22:34:36,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:36,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397969223] [2025-04-13 22:34:36,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:36,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:36,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:34:36,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:34:36,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:36,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:34:36,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:36,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397969223] [2025-04-13 22:34:36,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397969223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:36,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:36,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:34:36,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666898526] [2025-04-13 22:34:36,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:36,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:34:36,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:36,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:34:36,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:34:36,595 INFO L87 Difference]: Start difference. First operand 4399 states and 16771 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:36,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:36,760 INFO L93 Difference]: Finished difference Result 5744 states and 21639 transitions. [2025-04-13 22:34:36,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:34:36,760 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:34:36,760 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:36,776 INFO L225 Difference]: With dead ends: 5744 [2025-04-13 22:34:36,776 INFO L226 Difference]: Without dead ends: 3075 [2025-04-13 22:34:36,781 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:34:36,783 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:36,784 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 12 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:34:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2025-04-13 22:34:36,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 3075. [2025-04-13 22:34:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3075 states, 3074 states have (on average 3.826935588809369) internal successors, (11764), 3074 states have internal predecessors, (11764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3075 states to 3075 states and 11764 transitions. [2025-04-13 22:34:36,903 INFO L79 Accepts]: Start accepts. Automaton has 3075 states and 11764 transitions. Word has length 35 [2025-04-13 22:34:36,903 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:36,903 INFO L485 AbstractCegarLoop]: Abstraction has 3075 states and 11764 transitions. [2025-04-13 22:34:36,903 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:36,903 INFO L278 IsEmpty]: Start isEmpty. Operand 3075 states and 11764 transitions. [2025-04-13 22:34:36,910 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:34:36,911 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:36,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:36,911 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:34:36,911 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:36,911 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:36,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1407768440, now seen corresponding path program 1 times [2025-04-13 22:34:36,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:36,911 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952992566] [2025-04-13 22:34:36,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:36,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:36,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:34:36,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:34:36,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:36,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:37,040 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 22:34:37,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:37,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952992566] [2025-04-13 22:34:37,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952992566] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:37,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683010705] [2025-04-13 22:34:37,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:37,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:37,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:37,043 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:34:37,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 22:34:37,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:34:37,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:34:37,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:37,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:37,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 22:34:37,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:37,202 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 22:34:37,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:37,254 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 22:34:37,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683010705] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:37,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:37,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 22:34:37,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292201157] [2025-04-13 22:34:37,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:37,254 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:37,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:37,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:37,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:37,255 INFO L87 Difference]: Start difference. First operand 3075 states and 11764 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 22:34:37,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:37,575 INFO L93 Difference]: Finished difference Result 7341 states and 28223 transitions. [2025-04-13 22:34:37,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:34:37,577 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 36 [2025-04-13 22:34:37,578 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:37,601 INFO L225 Difference]: With dead ends: 7341 [2025-04-13 22:34:37,601 INFO L226 Difference]: Without dead ends: 5395 [2025-04-13 22:34:37,605 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:37,607 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 192 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:37,607 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 23 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:34:37,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5395 states. [2025-04-13 22:34:37,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5395 to 4400. [2025-04-13 22:34:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4400 states, 4399 states have (on average 3.8126847010684246) internal successors, (16772), 4399 states have internal predecessors, (16772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:37,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4400 states to 4400 states and 16772 transitions. [2025-04-13 22:34:37,741 INFO L79 Accepts]: Start accepts. Automaton has 4400 states and 16772 transitions. Word has length 36 [2025-04-13 22:34:37,742 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:37,742 INFO L485 AbstractCegarLoop]: Abstraction has 4400 states and 16772 transitions. [2025-04-13 22:34:37,742 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 22:34:37,742 INFO L278 IsEmpty]: Start isEmpty. Operand 4400 states and 16772 transitions. [2025-04-13 22:34:37,753 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:34:37,754 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:37,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:37,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 22:34:37,954 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:37,954 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:37,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2138884045, now seen corresponding path program 1 times [2025-04-13 22:34:37,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:37,955 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250087349] [2025-04-13 22:34:37,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:37,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:37,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:34:37,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:34:37,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:37,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:38,069 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 22:34:38,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:38,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250087349] [2025-04-13 22:34:38,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250087349] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:38,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141698454] [2025-04-13 22:34:38,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:38,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:38,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:38,073 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:34:38,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 22:34:38,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:34:38,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:34:38,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:38,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:38,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 22:34:38,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:38,229 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 22:34:38,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:38,287 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 22:34:38,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141698454] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:38,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:38,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 22:34:38,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068589066] [2025-04-13 22:34:38,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:38,288 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:34:38,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:38,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:34:38,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:38,289 INFO L87 Difference]: Start difference. First operand 4400 states and 16772 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 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 22:34:38,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:38,595 INFO L93 Difference]: Finished difference Result 6326 states and 23823 transitions. [2025-04-13 22:34:38,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:34:38,596 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 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 36 [2025-04-13 22:34:38,596 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:38,612 INFO L225 Difference]: With dead ends: 6326 [2025-04-13 22:34:38,612 INFO L226 Difference]: Without dead ends: 2782 [2025-04-13 22:34:38,619 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:38,620 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 55 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:38,620 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 25 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:34:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2025-04-13 22:34:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2782. [2025-04-13 22:34:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 2781 states have (on average 3.725638259618842) internal successors, (10361), 2781 states have internal predecessors, (10361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:38,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 10361 transitions. [2025-04-13 22:34:38,713 INFO L79 Accepts]: Start accepts. Automaton has 2782 states and 10361 transitions. Word has length 36 [2025-04-13 22:34:38,714 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:38,714 INFO L485 AbstractCegarLoop]: Abstraction has 2782 states and 10361 transitions. [2025-04-13 22:34:38,714 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 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 22:34:38,714 INFO L278 IsEmpty]: Start isEmpty. Operand 2782 states and 10361 transitions. [2025-04-13 22:34:38,720 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:34:38,721 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:38,721 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:38,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 22:34:38,926 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,SelfDestructingSolverStorable5 [2025-04-13 22:34:38,926 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:38,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:38,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1874371636, now seen corresponding path program 2 times [2025-04-13 22:34:38,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:38,927 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760414642] [2025-04-13 22:34:38,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:38,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:38,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 22:34:38,944 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 37 statements. [2025-04-13 22:34:38,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:34:38,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:39,036 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 22:34:39,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:39,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760414642] [2025-04-13 22:34:39,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760414642] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:39,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:39,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:34:39,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129510257] [2025-04-13 22:34:39,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:39,037 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:34:39,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:39,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:34:39,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:34:39,037 INFO L87 Difference]: Start difference. First operand 2782 states and 10361 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:39,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:39,321 INFO L93 Difference]: Finished difference Result 4913 states and 18487 transitions. [2025-04-13 22:34:39,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:34:39,321 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:34:39,321 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:39,344 INFO L225 Difference]: With dead ends: 4913 [2025-04-13 22:34:39,345 INFO L226 Difference]: Without dead ends: 4365 [2025-04-13 22:34:39,348 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:34:39,349 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 79 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:39,349 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 19 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:34:39,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4365 states. [2025-04-13 22:34:39,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4365 to 2918. [2025-04-13 22:34:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2918 states, 2917 states have (on average 3.7480287967089474) internal successors, (10933), 2917 states have internal predecessors, (10933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 10933 transitions. [2025-04-13 22:34:39,476 INFO L79 Accepts]: Start accepts. Automaton has 2918 states and 10933 transitions. Word has length 37 [2025-04-13 22:34:39,477 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:39,477 INFO L485 AbstractCegarLoop]: Abstraction has 2918 states and 10933 transitions. [2025-04-13 22:34:39,477 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:39,477 INFO L278 IsEmpty]: Start isEmpty. Operand 2918 states and 10933 transitions. [2025-04-13 22:34:39,485 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:34:39,485 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:39,485 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:39,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:34:39,485 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:39,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:39,486 INFO L85 PathProgramCache]: Analyzing trace with hash 108471398, now seen corresponding path program 3 times [2025-04-13 22:34:39,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:39,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836467027] [2025-04-13 22:34:39,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:39,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:39,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 2 equivalence classes. [2025-04-13 22:34:39,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 37 statements. [2025-04-13 22:34:39,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:34:39,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:39,564 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 22:34:39,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:39,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836467027] [2025-04-13 22:34:39,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836467027] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:39,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:39,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:34:39,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094973626] [2025-04-13 22:34:39,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:39,564 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:34:39,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:39,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:34:39,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:34:39,565 INFO L87 Difference]: Start difference. First operand 2918 states and 10933 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:39,855 INFO L93 Difference]: Finished difference Result 6307 states and 23563 transitions. [2025-04-13 22:34:39,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:34:39,856 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:34:39,856 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:39,879 INFO L225 Difference]: With dead ends: 6307 [2025-04-13 22:34:39,879 INFO L226 Difference]: Without dead ends: 5387 [2025-04-13 22:34:39,883 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:34:39,886 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 94 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:39,886 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 19 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:34:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2025-04-13 22:34:39,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 3146. [2025-04-13 22:34:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3146 states, 3145 states have (on average 3.7523052464228934) internal successors, (11801), 3145 states have internal predecessors, (11801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:39,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 11801 transitions. [2025-04-13 22:34:39,997 INFO L79 Accepts]: Start accepts. Automaton has 3146 states and 11801 transitions. Word has length 37 [2025-04-13 22:34:39,997 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:39,997 INFO L485 AbstractCegarLoop]: Abstraction has 3146 states and 11801 transitions. [2025-04-13 22:34:39,997 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:39,997 INFO L278 IsEmpty]: Start isEmpty. Operand 3146 states and 11801 transitions. [2025-04-13 22:34:40,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:34:40,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:40,003 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:40,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:34:40,003 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:40,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:40,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1752666880, now seen corresponding path program 4 times [2025-04-13 22:34:40,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:40,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88595274] [2025-04-13 22:34:40,004 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:40,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:40,014 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-13 22:34:40,019 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 37 statements. [2025-04-13 22:34:40,020 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:34:40,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:40,051 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 22:34:40,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:40,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88595274] [2025-04-13 22:34:40,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88595274] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:40,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:40,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:34:40,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707286188] [2025-04-13 22:34:40,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:40,051 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:34:40,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:40,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:34:40,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:34:40,052 INFO L87 Difference]: Start difference. First operand 3146 states and 11801 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:40,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:40,305 INFO L93 Difference]: Finished difference Result 4056 states and 14916 transitions. [2025-04-13 22:34:40,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:34:40,306 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:34:40,306 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:40,321 INFO L225 Difference]: With dead ends: 4056 [2025-04-13 22:34:40,321 INFO L226 Difference]: Without dead ends: 3722 [2025-04-13 22:34:40,323 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 22:34:40,323 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 123 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:40,324 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 22 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:34:40,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2025-04-13 22:34:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 2910. [2025-04-13 22:34:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2909 states have (on average 3.750085940185631) internal successors, (10909), 2909 states have internal predecessors, (10909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 10909 transitions. [2025-04-13 22:34:40,425 INFO L79 Accepts]: Start accepts. Automaton has 2910 states and 10909 transitions. Word has length 37 [2025-04-13 22:34:40,425 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:40,425 INFO L485 AbstractCegarLoop]: Abstraction has 2910 states and 10909 transitions. [2025-04-13 22:34:40,425 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:40,425 INFO L278 IsEmpty]: Start isEmpty. Operand 2910 states and 10909 transitions. [2025-04-13 22:34:40,430 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:34:40,430 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:40,430 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:40,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:34:40,430 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:40,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:40,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1143256031, now seen corresponding path program 2 times [2025-04-13 22:34:40,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:40,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603076056] [2025-04-13 22:34:40,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:40,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:40,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 22:34:40,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 37 statements. [2025-04-13 22:34:40,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:34:40,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:40,483 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 22:34:40,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:40,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603076056] [2025-04-13 22:34:40,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603076056] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:40,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:40,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:34:40,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658679388] [2025-04-13 22:34:40,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:40,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:34:40,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:40,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:34:40,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:34:40,484 INFO L87 Difference]: Start difference. First operand 2910 states and 10909 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:40,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:40,730 INFO L93 Difference]: Finished difference Result 4865 states and 18084 transitions. [2025-04-13 22:34:40,730 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:34:40,730 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:34:40,731 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:40,749 INFO L225 Difference]: With dead ends: 4865 [2025-04-13 22:34:40,749 INFO L226 Difference]: Without dead ends: 4261 [2025-04-13 22:34:40,751 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:34:40,751 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 66 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:40,751 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 22 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:34:40,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4261 states. [2025-04-13 22:34:40,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4261 to 2918. [2025-04-13 22:34:40,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2918 states, 2917 states have (on average 3.746657524854302) internal successors, (10929), 2917 states have internal predecessors, (10929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 10929 transitions. [2025-04-13 22:34:40,841 INFO L79 Accepts]: Start accepts. Automaton has 2918 states and 10929 transitions. Word has length 37 [2025-04-13 22:34:40,841 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:40,841 INFO L485 AbstractCegarLoop]: Abstraction has 2918 states and 10929 transitions. [2025-04-13 22:34:40,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:40,841 INFO L278 IsEmpty]: Start isEmpty. Operand 2918 states and 10929 transitions. [2025-04-13 22:34:40,847 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:34:40,847 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:40,847 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:40,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 22:34:40,847 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:40,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:40,847 INFO L85 PathProgramCache]: Analyzing trace with hash -851143467, now seen corresponding path program 3 times [2025-04-13 22:34:40,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:40,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780697489] [2025-04-13 22:34:40,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:40,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:40,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 2 equivalence classes. [2025-04-13 22:34:40,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 37 statements. [2025-04-13 22:34:40,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:34:40,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:40,910 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 22:34:40,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:40,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780697489] [2025-04-13 22:34:40,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780697489] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:40,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:40,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:34:40,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273483537] [2025-04-13 22:34:40,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:40,911 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:34:40,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:40,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:34:40,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:34:40,911 INFO L87 Difference]: Start difference. First operand 2918 states and 10929 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:41,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:41,166 INFO L93 Difference]: Finished difference Result 5001 states and 18654 transitions. [2025-04-13 22:34:41,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:34:41,166 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:34:41,167 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:41,182 INFO L225 Difference]: With dead ends: 5001 [2025-04-13 22:34:41,182 INFO L226 Difference]: Without dead ends: 4405 [2025-04-13 22:34:41,184 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:34:41,185 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 60 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:41,187 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 17 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:34:41,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4405 states. [2025-04-13 22:34:41,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4405 to 3078. [2025-04-13 22:34:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 3077 states have (on average 3.750731231719207) internal successors, (11541), 3077 states have internal predecessors, (11541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:41,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 11541 transitions. [2025-04-13 22:34:41,292 INFO L79 Accepts]: Start accepts. Automaton has 3078 states and 11541 transitions. Word has length 37 [2025-04-13 22:34:41,292 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:41,293 INFO L485 AbstractCegarLoop]: Abstraction has 3078 states and 11541 transitions. [2025-04-13 22:34:41,293 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:41,293 INFO L278 IsEmpty]: Start isEmpty. Operand 3078 states and 11541 transitions. [2025-04-13 22:34:41,298 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:34:41,298 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:41,299 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:41,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 22:34:41,300 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:41,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:41,300 INFO L85 PathProgramCache]: Analyzing trace with hash -129590759, now seen corresponding path program 4 times [2025-04-13 22:34:41,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:41,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360615348] [2025-04-13 22:34:41,300 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:41,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:41,307 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-13 22:34:41,311 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 37 statements. [2025-04-13 22:34:41,311 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:34:41,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:41,346 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 22:34:41,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:41,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360615348] [2025-04-13 22:34:41,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360615348] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:41,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:41,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:34:41,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364091448] [2025-04-13 22:34:41,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:41,346 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:34:41,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:41,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:34:41,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:34:41,347 INFO L87 Difference]: Start difference. First operand 3078 states and 11541 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:41,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:41,671 INFO L93 Difference]: Finished difference Result 5492 states and 20773 transitions. [2025-04-13 22:34:41,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:34:41,671 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:34:41,671 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:41,689 INFO L225 Difference]: With dead ends: 5492 [2025-04-13 22:34:41,689 INFO L226 Difference]: Without dead ends: 4755 [2025-04-13 22:34:41,691 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:34:41,692 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 89 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:41,692 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 20 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:34:41,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2025-04-13 22:34:41,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 3088. [2025-04-13 22:34:41,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3088 states, 3087 states have (on average 3.765468091998704) internal successors, (11624), 3087 states have internal predecessors, (11624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 11624 transitions. [2025-04-13 22:34:41,861 INFO L79 Accepts]: Start accepts. Automaton has 3088 states and 11624 transitions. Word has length 37 [2025-04-13 22:34:41,861 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:41,861 INFO L485 AbstractCegarLoop]: Abstraction has 3088 states and 11624 transitions. [2025-04-13 22:34:41,861 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:41,862 INFO L278 IsEmpty]: Start isEmpty. Operand 3088 states and 11624 transitions. [2025-04-13 22:34:41,867 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:34:41,867 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:41,867 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:41,867 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 22:34:41,867 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:41,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:41,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1981948734, now seen corresponding path program 5 times [2025-04-13 22:34:41,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:41,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386232961] [2025-04-13 22:34:41,868 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:41,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:41,874 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 22:34:41,879 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:34:41,879 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:41,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:41,934 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 22:34:41,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:41,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386232961] [2025-04-13 22:34:41,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386232961] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:41,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282347115] [2025-04-13 22:34:41,935 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:41,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:41,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:41,937 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:34:41,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 22:34:41,987 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 22:34:42,007 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:34:42,007 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:42,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:42,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 22:34:42,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:42,067 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 22:34:42,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:42,111 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 22:34:42,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282347115] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:42,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:34:42,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-04-13 22:34:42,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95051101] [2025-04-13 22:34:42,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:42,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:34:42,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:42,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:34:42,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:42,112 INFO L87 Difference]: Start difference. First operand 3088 states and 11624 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:42,292 INFO L93 Difference]: Finished difference Result 4263 states and 16069 transitions. [2025-04-13 22:34:42,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:34:42,292 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:34:42,293 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:42,309 INFO L225 Difference]: With dead ends: 4263 [2025-04-13 22:34:42,310 INFO L226 Difference]: Without dead ends: 3352 [2025-04-13 22:34:42,312 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 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 22:34:42,313 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 156 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:42,313 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 7 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:34:42,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2025-04-13 22:34:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 2696. [2025-04-13 22:34:42,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2696 states, 2695 states have (on average 3.7669758812615957) internal successors, (10152), 2695 states have internal predecessors, (10152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 10152 transitions. [2025-04-13 22:34:42,440 INFO L79 Accepts]: Start accepts. Automaton has 2696 states and 10152 transitions. Word has length 37 [2025-04-13 22:34:42,440 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:42,440 INFO L485 AbstractCegarLoop]: Abstraction has 2696 states and 10152 transitions. [2025-04-13 22:34:42,440 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:42,440 INFO L278 IsEmpty]: Start isEmpty. Operand 2696 states and 10152 transitions. [2025-04-13 22:34:42,444 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:34:42,444 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:42,444 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:42,450 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 22:34:42,644 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:42,645 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:42,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:42,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1101289115, now seen corresponding path program 5 times [2025-04-13 22:34:42,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:42,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682844858] [2025-04-13 22:34:42,645 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:42,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:42,651 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 22:34:42,658 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:34:42,658 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:42,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:42,710 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 22:34:42,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:42,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682844858] [2025-04-13 22:34:42,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682844858] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:42,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743219579] [2025-04-13 22:34:42,710 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:34:42,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:42,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:42,712 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:34:42,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 22:34:42,764 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 22:34:42,783 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:34:42,783 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:42,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:42,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 22:34:42,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:42,835 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 22:34:42,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:42,876 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 22:34:42,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743219579] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:42,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:34:42,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-04-13 22:34:42,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343066152] [2025-04-13 22:34:42,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:42,877 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:34:42,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:42,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:34:42,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:42,877 INFO L87 Difference]: Start difference. First operand 2696 states and 10152 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:43,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:43,075 INFO L93 Difference]: Finished difference Result 4027 states and 15254 transitions. [2025-04-13 22:34:43,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:34:43,075 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:34:43,075 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:43,087 INFO L225 Difference]: With dead ends: 4027 [2025-04-13 22:34:43,087 INFO L226 Difference]: Without dead ends: 3230 [2025-04-13 22:34:43,089 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 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 22:34:43,089 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 58 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:43,089 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 8 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:34:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2025-04-13 22:34:43,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 2696. [2025-04-13 22:34:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2696 states, 2695 states have (on average 3.7669758812615957) internal successors, (10152), 2695 states have internal predecessors, (10152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:43,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 10152 transitions. [2025-04-13 22:34:43,196 INFO L79 Accepts]: Start accepts. Automaton has 2696 states and 10152 transitions. Word has length 37 [2025-04-13 22:34:43,196 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:43,196 INFO L485 AbstractCegarLoop]: Abstraction has 2696 states and 10152 transitions. [2025-04-13 22:34:43,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:43,196 INFO L278 IsEmpty]: Start isEmpty. Operand 2696 states and 10152 transitions. [2025-04-13 22:34:43,201 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:34:43,201 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:43,201 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:43,207 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 22:34:43,405 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:43,405 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:43,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:43,405 INFO L85 PathProgramCache]: Analyzing trace with hash -489431643, now seen corresponding path program 1 times [2025-04-13 22:34:43,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:43,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142024548] [2025-04-13 22:34:43,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:43,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:43,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:34:43,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:34:43,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:43,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:44,030 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 22:34:44,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:44,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142024548] [2025-04-13 22:34:44,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142024548] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:44,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707221151] [2025-04-13 22:34:44,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:44,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:44,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:44,033 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:34:44,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 22:34:44,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:34:44,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:34:44,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:44,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:44,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:34:44,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:44,218 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 19 treesize of output 7 [2025-04-13 22:34:44,239 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 22:34:44,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:44,315 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:44,315 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2025-04-13 22:34:44,330 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 22:34:44,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707221151] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:44,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:44,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2025-04-13 22:34:44,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683246790] [2025-04-13 22:34:44,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:44,331 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:34:44,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:44,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:34:44,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:34:44,332 INFO L87 Difference]: Start difference. First operand 2696 states and 10152 transitions. Second operand has 19 states, 18 states have (on average 4.277777777777778) internal successors, (77), 19 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:45,601 INFO L93 Difference]: Finished difference Result 7096 states and 27035 transitions. [2025-04-13 22:34:45,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:34:45,602 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.277777777777778) internal successors, (77), 19 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:34:45,602 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:45,628 INFO L225 Difference]: With dead ends: 7096 [2025-04-13 22:34:45,629 INFO L226 Difference]: Without dead ends: 6821 [2025-04-13 22:34:45,632 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:34:45,632 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 336 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1991 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:45,632 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 125 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1991 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:34:45,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2025-04-13 22:34:45,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 3020. [2025-04-13 22:34:45,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3020 states, 3019 states have (on average 3.7946339847631667) internal successors, (11456), 3019 states have internal predecessors, (11456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 11456 transitions. [2025-04-13 22:34:45,852 INFO L79 Accepts]: Start accepts. Automaton has 3020 states and 11456 transitions. Word has length 40 [2025-04-13 22:34:45,853 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:45,853 INFO L485 AbstractCegarLoop]: Abstraction has 3020 states and 11456 transitions. [2025-04-13 22:34:45,853 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.277777777777778) internal successors, (77), 19 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:45,853 INFO L278 IsEmpty]: Start isEmpty. Operand 3020 states and 11456 transitions. [2025-04-13 22:34:45,858 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:34:45,859 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:45,859 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:45,865 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 22:34:46,059 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 22:34:46,059 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:46,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:46,060 INFO L85 PathProgramCache]: Analyzing trace with hash 73963984, now seen corresponding path program 1 times [2025-04-13 22:34:46,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:46,060 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354686890] [2025-04-13 22:34:46,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:46,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:46,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:34:46,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:34:46,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:46,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:46,437 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 22:34:46,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:46,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354686890] [2025-04-13 22:34:46,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354686890] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:46,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36849696] [2025-04-13 22:34:46,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:34:46,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:46,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:46,439 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:34:46,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 22:34:46,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:34:46,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:34:46,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:34:46,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:46,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:34:46,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:46,616 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 19 treesize of output 7 [2025-04-13 22:34:46,631 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 22:34:46,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:46,707 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:46,707 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2025-04-13 22:34:46,712 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 22:34:46,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36849696] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:46,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:46,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 19 [2025-04-13 22:34:46,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945719530] [2025-04-13 22:34:46,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:46,713 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:34:46,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:46,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:34:46,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:34:46,714 INFO L87 Difference]: Start difference. First operand 3020 states and 11456 transitions. Second operand has 20 states, 19 states have (on average 4.315789473684211) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:47,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:47,892 INFO L93 Difference]: Finished difference Result 7111 states and 27172 transitions. [2025-04-13 22:34:47,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:34:47,892 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.315789473684211) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:34:47,892 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:47,915 INFO L225 Difference]: With dead ends: 7111 [2025-04-13 22:34:47,916 INFO L226 Difference]: Without dead ends: 6860 [2025-04-13 22:34:47,919 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:34:47,920 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 399 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:47,920 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 109 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1796 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:34:47,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6860 states. [2025-04-13 22:34:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6860 to 3172. [2025-04-13 22:34:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3172 states, 3171 states have (on average 3.7918637653736993) internal successors, (12024), 3171 states have internal predecessors, (12024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 12024 transitions. [2025-04-13 22:34:48,145 INFO L79 Accepts]: Start accepts. Automaton has 3172 states and 12024 transitions. Word has length 40 [2025-04-13 22:34:48,145 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:48,145 INFO L485 AbstractCegarLoop]: Abstraction has 3172 states and 12024 transitions. [2025-04-13 22:34:48,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.315789473684211) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:48,145 INFO L278 IsEmpty]: Start isEmpty. Operand 3172 states and 12024 transitions. [2025-04-13 22:34:48,151 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:34:48,151 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:48,151 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:48,157 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 22:34:48,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 22:34:48,352 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:48,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:48,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1124578587, now seen corresponding path program 2 times [2025-04-13 22:34:48,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:48,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202563924] [2025-04-13 22:34:48,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:48,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:48,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:34:48,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 22:34:48,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:34:48,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:48,585 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 22:34:48,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:48,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202563924] [2025-04-13 22:34:48,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202563924] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:48,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:48,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:34:48,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632167191] [2025-04-13 22:34:48,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:48,586 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:34:48,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:48,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:34:48,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:34:48,586 INFO L87 Difference]: Start difference. First operand 3172 states and 12024 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 22:34:49,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:49,479 INFO L93 Difference]: Finished difference Result 5685 states and 21675 transitions. [2025-04-13 22:34:49,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:34:49,479 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 40 [2025-04-13 22:34:49,479 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:49,497 INFO L225 Difference]: With dead ends: 5685 [2025-04-13 22:34:49,498 INFO L226 Difference]: Without dead ends: 5410 [2025-04-13 22:34:49,500 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:49,500 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 180 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:49,500 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 58 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:49,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2025-04-13 22:34:49,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 3248. [2025-04-13 22:34:49,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3248 states, 3247 states have (on average 3.7961194949183863) internal successors, (12326), 3247 states have internal predecessors, (12326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 12326 transitions. [2025-04-13 22:34:49,702 INFO L79 Accepts]: Start accepts. Automaton has 3248 states and 12326 transitions. Word has length 40 [2025-04-13 22:34:49,702 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:49,702 INFO L485 AbstractCegarLoop]: Abstraction has 3248 states and 12326 transitions. [2025-04-13 22:34:49,702 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 22:34:49,702 INFO L278 IsEmpty]: Start isEmpty. Operand 3248 states and 12326 transitions. [2025-04-13 22:34:49,708 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:34:49,708 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:49,708 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:49,708 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 22:34:49,708 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:49,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:49,708 INFO L85 PathProgramCache]: Analyzing trace with hash 794966897, now seen corresponding path program 3 times [2025-04-13 22:34:49,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:49,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10368079] [2025-04-13 22:34:49,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:49,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:49,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:34:49,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 22:34:49,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:34:49,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:49,889 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 22:34:49,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:49,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10368079] [2025-04-13 22:34:49,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10368079] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:49,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:49,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:34:49,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448820517] [2025-04-13 22:34:49,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:49,890 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:34:49,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:49,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:34:49,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:34:49,891 INFO L87 Difference]: Start difference. First operand 3248 states and 12326 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:34:50,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:50,567 INFO L93 Difference]: Finished difference Result 5690 states and 21677 transitions. [2025-04-13 22:34:50,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:34:50,567 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 40 [2025-04-13 22:34:50,567 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:50,585 INFO L225 Difference]: With dead ends: 5690 [2025-04-13 22:34:50,585 INFO L226 Difference]: Without dead ends: 5439 [2025-04-13 22:34:50,587 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:50,587 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 181 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:50,587 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 46 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:34:50,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5439 states. [2025-04-13 22:34:50,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5439 to 3359. [2025-04-13 22:34:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3359 states, 3358 states have (on average 3.794818344252531) internal successors, (12743), 3358 states have internal predecessors, (12743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 12743 transitions. [2025-04-13 22:34:50,806 INFO L79 Accepts]: Start accepts. Automaton has 3359 states and 12743 transitions. Word has length 40 [2025-04-13 22:34:50,806 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:50,806 INFO L485 AbstractCegarLoop]: Abstraction has 3359 states and 12743 transitions. [2025-04-13 22:34:50,806 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:34:50,806 INFO L278 IsEmpty]: Start isEmpty. Operand 3359 states and 12743 transitions. [2025-04-13 22:34:50,811 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:34:50,811 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:50,812 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:50,812 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 22:34:50,812 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:50,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1614217109, now seen corresponding path program 4 times [2025-04-13 22:34:50,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:50,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756690984] [2025-04-13 22:34:50,812 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:34:50,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:50,821 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:34:50,828 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:34:50,828 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:34:50,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:51,001 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 22:34:51,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:51,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756690984] [2025-04-13 22:34:51,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756690984] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:34:51,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:34:51,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:34:51,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3019914] [2025-04-13 22:34:51,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:34:51,002 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:34:51,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:51,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:34:51,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:34:51,002 INFO L87 Difference]: Start difference. First operand 3359 states and 12743 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 22:34:51,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:51,933 INFO L93 Difference]: Finished difference Result 6272 states and 23912 transitions. [2025-04-13 22:34:51,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:34:51,934 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 40 [2025-04-13 22:34:51,934 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:51,951 INFO L225 Difference]: With dead ends: 6272 [2025-04-13 22:34:51,951 INFO L226 Difference]: Without dead ends: 5997 [2025-04-13 22:34:51,953 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:34:51,954 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 191 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:51,954 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 73 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:34:51,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2025-04-13 22:34:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3471. [2025-04-13 22:34:52,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3471 states, 3470 states have (on average 3.8129682997118155) internal successors, (13231), 3470 states have internal predecessors, (13231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 13231 transitions. [2025-04-13 22:34:52,203 INFO L79 Accepts]: Start accepts. Automaton has 3471 states and 13231 transitions. Word has length 40 [2025-04-13 22:34:52,203 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:52,203 INFO L485 AbstractCegarLoop]: Abstraction has 3471 states and 13231 transitions. [2025-04-13 22:34:52,203 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 22:34:52,203 INFO L278 IsEmpty]: Start isEmpty. Operand 3471 states and 13231 transitions. [2025-04-13 22:34:52,209 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:34:52,209 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:52,209 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:52,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 22:34:52,209 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:52,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:52,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1380046386, now seen corresponding path program 2 times [2025-04-13 22:34:52,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:52,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630922805] [2025-04-13 22:34:52,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:52,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:52,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:34:52,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:34:52,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:52,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:52,442 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 22:34:52,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:52,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630922805] [2025-04-13 22:34:52,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630922805] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:52,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742466220] [2025-04-13 22:34:52,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:34:52,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:52,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:52,444 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:34:52,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 22:34:52,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:34:52,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:34:52,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:34:52,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:52,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:34:52,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:52,716 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 15 treesize of output 7 [2025-04-13 22:34:52,742 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 22:34:52,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:52,839 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:52,839 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2025-04-13 22:34:52,844 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 22:34:52,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742466220] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:52,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:52,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 21 [2025-04-13 22:34:52,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505798417] [2025-04-13 22:34:52,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:52,845 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:34:52,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:52,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:34:52,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:34:52,846 INFO L87 Difference]: Start difference. First operand 3471 states and 13231 transitions. Second operand has 22 states, 21 states have (on average 4.238095238095238) internal successors, (89), 22 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:54,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:34:54,202 INFO L93 Difference]: Finished difference Result 6584 states and 25160 transitions. [2025-04-13 22:34:54,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:34:54,203 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.238095238095238) internal successors, (89), 22 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:34:54,203 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:34:54,222 INFO L225 Difference]: With dead ends: 6584 [2025-04-13 22:34:54,222 INFO L226 Difference]: Without dead ends: 6333 [2025-04-13 22:34:54,224 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=903, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:34:54,224 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 392 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2311 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 2315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:34:54,224 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 157 Invalid, 2315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2311 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:34:54,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6333 states. [2025-04-13 22:34:54,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6333 to 3383. [2025-04-13 22:34:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3383 states, 3382 states have (on average 3.792134831460674) internal successors, (12825), 3382 states have internal predecessors, (12825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 3383 states and 12825 transitions. [2025-04-13 22:34:54,483 INFO L79 Accepts]: Start accepts. Automaton has 3383 states and 12825 transitions. Word has length 40 [2025-04-13 22:34:54,483 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:34:54,483 INFO L485 AbstractCegarLoop]: Abstraction has 3383 states and 12825 transitions. [2025-04-13 22:34:54,483 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.238095238095238) internal successors, (89), 22 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:54,483 INFO L278 IsEmpty]: Start isEmpty. Operand 3383 states and 12825 transitions. [2025-04-13 22:34:54,488 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:34:54,488 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:34:54,488 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:34:54,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 22:34:54,690 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:54,690 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:34:54,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:34:54,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1215157106, now seen corresponding path program 3 times [2025-04-13 22:34:54,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:34:54,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182939874] [2025-04-13 22:34:54,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:54,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:34:54,696 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:34:54,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:34:54,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:34:54,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:54,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 22:34:54,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:34:54,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182939874] [2025-04-13 22:34:54,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182939874] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:34:54,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130817308] [2025-04-13 22:34:54,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:34:54,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:34:54,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:34:54,923 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:34:54,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 22:34:54,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:34:55,007 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:34:55,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:34:55,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:34:55,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:34:55,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:34:55,038 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 22:34:55,215 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:34:55,215 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-04-13 22:34:55,299 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 22:34:55,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:34:55,553 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 22:34:55,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130817308] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:34:55,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:34:55,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 25 [2025-04-13 22:34:55,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004181405] [2025-04-13 22:34:55,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:34:55,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:34:55,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:34:55,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:34:55,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:34:55,554 INFO L87 Difference]: Start difference. First operand 3383 states and 12825 transitions. Second operand has 26 states, 25 states have (on average 3.64) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:34:59,047 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:35:02,509 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:35:07,464 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:35:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:08,500 INFO L93 Difference]: Finished difference Result 8582 states and 32036 transitions. [2025-04-13 22:35:08,501 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:35:08,501 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.64) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:35:08,501 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:08,524 INFO L225 Difference]: With dead ends: 8582 [2025-04-13 22:35:08,524 INFO L226 Difference]: Without dead ends: 8089 [2025-04-13 22:35:08,527 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=358, Invalid=2192, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:35:08,527 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 696 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 2931 mSolverCounterSat, 29 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2931 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:08,527 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 183 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2931 Invalid, 3 Unknown, 0 Unchecked, 11.3s Time] [2025-04-13 22:35:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8089 states. [2025-04-13 22:35:08,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8089 to 3875. [2025-04-13 22:35:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3875 states, 3874 states have (on average 3.8025296850800205) internal successors, (14731), 3874 states have internal predecessors, (14731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3875 states to 3875 states and 14731 transitions. [2025-04-13 22:35:08,923 INFO L79 Accepts]: Start accepts. Automaton has 3875 states and 14731 transitions. Word has length 40 [2025-04-13 22:35:08,923 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:08,923 INFO L485 AbstractCegarLoop]: Abstraction has 3875 states and 14731 transitions. [2025-04-13 22:35:08,923 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.64) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:08,923 INFO L278 IsEmpty]: Start isEmpty. Operand 3875 states and 14731 transitions. [2025-04-13 22:35:08,929 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:08,929 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:08,929 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:08,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 22:35:09,133 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-13 22:35:09,133 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:09,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:09,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1823373322, now seen corresponding path program 4 times [2025-04-13 22:35:09,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:09,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650819004] [2025-04-13 22:35:09,133 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:35:09,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:09,139 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:09,145 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:09,145 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:35:09,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:09,271 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 22:35:09,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:09,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650819004] [2025-04-13 22:35:09,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650819004] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:09,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996133225] [2025-04-13 22:35:09,272 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:35:09,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:09,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:09,274 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:35:09,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 22:35:09,335 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:09,357 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:09,357 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:35:09,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:09,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:35:09,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:09,452 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 19 treesize of output 7 [2025-04-13 22:35:09,481 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 22:35:09,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:09,539 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:09,539 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2025-04-13 22:35:09,545 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 22:35:09,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996133225] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:35:09,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:35:09,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 22:35:09,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072893643] [2025-04-13 22:35:09,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:35:09,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:35:09,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:09,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:35:09,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:35:09,546 INFO L87 Difference]: Start difference. First operand 3875 states and 14731 transitions. Second operand has 15 states, 14 states have (on average 5.071428571428571) internal successors, (71), 15 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 22:35:10,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:10,677 INFO L93 Difference]: Finished difference Result 6220 states and 23664 transitions. [2025-04-13 22:35:10,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:35:10,677 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.071428571428571) internal successors, (71), 15 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 40 [2025-04-13 22:35:10,677 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:10,698 INFO L225 Difference]: With dead ends: 6220 [2025-04-13 22:35:10,698 INFO L226 Difference]: Without dead ends: 5999 [2025-04-13 22:35:10,700 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:35:10,701 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 254 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:10,701 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 62 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5999 states. [2025-04-13 22:35:11,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5999 to 3911. [2025-04-13 22:35:11,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3911 states, 3910 states have (on average 3.8104859335038364) internal successors, (14899), 3910 states have internal predecessors, (14899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3911 states to 3911 states and 14899 transitions. [2025-04-13 22:35:11,085 INFO L79 Accepts]: Start accepts. Automaton has 3911 states and 14899 transitions. Word has length 40 [2025-04-13 22:35:11,086 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:11,086 INFO L485 AbstractCegarLoop]: Abstraction has 3911 states and 14899 transitions. [2025-04-13 22:35:11,086 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.071428571428571) internal successors, (71), 15 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 22:35:11,086 INFO L278 IsEmpty]: Start isEmpty. Operand 3911 states and 14899 transitions. [2025-04-13 22:35:11,091 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:11,091 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:11,091 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:11,097 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 22:35:11,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:11,292 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:11,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:11,292 INFO L85 PathProgramCache]: Analyzing trace with hash -82430864, now seen corresponding path program 5 times [2025-04-13 22:35:11,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:11,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415438004] [2025-04-13 22:35:11,293 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:11,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:11,298 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:11,306 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:11,306 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:11,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:11,578 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 22:35:11,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:11,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415438004] [2025-04-13 22:35:11,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415438004] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:11,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106870685] [2025-04-13 22:35:11,579 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:11,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:11,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:11,581 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:35:11,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 22:35:11,636 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:11,654 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:11,655 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:11,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:11,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:35:11,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:11,794 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 15 treesize of output 7 [2025-04-13 22:35:11,809 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 22:35:11,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:11,885 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:11,885 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2025-04-13 22:35:11,892 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 22:35:11,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106870685] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:11,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:11,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 19 [2025-04-13 22:35:11,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039446598] [2025-04-13 22:35:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:11,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:35:11,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:11,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:35:11,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:35:11,893 INFO L87 Difference]: Start difference. First operand 3911 states and 14899 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:13,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:13,027 INFO L93 Difference]: Finished difference Result 6075 states and 23227 transitions. [2025-04-13 22:35:13,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:35:13,027 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 40 [2025-04-13 22:35:13,028 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:13,045 INFO L225 Difference]: With dead ends: 6075 [2025-04-13 22:35:13,045 INFO L226 Difference]: Without dead ends: 5824 [2025-04-13 22:35:13,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:35:13,047 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 169 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:13,047 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 64 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:13,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2025-04-13 22:35:13,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 3921. [2025-04-13 22:35:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3920 states have (on average 3.8102040816326532) internal successors, (14936), 3920 states have internal predecessors, (14936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 14936 transitions. [2025-04-13 22:35:13,416 INFO L79 Accepts]: Start accepts. Automaton has 3921 states and 14936 transitions. Word has length 40 [2025-04-13 22:35:13,416 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:13,416 INFO L485 AbstractCegarLoop]: Abstraction has 3921 states and 14936 transitions. [2025-04-13 22:35:13,416 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:13,416 INFO L278 IsEmpty]: Start isEmpty. Operand 3921 states and 14936 transitions. [2025-04-13 22:35:13,422 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:13,422 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:13,422 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:13,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 22:35:13,623 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,SelfDestructingSolverStorable22 [2025-04-13 22:35:13,623 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:13,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:13,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1073357739, now seen corresponding path program 5 times [2025-04-13 22:35:13,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:13,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914358421] [2025-04-13 22:35:13,624 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:13,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:13,630 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:13,638 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:13,638 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:13,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:13,869 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 22:35:13,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:13,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914358421] [2025-04-13 22:35:13,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914358421] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:13,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065709296] [2025-04-13 22:35:13,870 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:13,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:13,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:13,871 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:35:13,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 22:35:13,928 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:13,949 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:13,949 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:13,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:13,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:35:13,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:14,097 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 15 treesize of output 7 [2025-04-13 22:35:14,117 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 22:35:14,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:14,175 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:14,176 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2025-04-13 22:35:14,214 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 22:35:14,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065709296] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:14,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:14,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 19 [2025-04-13 22:35:14,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178737080] [2025-04-13 22:35:14,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:14,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:35:14,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:14,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:35:14,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:35:14,215 INFO L87 Difference]: Start difference. First operand 3921 states and 14936 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:15,245 INFO L93 Difference]: Finished difference Result 5883 states and 22452 transitions. [2025-04-13 22:35:15,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:35:15,245 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 40 [2025-04-13 22:35:15,245 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:15,263 INFO L225 Difference]: With dead ends: 5883 [2025-04-13 22:35:15,263 INFO L226 Difference]: Without dead ends: 5608 [2025-04-13 22:35:15,264 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:35:15,265 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 131 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:15,265 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 56 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:15,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5608 states. [2025-04-13 22:35:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5608 to 4017. [2025-04-13 22:35:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4017 states, 4016 states have (on average 3.806772908366534) internal successors, (15288), 4016 states have internal predecessors, (15288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 15288 transitions. [2025-04-13 22:35:15,660 INFO L79 Accepts]: Start accepts. Automaton has 4017 states and 15288 transitions. Word has length 40 [2025-04-13 22:35:15,661 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:15,661 INFO L485 AbstractCegarLoop]: Abstraction has 4017 states and 15288 transitions. [2025-04-13 22:35:15,661 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:15,661 INFO L278 IsEmpty]: Start isEmpty. Operand 4017 states and 15288 transitions. [2025-04-13 22:35:15,666 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:15,667 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:15,667 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:15,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 22:35:15,868 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-13 22:35:15,868 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:15,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:15,868 INFO L85 PathProgramCache]: Analyzing trace with hash 753604847, now seen corresponding path program 6 times [2025-04-13 22:35:15,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:15,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625235596] [2025-04-13 22:35:15,868 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:35:15,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:15,874 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:15,879 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 22:35:15,879 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:35:15,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:16,016 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 22:35:16,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:16,016 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625235596] [2025-04-13 22:35:16,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625235596] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:16,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:16,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:35:16,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161454941] [2025-04-13 22:35:16,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:16,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:35:16,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:16,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:35:16,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:35:16,017 INFO L87 Difference]: Start difference. First operand 4017 states and 15288 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:17,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:17,010 INFO L93 Difference]: Finished difference Result 5884 states and 22438 transitions. [2025-04-13 22:35:17,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:35:17,010 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 40 [2025-04-13 22:35:17,010 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:17,028 INFO L225 Difference]: With dead ends: 5884 [2025-04-13 22:35:17,028 INFO L226 Difference]: Without dead ends: 5633 [2025-04-13 22:35:17,029 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:35:17,029 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 119 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:17,030 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 45 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:35:17,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5633 states. [2025-04-13 22:35:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5633 to 3993. [2025-04-13 22:35:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3993 states, 3992 states have (on average 3.806112224448898) internal successors, (15194), 3992 states have internal predecessors, (15194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3993 states to 3993 states and 15194 transitions. [2025-04-13 22:35:17,454 INFO L79 Accepts]: Start accepts. Automaton has 3993 states and 15194 transitions. Word has length 40 [2025-04-13 22:35:17,454 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:17,454 INFO L485 AbstractCegarLoop]: Abstraction has 3993 states and 15194 transitions. [2025-04-13 22:35:17,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:17,454 INFO L278 IsEmpty]: Start isEmpty. Operand 3993 states and 15194 transitions. [2025-04-13 22:35:17,460 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:17,460 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:17,460 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:17,460 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 22:35:17,460 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:17,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:17,461 INFO L85 PathProgramCache]: Analyzing trace with hash 826988305, now seen corresponding path program 7 times [2025-04-13 22:35:17,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:17,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744216819] [2025-04-13 22:35:17,461 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:17,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:17,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:35:17,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:17,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:17,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:17,716 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 22:35:17,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:17,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744216819] [2025-04-13 22:35:17,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744216819] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:17,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907453213] [2025-04-13 22:35:17,717 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:17,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:17,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:17,719 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:35:17,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 22:35:17,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:35:17,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:17,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:17,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:17,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:35:17,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:17,911 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 19 treesize of output 7 [2025-04-13 22:35:17,927 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 22:35:17,927 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:35:17,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907453213] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:17,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:35:17,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-04-13 22:35:17,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655046010] [2025-04-13 22:35:17,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:17,928 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:35:17,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:17,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:35:17,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:35:17,928 INFO L87 Difference]: Start difference. First operand 3993 states and 15194 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:19,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:19,016 INFO L93 Difference]: Finished difference Result 6355 states and 24256 transitions. [2025-04-13 22:35:19,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:35:19,016 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 40 [2025-04-13 22:35:19,016 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:19,035 INFO L225 Difference]: With dead ends: 6355 [2025-04-13 22:35:19,036 INFO L226 Difference]: Without dead ends: 6080 [2025-04-13 22:35:19,038 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:35:19,038 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 126 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:19,038 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 47 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:35:19,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6080 states. [2025-04-13 22:35:19,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6080 to 4081. [2025-04-13 22:35:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4081 states, 4080 states have (on average 3.8225490196078433) internal successors, (15596), 4080 states have internal predecessors, (15596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:19,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4081 states to 4081 states and 15596 transitions. [2025-04-13 22:35:19,477 INFO L79 Accepts]: Start accepts. Automaton has 4081 states and 15596 transitions. Word has length 40 [2025-04-13 22:35:19,477 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:19,477 INFO L485 AbstractCegarLoop]: Abstraction has 4081 states and 15596 transitions. [2025-04-13 22:35:19,477 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:19,477 INFO L278 IsEmpty]: Start isEmpty. Operand 4081 states and 15596 transitions. [2025-04-13 22:35:19,483 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:19,483 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:19,483 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:19,489 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 22:35:19,683 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 22:35:19,683 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:19,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:19,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1311489617, now seen corresponding path program 8 times [2025-04-13 22:35:19,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:19,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456737854] [2025-04-13 22:35:19,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:35:19,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:19,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:19,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 22:35:19,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:35:19,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:19,825 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 22:35:19,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:19,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456737854] [2025-04-13 22:35:19,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456737854] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:19,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:19,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:35:19,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092169631] [2025-04-13 22:35:19,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:19,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:35:19,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:19,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:35:19,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:35:19,826 INFO L87 Difference]: Start difference. First operand 4081 states and 15596 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 22:35:21,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:21,013 INFO L93 Difference]: Finished difference Result 6011 states and 23002 transitions. [2025-04-13 22:35:21,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:35:21,013 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 40 [2025-04-13 22:35:21,013 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:21,031 INFO L225 Difference]: With dead ends: 6011 [2025-04-13 22:35:21,031 INFO L226 Difference]: Without dead ends: 5736 [2025-04-13 22:35:21,033 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:35:21,033 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 123 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:21,034 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 40 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:35:21,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5736 states. [2025-04-13 22:35:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5736 to 4153. [2025-04-13 22:35:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4153 states, 4152 states have (on average 3.8241811175337186) internal successors, (15878), 4152 states have internal predecessors, (15878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:21,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4153 states to 4153 states and 15878 transitions. [2025-04-13 22:35:21,480 INFO L79 Accepts]: Start accepts. Automaton has 4153 states and 15878 transitions. Word has length 40 [2025-04-13 22:35:21,480 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:21,480 INFO L485 AbstractCegarLoop]: Abstraction has 4153 states and 15878 transitions. [2025-04-13 22:35:21,480 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 22:35:21,480 INFO L278 IsEmpty]: Start isEmpty. Operand 4153 states and 15878 transitions. [2025-04-13 22:35:21,486 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:21,486 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:21,486 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 22:35:21,486 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:21,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:21,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1107986393, now seen corresponding path program 9 times [2025-04-13 22:35:21,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:21,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565800522] [2025-04-13 22:35:21,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:35:21,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:21,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:21,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 22:35:21,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:35:21,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:21,613 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 22:35:21,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:21,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565800522] [2025-04-13 22:35:21,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565800522] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:21,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:21,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:35:21,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160455009] [2025-04-13 22:35:21,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:21,613 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:35:21,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:21,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:35:21,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:35:21,614 INFO L87 Difference]: Start difference. First operand 4153 states and 15878 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:22,670 INFO L93 Difference]: Finished difference Result 6016 states and 23004 transitions. [2025-04-13 22:35:22,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:35:22,671 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 40 [2025-04-13 22:35:22,671 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:22,695 INFO L225 Difference]: With dead ends: 6016 [2025-04-13 22:35:22,695 INFO L226 Difference]: Without dead ends: 5765 [2025-04-13 22:35:22,697 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:35:22,697 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 99 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:22,698 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 44 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:35:22,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2025-04-13 22:35:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 4129. [2025-04-13 22:35:23,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4129 states, 4128 states have (on average 3.8236434108527133) internal successors, (15784), 4128 states have internal predecessors, (15784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:23,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 15784 transitions. [2025-04-13 22:35:23,161 INFO L79 Accepts]: Start accepts. Automaton has 4129 states and 15784 transitions. Word has length 40 [2025-04-13 22:35:23,162 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:23,162 INFO L485 AbstractCegarLoop]: Abstraction has 4129 states and 15784 transitions. [2025-04-13 22:35:23,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:23,162 INFO L278 IsEmpty]: Start isEmpty. Operand 4129 states and 15784 transitions. [2025-04-13 22:35:23,168 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:23,168 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:23,168 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:23,168 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 22:35:23,168 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:23,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:23,168 INFO L85 PathProgramCache]: Analyzing trace with hash -223574381, now seen corresponding path program 10 times [2025-04-13 22:35:23,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:23,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680129914] [2025-04-13 22:35:23,168 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:35:23,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:23,173 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:23,178 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:23,179 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:35:23,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:23,307 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 22:35:23,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:23,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680129914] [2025-04-13 22:35:23,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680129914] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:23,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325851298] [2025-04-13 22:35:23,307 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:35:23,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:23,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:23,309 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:35:23,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 22:35:23,369 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:23,390 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:23,390 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:35:23,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:23,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:35:23,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:23,485 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 19 treesize of output 7 [2025-04-13 22:35:23,507 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 22:35:23,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:23,543 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:23,544 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2025-04-13 22:35:23,572 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 22:35:23,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325851298] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:35:23,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:35:23,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 22:35:23,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062665565] [2025-04-13 22:35:23,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:35:23,572 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:35:23,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:23,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:35:23,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:35:23,573 INFO L87 Difference]: Start difference. First operand 4129 states and 15784 transitions. Second operand has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 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 22:35:24,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:24,975 INFO L93 Difference]: Finished difference Result 6406 states and 24504 transitions. [2025-04-13 22:35:24,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:35:24,975 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 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 40 [2025-04-13 22:35:24,975 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:24,995 INFO L225 Difference]: With dead ends: 6406 [2025-04-13 22:35:24,995 INFO L226 Difference]: Without dead ends: 6155 [2025-04-13 22:35:24,997 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:35:24,998 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 177 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:24,998 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 81 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:25,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6155 states. [2025-04-13 22:35:25,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6155 to 4351. [2025-04-13 22:35:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4351 states, 4350 states have (on average 3.820229885057471) internal successors, (16618), 4350 states have internal predecessors, (16618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:25,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4351 states to 4351 states and 16618 transitions. [2025-04-13 22:35:25,504 INFO L79 Accepts]: Start accepts. Automaton has 4351 states and 16618 transitions. Word has length 40 [2025-04-13 22:35:25,504 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:25,504 INFO L485 AbstractCegarLoop]: Abstraction has 4351 states and 16618 transitions. [2025-04-13 22:35:25,504 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 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 22:35:25,504 INFO L278 IsEmpty]: Start isEmpty. Operand 4351 states and 16618 transitions. [2025-04-13 22:35:25,511 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:25,511 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:25,511 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:25,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 22:35:25,711 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,SelfDestructingSolverStorable28 [2025-04-13 22:35:25,712 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:25,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:25,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1775561728, now seen corresponding path program 6 times [2025-04-13 22:35:25,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:25,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768411577] [2025-04-13 22:35:25,712 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:35:25,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:25,717 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:25,723 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:25,723 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 22:35:25,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:25,903 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 22:35:25,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:25,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768411577] [2025-04-13 22:35:25,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768411577] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:25,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937158006] [2025-04-13 22:35:25,904 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:35:25,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:25,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:25,906 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:35:25,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 22:35:25,967 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:25,988 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:25,988 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 22:35:25,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:25,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:35:25,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:26,013 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 22:35:26,157 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 15 treesize of output 7 [2025-04-13 22:35:26,176 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 22:35:26,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:26,272 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 22:35:26,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937158006] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:35:26,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:35:26,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 23 [2025-04-13 22:35:26,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72430108] [2025-04-13 22:35:26,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:35:26,272 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:35:26,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:26,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:35:26,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:35:26,273 INFO L87 Difference]: Start difference. First operand 4351 states and 16618 transitions. Second operand has 24 states, 23 states have (on average 3.9565217391304346) internal successors, (91), 24 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:28,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:28,062 INFO L93 Difference]: Finished difference Result 6885 states and 26322 transitions. [2025-04-13 22:35:28,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:35:28,063 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.9565217391304346) internal successors, (91), 24 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:35:28,063 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:28,085 INFO L225 Difference]: With dead ends: 6885 [2025-04-13 22:35:28,085 INFO L226 Difference]: Without dead ends: 6634 [2025-04-13 22:35:28,087 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:35:28,087 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 377 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:28,088 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 125 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1621 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:35:28,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6634 states. [2025-04-13 22:35:28,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6634 to 4239. [2025-04-13 22:35:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4239 states, 4238 states have (on average 3.8060405851816896) internal successors, (16130), 4238 states have internal predecessors, (16130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 16130 transitions. [2025-04-13 22:35:28,719 INFO L79 Accepts]: Start accepts. Automaton has 4239 states and 16130 transitions. Word has length 40 [2025-04-13 22:35:28,719 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:28,719 INFO L485 AbstractCegarLoop]: Abstraction has 4239 states and 16130 transitions. [2025-04-13 22:35:28,719 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.9565217391304346) internal successors, (91), 24 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:28,720 INFO L278 IsEmpty]: Start isEmpty. Operand 4239 states and 16130 transitions. [2025-04-13 22:35:28,726 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:28,726 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:28,726 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:28,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 22:35:28,930 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:28,930 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:28,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:28,931 INFO L85 PathProgramCache]: Analyzing trace with hash 886021048, now seen corresponding path program 7 times [2025-04-13 22:35:28,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:28,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816851857] [2025-04-13 22:35:28,931 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:28,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:28,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:35:28,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:28,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:28,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:29,181 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 22:35:29,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:29,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816851857] [2025-04-13 22:35:29,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816851857] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:29,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500450842] [2025-04-13 22:35:29,182 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:29,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:29,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:29,184 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:35:29,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 22:35:29,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:35:29,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:29,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:29,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:29,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:35:29,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:29,364 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 19 treesize of output 7 [2025-04-13 22:35:29,382 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 22:35:29,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:29,431 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:29,431 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2025-04-13 22:35:29,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 22:35:29,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500450842] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:35:29,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:35:29,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2025-04-13 22:35:29,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859102797] [2025-04-13 22:35:29,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:35:29,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:35:29,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:29,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:35:29,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:35:29,461 INFO L87 Difference]: Start difference. First operand 4239 states and 16130 transitions. Second operand has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:31,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:31,255 INFO L93 Difference]: Finished difference Result 6106 states and 23229 transitions. [2025-04-13 22:35:31,255 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:35:31,255 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:35:31,255 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:31,275 INFO L225 Difference]: With dead ends: 6106 [2025-04-13 22:35:31,275 INFO L226 Difference]: Without dead ends: 5885 [2025-04-13 22:35:31,276 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:35:31,277 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 178 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:31,277 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 114 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:35:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5885 states. [2025-04-13 22:35:31,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5885 to 4215. [2025-04-13 22:35:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4215 states, 4214 states have (on average 3.8001898433792123) internal successors, (16014), 4214 states have internal predecessors, (16014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4215 states to 4215 states and 16014 transitions. [2025-04-13 22:35:31,777 INFO L79 Accepts]: Start accepts. Automaton has 4215 states and 16014 transitions. Word has length 40 [2025-04-13 22:35:31,778 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:31,778 INFO L485 AbstractCegarLoop]: Abstraction has 4215 states and 16014 transitions. [2025-04-13 22:35:31,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:31,778 INFO L278 IsEmpty]: Start isEmpty. Operand 4215 states and 16014 transitions. [2025-04-13 22:35:31,784 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:31,784 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:31,784 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:31,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-13 22:35:31,985 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:31,985 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:31,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:31,985 INFO L85 PathProgramCache]: Analyzing trace with hash -861577536, now seen corresponding path program 8 times [2025-04-13 22:35:31,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:31,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962143437] [2025-04-13 22:35:31,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:35:31,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:31,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:31,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 22:35:31,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:35:31,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:32,113 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 22:35:32,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:32,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962143437] [2025-04-13 22:35:32,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962143437] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:32,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:32,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:35:32,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370488172] [2025-04-13 22:35:32,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:32,114 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:35:32,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:32,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:35:32,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:35:32,115 INFO L87 Difference]: Start difference. First operand 4215 states and 16014 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 22:35:33,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:33,435 INFO L93 Difference]: Finished difference Result 5883 states and 22459 transitions. [2025-04-13 22:35:33,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:35:33,435 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 40 [2025-04-13 22:35:33,435 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:33,453 INFO L225 Difference]: With dead ends: 5883 [2025-04-13 22:35:33,453 INFO L226 Difference]: Without dead ends: 5632 [2025-04-13 22:35:33,454 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:35:33,454 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 149 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:33,454 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 50 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:33,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5632 states. [2025-04-13 22:35:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5632 to 4141. [2025-04-13 22:35:33,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4141 states, 4140 states have (on average 3.7973429951690822) internal successors, (15721), 4140 states have internal predecessors, (15721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 15721 transitions. [2025-04-13 22:35:33,952 INFO L79 Accepts]: Start accepts. Automaton has 4141 states and 15721 transitions. Word has length 40 [2025-04-13 22:35:33,952 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:33,952 INFO L485 AbstractCegarLoop]: Abstraction has 4141 states and 15721 transitions. [2025-04-13 22:35:33,952 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 22:35:33,952 INFO L278 IsEmpty]: Start isEmpty. Operand 4141 states and 15721 transitions. [2025-04-13 22:35:33,958 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:33,958 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:33,958 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:33,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 22:35:33,958 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:33,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:33,959 INFO L85 PathProgramCache]: Analyzing trace with hash -698437040, now seen corresponding path program 9 times [2025-04-13 22:35:33,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:33,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308441370] [2025-04-13 22:35:33,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:35:33,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:33,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:33,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:33,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:35:33,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:34,083 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 22:35:34,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:34,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308441370] [2025-04-13 22:35:34,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308441370] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:34,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308056547] [2025-04-13 22:35:34,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:35:34,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:34,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:34,087 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:35:34,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 22:35:34,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:34,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:34,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:35:34,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:34,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:35:34,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:34,191 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 22:35:34,365 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 15 treesize of output 7 [2025-04-13 22:35:34,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 22:35:34,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:34,596 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 22:35:34,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308056547] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:35:34,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:35:34,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 22 [2025-04-13 22:35:34,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904937616] [2025-04-13 22:35:34,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:35:34,596 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:35:34,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:34,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:35:34,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:35:34,597 INFO L87 Difference]: Start difference. First operand 4141 states and 15721 transitions. Second operand has 23 states, 22 states have (on average 4.0) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:38,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:38,156 INFO L93 Difference]: Finished difference Result 7914 states and 29748 transitions. [2025-04-13 22:35:38,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:35:38,156 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.0) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:35:38,156 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:38,179 INFO L225 Difference]: With dead ends: 7914 [2025-04-13 22:35:38,179 INFO L226 Difference]: Without dead ends: 7693 [2025-04-13 22:35:38,181 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=2321, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:35:38,181 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 444 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 3368 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 3389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:38,181 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 259 Invalid, 3389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3368 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 22:35:38,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7693 states. [2025-04-13 22:35:38,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7693 to 4225. [2025-04-13 22:35:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4225 states, 4224 states have (on average 3.8027935606060606) internal successors, (16063), 4224 states have internal predecessors, (16063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:38,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4225 states to 4225 states and 16063 transitions. [2025-04-13 22:35:38,728 INFO L79 Accepts]: Start accepts. Automaton has 4225 states and 16063 transitions. Word has length 40 [2025-04-13 22:35:38,728 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:38,728 INFO L485 AbstractCegarLoop]: Abstraction has 4225 states and 16063 transitions. [2025-04-13 22:35:38,728 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.0) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:38,728 INFO L278 IsEmpty]: Start isEmpty. Operand 4225 states and 16063 transitions. [2025-04-13 22:35:38,734 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:38,734 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:38,734 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:38,740 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 22:35:38,934 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,SelfDestructingSolverStorable32 [2025-04-13 22:35:38,935 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:38,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:38,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1242650834, now seen corresponding path program 10 times [2025-04-13 22:35:38,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:38,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276423330] [2025-04-13 22:35:38,935 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:35:38,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:38,940 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:38,944 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:38,945 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:35:38,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:39,067 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 22:35:39,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:39,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276423330] [2025-04-13 22:35:39,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276423330] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:39,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:39,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:35:39,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725865435] [2025-04-13 22:35:39,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:39,068 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:35:39,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:39,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:35:39,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:35:39,068 INFO L87 Difference]: Start difference. First operand 4225 states and 16063 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:40,475 INFO L93 Difference]: Finished difference Result 5954 states and 22726 transitions. [2025-04-13 22:35:40,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:35:40,477 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 40 [2025-04-13 22:35:40,477 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:40,496 INFO L225 Difference]: With dead ends: 5954 [2025-04-13 22:35:40,496 INFO L226 Difference]: Without dead ends: 5733 [2025-04-13 22:35:40,497 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:35:40,497 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 117 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:40,498 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 48 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:40,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2025-04-13 22:35:41,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 4247. [2025-04-13 22:35:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4247 states, 4246 states have (on average 3.8040508714083843) internal successors, (16152), 4246 states have internal predecessors, (16152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4247 states to 4247 states and 16152 transitions. [2025-04-13 22:35:41,037 INFO L79 Accepts]: Start accepts. Automaton has 4247 states and 16152 transitions. Word has length 40 [2025-04-13 22:35:41,037 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:41,037 INFO L485 AbstractCegarLoop]: Abstraction has 4247 states and 16152 transitions. [2025-04-13 22:35:41,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:41,037 INFO L278 IsEmpty]: Start isEmpty. Operand 4247 states and 16152 transitions. [2025-04-13 22:35:41,043 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:41,043 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:41,043 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:41,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 22:35:41,043 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:41,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:41,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2104361072, now seen corresponding path program 11 times [2025-04-13 22:35:41,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:41,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649030591] [2025-04-13 22:35:41,044 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:41,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:41,051 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:41,055 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:41,055 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:41,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:41,214 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 22:35:41,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:41,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649030591] [2025-04-13 22:35:41,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649030591] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:41,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418597770] [2025-04-13 22:35:41,215 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:41,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:41,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:41,217 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:35:41,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 22:35:41,275 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:41,292 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:41,292 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:41,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:41,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:35:41,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:41,437 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 15 treesize of output 7 [2025-04-13 22:35:41,450 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 22:35:41,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:41,494 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:41,495 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2025-04-13 22:35:41,527 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 22:35:41,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418597770] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:41,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:41,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 19 [2025-04-13 22:35:41,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913887183] [2025-04-13 22:35:41,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:41,528 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:35:41,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:41,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:35:41,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:35:41,528 INFO L87 Difference]: Start difference. First operand 4247 states and 16152 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:42,831 INFO L93 Difference]: Finished difference Result 5975 states and 22835 transitions. [2025-04-13 22:35:42,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:35:42,831 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 40 [2025-04-13 22:35:42,831 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:42,849 INFO L225 Difference]: With dead ends: 5975 [2025-04-13 22:35:42,849 INFO L226 Difference]: Without dead ends: 5724 [2025-04-13 22:35:42,851 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:35:42,851 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 106 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:42,851 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 53 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:42,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5724 states. [2025-04-13 22:35:43,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5724 to 4247. [2025-04-13 22:35:43,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4247 states, 4246 states have (on average 3.8040508714083843) internal successors, (16152), 4246 states have internal predecessors, (16152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4247 states to 4247 states and 16152 transitions. [2025-04-13 22:35:43,420 INFO L79 Accepts]: Start accepts. Automaton has 4247 states and 16152 transitions. Word has length 40 [2025-04-13 22:35:43,420 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:43,420 INFO L485 AbstractCegarLoop]: Abstraction has 4247 states and 16152 transitions. [2025-04-13 22:35:43,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:43,420 INFO L278 IsEmpty]: Start isEmpty. Operand 4247 states and 16152 transitions. [2025-04-13 22:35:43,427 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:43,427 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:43,427 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:43,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 22:35:43,627 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:43,628 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:43,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:43,628 INFO L85 PathProgramCache]: Analyzing trace with hash -64019787, now seen corresponding path program 11 times [2025-04-13 22:35:43,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:43,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654885365] [2025-04-13 22:35:43,628 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:43,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:43,633 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:43,642 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:43,642 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:43,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:43,860 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 22:35:43,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:43,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654885365] [2025-04-13 22:35:43,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654885365] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:43,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532162174] [2025-04-13 22:35:43,861 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:35:43,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:43,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:43,862 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:35:43,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 22:35:43,920 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:43,937 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:43,938 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:35:43,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:43,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:35:43,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:44,046 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 15 treesize of output 7 [2025-04-13 22:35:44,064 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 22:35:44,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:44,111 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:44,111 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2025-04-13 22:35:44,139 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 22:35:44,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532162174] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:44,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:35:44,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 19 [2025-04-13 22:35:44,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775769557] [2025-04-13 22:35:44,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:44,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:35:44,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:44,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:35:44,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:35:44,140 INFO L87 Difference]: Start difference. First operand 4247 states and 16152 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:45,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:45,437 INFO L93 Difference]: Finished difference Result 6289 states and 24007 transitions. [2025-04-13 22:35:45,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:35:45,438 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 40 [2025-04-13 22:35:45,438 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:45,458 INFO L225 Difference]: With dead ends: 6289 [2025-04-13 22:35:45,458 INFO L226 Difference]: Without dead ends: 6014 [2025-04-13 22:35:45,460 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:35:45,460 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 94 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:45,460 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 51 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:35:45,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2025-04-13 22:35:46,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 4439. [2025-04-13 22:35:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4439 states, 4438 states have (on average 3.8084722848129786) internal successors, (16902), 4438 states have internal predecessors, (16902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:46,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 16902 transitions. [2025-04-13 22:35:46,059 INFO L79 Accepts]: Start accepts. Automaton has 4439 states and 16902 transitions. Word has length 40 [2025-04-13 22:35:46,059 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:46,059 INFO L485 AbstractCegarLoop]: Abstraction has 4439 states and 16902 transitions. [2025-04-13 22:35:46,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:46,060 INFO L278 IsEmpty]: Start isEmpty. Operand 4439 states and 16902 transitions. [2025-04-13 22:35:46,083 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:46,083 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:46,083 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:46,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 22:35:46,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:46,284 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:46,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:46,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1463342511, now seen corresponding path program 12 times [2025-04-13 22:35:46,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:46,284 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041257239] [2025-04-13 22:35:46,284 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:35:46,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:46,289 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:46,292 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 22:35:46,293 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:35:46,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:46,433 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 22:35:46,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:46,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041257239] [2025-04-13 22:35:46,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041257239] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:46,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:46,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:35:46,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314036344] [2025-04-13 22:35:46,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:46,435 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:35:46,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:46,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:35:46,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:35:46,436 INFO L87 Difference]: Start difference. First operand 4439 states and 16902 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:47,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:47,924 INFO L93 Difference]: Finished difference Result 6290 states and 23993 transitions. [2025-04-13 22:35:47,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:35:47,925 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 40 [2025-04-13 22:35:47,925 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:47,945 INFO L225 Difference]: With dead ends: 6290 [2025-04-13 22:35:47,945 INFO L226 Difference]: Without dead ends: 6039 [2025-04-13 22:35:47,947 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:35:47,948 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 85 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:47,948 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 50 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6039 states. [2025-04-13 22:35:48,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6039 to 4415. [2025-04-13 22:35:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4415 states, 4414 states have (on average 3.807884005437245) internal successors, (16808), 4414 states have internal predecessors, (16808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:48,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4415 states to 4415 states and 16808 transitions. [2025-04-13 22:35:48,542 INFO L79 Accepts]: Start accepts. Automaton has 4415 states and 16808 transitions. Word has length 40 [2025-04-13 22:35:48,542 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:48,542 INFO L485 AbstractCegarLoop]: Abstraction has 4415 states and 16808 transitions. [2025-04-13 22:35:48,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:48,542 INFO L278 IsEmpty]: Start isEmpty. Operand 4415 states and 16808 transitions. [2025-04-13 22:35:48,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:48,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:48,549 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:48,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 22:35:48,549 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:48,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:48,550 INFO L85 PathProgramCache]: Analyzing trace with hash -310389221, now seen corresponding path program 13 times [2025-04-13 22:35:48,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:48,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345752307] [2025-04-13 22:35:48,550 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:48,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:48,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:35:48,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:48,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:48,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:48,785 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 22:35:48,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:48,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345752307] [2025-04-13 22:35:48,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345752307] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:48,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615729927] [2025-04-13 22:35:48,786 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:35:48,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:48,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:48,788 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 22:35:48,789 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 22:35:48,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:35:48,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:48,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:35:48,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:48,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:35:48,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:48,982 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 19 treesize of output 7 [2025-04-13 22:35:49,000 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 22:35:49,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:35:49,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615729927] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:49,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:35:49,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-04-13 22:35:49,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834514139] [2025-04-13 22:35:49,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:49,002 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:35:49,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:49,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:35:49,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:35:49,002 INFO L87 Difference]: Start difference. First operand 4415 states and 16808 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:50,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:50,474 INFO L93 Difference]: Finished difference Result 6761 states and 25811 transitions. [2025-04-13 22:35:50,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:35:50,475 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 40 [2025-04-13 22:35:50,475 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:50,496 INFO L225 Difference]: With dead ends: 6761 [2025-04-13 22:35:50,496 INFO L226 Difference]: Without dead ends: 6486 [2025-04-13 22:35:50,497 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:35:50,498 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 87 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:50,498 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 57 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:35:50,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6486 states. [2025-04-13 22:35:51,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6486 to 4503. [2025-04-13 22:35:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4503 states, 4502 states have (on average 3.8227454464682364) internal successors, (17210), 4502 states have internal predecessors, (17210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 17210 transitions. [2025-04-13 22:35:51,118 INFO L79 Accepts]: Start accepts. Automaton has 4503 states and 17210 transitions. Word has length 40 [2025-04-13 22:35:51,119 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:51,119 INFO L485 AbstractCegarLoop]: Abstraction has 4503 states and 17210 transitions. [2025-04-13 22:35:51,119 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:51,119 INFO L278 IsEmpty]: Start isEmpty. Operand 4503 states and 17210 transitions. [2025-04-13 22:35:51,125 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:51,125 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:51,125 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:51,131 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 22:35:51,326 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:51,326 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:51,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash -601751953, now seen corresponding path program 14 times [2025-04-13 22:35:51,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:51,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367844984] [2025-04-13 22:35:51,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:35:51,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:51,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:51,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 22:35:51,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:35:51,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:51,454 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 22:35:51,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:51,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367844984] [2025-04-13 22:35:51,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367844984] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:51,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:51,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:35:51,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532596340] [2025-04-13 22:35:51,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:51,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:35:51,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:51,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:35:51,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:35:51,455 INFO L87 Difference]: Start difference. First operand 4503 states and 17210 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 22:35:52,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:52,901 INFO L93 Difference]: Finished difference Result 6449 states and 24683 transitions. [2025-04-13 22:35:52,901 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:35:52,901 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 40 [2025-04-13 22:35:52,901 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:52,921 INFO L225 Difference]: With dead ends: 6449 [2025-04-13 22:35:52,921 INFO L226 Difference]: Without dead ends: 6174 [2025-04-13 22:35:52,923 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:35:52,923 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 103 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:52,923 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 59 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:52,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6174 states. [2025-04-13 22:35:53,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6174 to 4575. [2025-04-13 22:35:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4575 states, 4574 states have (on average 3.824223874070835) internal successors, (17492), 4574 states have internal predecessors, (17492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4575 states to 4575 states and 17492 transitions. [2025-04-13 22:35:53,568 INFO L79 Accepts]: Start accepts. Automaton has 4575 states and 17492 transitions. Word has length 40 [2025-04-13 22:35:53,568 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:53,568 INFO L485 AbstractCegarLoop]: Abstraction has 4575 states and 17492 transitions. [2025-04-13 22:35:53,568 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 22:35:53,568 INFO L278 IsEmpty]: Start isEmpty. Operand 4575 states and 17492 transitions. [2025-04-13 22:35:53,574 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:53,575 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:53,575 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:53,575 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 22:35:53,575 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:53,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:53,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2049603377, now seen corresponding path program 15 times [2025-04-13 22:35:53,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:53,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495478317] [2025-04-13 22:35:53,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:35:53,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:53,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:53,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 22:35:53,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:35:53,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:53,698 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 22:35:53,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:53,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495478317] [2025-04-13 22:35:53,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495478317] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:35:53,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:35:53,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:35:53,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611977385] [2025-04-13 22:35:53,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:35:53,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:35:53,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:53,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:35:53,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:35:53,699 INFO L87 Difference]: Start difference. First operand 4575 states and 17492 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:55,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:55,126 INFO L93 Difference]: Finished difference Result 6454 states and 24685 transitions. [2025-04-13 22:35:55,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:35:55,126 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 40 [2025-04-13 22:35:55,126 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:55,147 INFO L225 Difference]: With dead ends: 6454 [2025-04-13 22:35:55,147 INFO L226 Difference]: Without dead ends: 6203 [2025-04-13 22:35:55,149 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:35:55,149 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 95 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:55,149 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 54 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:35:55,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6203 states. [2025-04-13 22:35:55,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6203 to 4551. [2025-04-13 22:35:55,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4551 states, 4550 states have (on average 3.8237362637362637) internal successors, (17398), 4550 states have internal predecessors, (17398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4551 states to 4551 states and 17398 transitions. [2025-04-13 22:35:55,802 INFO L79 Accepts]: Start accepts. Automaton has 4551 states and 17398 transitions. Word has length 40 [2025-04-13 22:35:55,802 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:55,802 INFO L485 AbstractCegarLoop]: Abstraction has 4551 states and 17398 transitions. [2025-04-13 22:35:55,802 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:35:55,802 INFO L278 IsEmpty]: Start isEmpty. Operand 4551 states and 17398 transitions. [2025-04-13 22:35:55,808 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:55,808 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:55,809 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:55,809 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 22:35:55,809 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:55,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:55,809 INFO L85 PathProgramCache]: Analyzing trace with hash 486163283, now seen corresponding path program 16 times [2025-04-13 22:35:55,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:55,809 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239525137] [2025-04-13 22:35:55,809 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:35:55,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:55,814 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:55,818 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:55,818 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:35:55,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:55,941 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 22:35:55,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:55,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239525137] [2025-04-13 22:35:55,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239525137] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:55,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305792367] [2025-04-13 22:35:55,942 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:35:55,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:55,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:55,944 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 22:35:55,945 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 22:35:56,010 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:56,030 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:56,030 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:35:56,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:56,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:35:56,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:56,113 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 19 treesize of output 7 [2025-04-13 22:35:56,137 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 22:35:56,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:56,185 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:56,185 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2025-04-13 22:35:56,213 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 22:35:56,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305792367] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:35:56,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:35:56,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 22:35:56,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501930419] [2025-04-13 22:35:56,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:35:56,213 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:35:56,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:56,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:35:56,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:35:56,214 INFO L87 Difference]: Start difference. First operand 4551 states and 17398 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 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 22:35:58,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:35:58,073 INFO L93 Difference]: Finished difference Result 6844 states and 26185 transitions. [2025-04-13 22:35:58,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:35:58,074 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 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 40 [2025-04-13 22:35:58,074 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:35:58,095 INFO L225 Difference]: With dead ends: 6844 [2025-04-13 22:35:58,095 INFO L226 Difference]: Without dead ends: 6593 [2025-04-13 22:35:58,097 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:35:58,097 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 223 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:35:58,097 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 66 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:35:58,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6593 states. [2025-04-13 22:35:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6593 to 4455. [2025-04-13 22:35:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4455 states, 4454 states have (on average 3.825325550067355) internal successors, (17038), 4454 states have internal predecessors, (17038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:35:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4455 states to 4455 states and 17038 transitions. [2025-04-13 22:35:58,751 INFO L79 Accepts]: Start accepts. Automaton has 4455 states and 17038 transitions. Word has length 40 [2025-04-13 22:35:58,752 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:35:58,752 INFO L485 AbstractCegarLoop]: Abstraction has 4455 states and 17038 transitions. [2025-04-13 22:35:58,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 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 22:35:58,752 INFO L278 IsEmpty]: Start isEmpty. Operand 4455 states and 17038 transitions. [2025-04-13 22:35:58,758 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:35:58,758 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:35:58,758 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:35:58,765 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 22:35:58,958 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,SelfDestructingSolverStorable40 [2025-04-13 22:35:58,959 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:35:58,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:35:58,959 INFO L85 PathProgramCache]: Analyzing trace with hash 638184202, now seen corresponding path program 12 times [2025-04-13 22:35:58,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:35:58,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049130351] [2025-04-13 22:35:58,959 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:35:58,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:35:58,964 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:58,969 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:58,969 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 22:35:58,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:59,135 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 22:35:59,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:35:59,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049130351] [2025-04-13 22:35:59,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049130351] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:35:59,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388248068] [2025-04-13 22:35:59,135 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:35:59,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:35:59,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:35:59,137 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 22:35:59,139 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 22:35:59,204 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:35:59,221 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:35:59,221 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 22:35:59,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:35:59,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:35:59,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:35:59,363 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 15 treesize of output 7 [2025-04-13 22:35:59,379 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 22:35:59,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:35:59,426 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:35:59,426 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2025-04-13 22:35:59,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 22:35:59,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388248068] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:35:59,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:35:59,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 21 [2025-04-13 22:35:59,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794864790] [2025-04-13 22:35:59,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:35:59,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:35:59,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:35:59,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:35:59,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:35:59,451 INFO L87 Difference]: Start difference. First operand 4455 states and 17038 transitions. Second operand has 22 states, 21 states have (on average 4.142857142857143) internal successors, (87), 22 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:01,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:01,458 INFO L93 Difference]: Finished difference Result 7089 states and 27121 transitions. [2025-04-13 22:36:01,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:36:01,459 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.142857142857143) internal successors, (87), 22 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:36:01,459 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:01,480 INFO L225 Difference]: With dead ends: 7089 [2025-04-13 22:36:01,481 INFO L226 Difference]: Without dead ends: 6838 [2025-04-13 22:36:01,482 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:36:01,482 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 300 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:01,483 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 120 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:36:01,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6838 states. [2025-04-13 22:36:02,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6838 to 4439. [2025-04-13 22:36:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4439 states, 4438 states have (on average 3.80802163136548) internal successors, (16900), 4438 states have internal predecessors, (16900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 16900 transitions. [2025-04-13 22:36:02,150 INFO L79 Accepts]: Start accepts. Automaton has 4439 states and 16900 transitions. Word has length 40 [2025-04-13 22:36:02,150 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:02,150 INFO L485 AbstractCegarLoop]: Abstraction has 4439 states and 16900 transitions. [2025-04-13 22:36:02,150 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.142857142857143) internal successors, (87), 22 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:02,150 INFO L278 IsEmpty]: Start isEmpty. Operand 4439 states and 16900 transitions. [2025-04-13 22:36:02,157 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:36:02,157 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:02,157 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:02,163 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 22:36:02,357 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 22:36:02,358 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:36:02,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:02,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2127375236, now seen corresponding path program 13 times [2025-04-13 22:36:02,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:02,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815563918] [2025-04-13 22:36:02,358 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:02,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:02,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:36:02,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:36:02,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:02,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:02,562 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 22:36:02,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:02,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815563918] [2025-04-13 22:36:02,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815563918] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:02,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313697840] [2025-04-13 22:36:02,563 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:02,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:02,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:02,565 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 22:36:02,565 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 22:36:02,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:36:02,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:36:02,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:02,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:02,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:36:02,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:02,721 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 19 treesize of output 7 [2025-04-13 22:36:02,736 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 22:36:02,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:02,778 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:02,779 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2025-04-13 22:36:02,805 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 22:36:02,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313697840] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:36:02,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:36:02,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2025-04-13 22:36:02,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13594559] [2025-04-13 22:36:02,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:36:02,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:36:02,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:02,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:36:02,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:36:02,806 INFO L87 Difference]: Start difference. First operand 4439 states and 16900 transitions. Second operand has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:04,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:04,526 INFO L93 Difference]: Finished difference Result 6174 states and 23603 transitions. [2025-04-13 22:36:04,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:36:04,526 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:36:04,526 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:04,545 INFO L225 Difference]: With dead ends: 6174 [2025-04-13 22:36:04,546 INFO L226 Difference]: Without dead ends: 5953 [2025-04-13 22:36:04,547 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:36:04,547 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 185 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:04,547 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 109 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:36:04,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2025-04-13 22:36:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 4461. [2025-04-13 22:36:05,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4461 states, 4460 states have (on average 3.8091928251121074) internal successors, (16989), 4460 states have internal predecessors, (16989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:05,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4461 states to 4461 states and 16989 transitions. [2025-04-13 22:36:05,195 INFO L79 Accepts]: Start accepts. Automaton has 4461 states and 16989 transitions. Word has length 40 [2025-04-13 22:36:05,195 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:05,195 INFO L485 AbstractCegarLoop]: Abstraction has 4461 states and 16989 transitions. [2025-04-13 22:36:05,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:05,195 INFO L278 IsEmpty]: Start isEmpty. Operand 4461 states and 16989 transitions. [2025-04-13 22:36:05,202 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:36:05,202 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:05,202 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:05,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 22:36:05,402 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 22:36:05,402 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:36:05,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:05,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1998955062, now seen corresponding path program 14 times [2025-04-13 22:36:05,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:05,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131283939] [2025-04-13 22:36:05,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:36:05,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:05,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:36:05,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 22:36:05,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:36:05,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:05,540 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 22:36:05,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:05,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131283939] [2025-04-13 22:36:05,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131283939] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:05,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:05,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:36:05,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098792809] [2025-04-13 22:36:05,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:05,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:36:05,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:05,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:36:05,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:36:05,541 INFO L87 Difference]: Start difference. First operand 4461 states and 16989 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 22:36:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:06,984 INFO L93 Difference]: Finished difference Result 6133 states and 23463 transitions. [2025-04-13 22:36:06,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:36:06,984 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 40 [2025-04-13 22:36:06,984 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:07,004 INFO L225 Difference]: With dead ends: 6133 [2025-04-13 22:36:07,004 INFO L226 Difference]: Without dead ends: 5882 [2025-04-13 22:36:07,005 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:36:07,005 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 118 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:07,005 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 45 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:36:07,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5882 states. [2025-04-13 22:36:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5882 to 4439. [2025-04-13 22:36:07,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4439 states, 4438 states have (on average 3.80802163136548) internal successors, (16900), 4438 states have internal predecessors, (16900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 16900 transitions. [2025-04-13 22:36:07,633 INFO L79 Accepts]: Start accepts. Automaton has 4439 states and 16900 transitions. Word has length 40 [2025-04-13 22:36:07,633 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:07,633 INFO L485 AbstractCegarLoop]: Abstraction has 4439 states and 16900 transitions. [2025-04-13 22:36:07,634 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 22:36:07,634 INFO L278 IsEmpty]: Start isEmpty. Operand 4439 states and 16900 transitions. [2025-04-13 22:36:07,640 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:36:07,640 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:07,640 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:07,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-13 22:36:07,640 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:36:07,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:07,641 INFO L85 PathProgramCache]: Analyzing trace with hash 11300624, now seen corresponding path program 15 times [2025-04-13 22:36:07,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:07,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128425879] [2025-04-13 22:36:07,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:36:07,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:07,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:36:07,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:36:07,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:36:07,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:07,769 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 22:36:07,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:07,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128425879] [2025-04-13 22:36:07,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128425879] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:07,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162614676] [2025-04-13 22:36:07,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:36:07,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:07,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:07,771 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 22:36:07,772 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 22:36:07,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:36:07,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:36:07,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:36:07,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:07,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:36:07,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:07,875 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 22:36:08,008 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 15 treesize of output 7 [2025-04-13 22:36:08,017 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 22:36:08,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:08,103 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 22:36:08,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162614676] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:36:08,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:36:08,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 20 [2025-04-13 22:36:08,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226726358] [2025-04-13 22:36:08,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:36:08,103 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:36:08,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:08,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:36:08,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:36:08,104 INFO L87 Difference]: Start difference. First operand 4439 states and 16900 transitions. Second operand has 21 states, 20 states have (on average 4.3) internal successors, (86), 21 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:10,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:10,127 INFO L93 Difference]: Finished difference Result 6532 states and 25001 transitions. [2025-04-13 22:36:10,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:36:10,127 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.3) internal successors, (86), 21 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:36:10,127 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:10,155 INFO L225 Difference]: With dead ends: 6532 [2025-04-13 22:36:10,155 INFO L226 Difference]: Without dead ends: 6311 [2025-04-13 22:36:10,158 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:36:10,158 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 213 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:10,158 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 108 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:36:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6311 states. [2025-04-13 22:36:10,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6311 to 4483. [2025-04-13 22:36:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4483 states, 4482 states have (on average 3.810352521195895) internal successors, (17078), 4482 states have internal predecessors, (17078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4483 states to 4483 states and 17078 transitions. [2025-04-13 22:36:10,831 INFO L79 Accepts]: Start accepts. Automaton has 4483 states and 17078 transitions. Word has length 40 [2025-04-13 22:36:10,832 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:10,832 INFO L485 AbstractCegarLoop]: Abstraction has 4483 states and 17078 transitions. [2025-04-13 22:36:10,832 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.3) internal successors, (86), 21 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:10,832 INFO L278 IsEmpty]: Start isEmpty. Operand 4483 states and 17078 transitions. [2025-04-13 22:36:10,838 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:36:10,838 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:10,838 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:10,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 22:36:11,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:11,039 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:36:11,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:11,039 INFO L85 PathProgramCache]: Analyzing trace with hash 105273308, now seen corresponding path program 16 times [2025-04-13 22:36:11,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:11,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712496020] [2025-04-13 22:36:11,039 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:36:11,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:11,044 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:36:11,048 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:36:11,048 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:36:11,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:11,153 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 22:36:11,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:11,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712496020] [2025-04-13 22:36:11,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712496020] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:11,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:11,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:36:11,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241026732] [2025-04-13 22:36:11,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:11,154 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:36:11,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:11,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:36:11,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:36:11,154 INFO L87 Difference]: Start difference. First operand 4483 states and 17078 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:36:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:12,705 INFO L93 Difference]: Finished difference Result 6194 states and 23687 transitions. [2025-04-13 22:36:12,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:36:12,705 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 40 [2025-04-13 22:36:12,705 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:12,726 INFO L225 Difference]: With dead ends: 6194 [2025-04-13 22:36:12,726 INFO L226 Difference]: Without dead ends: 5973 [2025-04-13 22:36:12,728 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:36:12,728 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 108 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:12,728 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 48 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:12,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2025-04-13 22:36:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 4505. [2025-04-13 22:36:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4505 states, 4504 states have (on average 3.811500888099467) internal successors, (17167), 4504 states have internal predecessors, (17167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4505 states to 4505 states and 17167 transitions. [2025-04-13 22:36:13,420 INFO L79 Accepts]: Start accepts. Automaton has 4505 states and 17167 transitions. Word has length 40 [2025-04-13 22:36:13,421 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:13,421 INFO L485 AbstractCegarLoop]: Abstraction has 4505 states and 17167 transitions. [2025-04-13 22:36:13,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:36:13,421 INFO L278 IsEmpty]: Start isEmpty. Operand 4505 states and 17167 transitions. [2025-04-13 22:36:13,428 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:36:13,428 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:13,428 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:13,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-13 22:36:13,428 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:36:13,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:13,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1394623408, now seen corresponding path program 17 times [2025-04-13 22:36:13,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:13,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616187635] [2025-04-13 22:36:13,429 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:13,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:13,434 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:36:13,438 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:36:13,438 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:13,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:13,599 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 22:36:13,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:13,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616187635] [2025-04-13 22:36:13,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616187635] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:13,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442577953] [2025-04-13 22:36:13,599 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:13,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:13,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:13,601 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 22:36:13,602 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 22:36:13,667 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:36:13,684 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:36:13,684 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:13,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:13,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:36:13,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:13,804 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 15 treesize of output 7 [2025-04-13 22:36:13,817 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 22:36:13,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:13,864 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:13,864 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2025-04-13 22:36:13,900 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 22:36:13,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442577953] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:13,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:36:13,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 19 [2025-04-13 22:36:13,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402924832] [2025-04-13 22:36:13,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:13,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:36:13,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:13,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:36:13,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:36:13,901 INFO L87 Difference]: Start difference. First operand 4505 states and 17167 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:36:15,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:15,461 INFO L93 Difference]: Finished difference Result 6215 states and 23796 transitions. [2025-04-13 22:36:15,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:36:15,461 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 40 [2025-04-13 22:36:15,461 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:15,481 INFO L225 Difference]: With dead ends: 6215 [2025-04-13 22:36:15,481 INFO L226 Difference]: Without dead ends: 5964 [2025-04-13 22:36:15,483 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:36:15,483 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 97 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:15,483 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 54 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2025-04-13 22:36:16,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 4439. [2025-04-13 22:36:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4439 states, 4438 states have (on average 3.80802163136548) internal successors, (16900), 4438 states have internal predecessors, (16900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 16900 transitions. [2025-04-13 22:36:16,162 INFO L79 Accepts]: Start accepts. Automaton has 4439 states and 16900 transitions. Word has length 40 [2025-04-13 22:36:16,162 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:16,162 INFO L485 AbstractCegarLoop]: Abstraction has 4439 states and 16900 transitions. [2025-04-13 22:36:16,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:36:16,162 INFO L278 IsEmpty]: Start isEmpty. Operand 4439 states and 16900 transitions. [2025-04-13 22:36:16,169 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:36:16,169 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:16,169 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:16,175 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 22:36:16,369 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-04-13 22:36:16,369 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:36:16,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:16,370 INFO L85 PathProgramCache]: Analyzing trace with hash 39408263, now seen corresponding path program 17 times [2025-04-13 22:36:16,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:16,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567344731] [2025-04-13 22:36:16,370 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:16,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:16,374 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:36:16,379 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:36:16,379 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:16,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:16,548 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 22:36:16,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:16,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567344731] [2025-04-13 22:36:16,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567344731] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:16,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65703049] [2025-04-13 22:36:16,548 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:16,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:16,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:16,550 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 22:36:16,551 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 22:36:16,630 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:36:16,647 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:36:16,647 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:16,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:16,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:36:16,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:16,693 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 19 treesize of output 7 [2025-04-13 22:36:16,709 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 22:36:16,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:16,762 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:16,762 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2025-04-13 22:36:16,775 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 22:36:16,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65703049] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:36:16,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:36:16,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2025-04-13 22:36:16,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138089743] [2025-04-13 22:36:16,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:36:16,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:36:16,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:16,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:36:16,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:36:16,775 INFO L87 Difference]: Start difference. First operand 4439 states and 16900 transitions. Second operand has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:18,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:18,698 INFO L93 Difference]: Finished difference Result 6761 states and 25851 transitions. [2025-04-13 22:36:18,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:36:18,698 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:36:18,698 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:18,719 INFO L225 Difference]: With dead ends: 6761 [2025-04-13 22:36:18,719 INFO L226 Difference]: Without dead ends: 6486 [2025-04-13 22:36:18,720 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:36:18,720 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 199 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:18,721 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 118 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:36:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6486 states. [2025-04-13 22:36:19,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6486 to 4583. [2025-04-13 22:36:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4583 states, 4582 states have (on average 3.8088171104321256) internal successors, (17452), 4582 states have internal predecessors, (17452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 17452 transitions. [2025-04-13 22:36:19,391 INFO L79 Accepts]: Start accepts. Automaton has 4583 states and 17452 transitions. Word has length 40 [2025-04-13 22:36:19,391 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:19,391 INFO L485 AbstractCegarLoop]: Abstraction has 4583 states and 17452 transitions. [2025-04-13 22:36:19,391 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:19,392 INFO L278 IsEmpty]: Start isEmpty. Operand 4583 states and 17452 transitions. [2025-04-13 22:36:19,398 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:36:19,398 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:19,398 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:19,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-04-13 22:36:19,599 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,SelfDestructingSolverStorable47 [2025-04-13 22:36:19,599 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:36:19,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:19,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1748387147, now seen corresponding path program 18 times [2025-04-13 22:36:19,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:19,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864127002] [2025-04-13 22:36:19,599 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:36:19,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:19,604 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:36:19,608 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 22:36:19,608 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:36:19,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:19,704 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 22:36:19,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:19,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864127002] [2025-04-13 22:36:19,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864127002] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:19,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:19,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:36:19,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478830434] [2025-04-13 22:36:19,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:19,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:36:19,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:19,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:36:19,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:36:19,705 INFO L87 Difference]: Start difference. First operand 4583 states and 17452 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:36:21,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:21,351 INFO L93 Difference]: Finished difference Result 6702 states and 25599 transitions. [2025-04-13 22:36:21,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:36:21,351 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 40 [2025-04-13 22:36:21,351 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:21,373 INFO L225 Difference]: With dead ends: 6702 [2025-04-13 22:36:21,373 INFO L226 Difference]: Without dead ends: 6451 [2025-04-13 22:36:21,375 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:36:21,375 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 110 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:21,375 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 52 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:36:21,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6451 states. [2025-04-13 22:36:22,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6451 to 4559. [2025-04-13 22:36:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4559 states, 4558 states have (on average 3.8082492321193504) internal successors, (17358), 4558 states have internal predecessors, (17358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4559 states to 4559 states and 17358 transitions. [2025-04-13 22:36:22,072 INFO L79 Accepts]: Start accepts. Automaton has 4559 states and 17358 transitions. Word has length 40 [2025-04-13 22:36:22,072 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:22,072 INFO L485 AbstractCegarLoop]: Abstraction has 4559 states and 17358 transitions. [2025-04-13 22:36:22,072 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:36:22,073 INFO L278 IsEmpty]: Start isEmpty. Operand 4559 states and 17358 transitions. [2025-04-13 22:36:22,080 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:36:22,080 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:22,080 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:22,080 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-13 22:36:22,080 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:36:22,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:22,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1885994741, now seen corresponding path program 19 times [2025-04-13 22:36:22,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:22,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80193693] [2025-04-13 22:36:22,081 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:22,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:22,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:36:22,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:36:22,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:22,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:22,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 22:36:22,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:22,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80193693] [2025-04-13 22:36:22,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80193693] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:22,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875459940] [2025-04-13 22:36:22,285 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:22,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:22,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:22,287 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 22:36:22,287 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 22:36:22,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:36:22,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:36:22,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:22,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:22,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:36:22,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:22,432 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 19 treesize of output 7 [2025-04-13 22:36:22,445 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 22:36:22,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:36:22,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875459940] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:22,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:36:22,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-04-13 22:36:22,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454063194] [2025-04-13 22:36:22,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:22,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:36:22,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:22,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:36:22,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:36:22,446 INFO L87 Difference]: Start difference. First operand 4559 states and 17358 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:36:24,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:24,306 INFO L93 Difference]: Finished difference Result 7116 states and 27195 transitions. [2025-04-13 22:36:24,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:36:24,306 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 40 [2025-04-13 22:36:24,306 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:24,329 INFO L225 Difference]: With dead ends: 7116 [2025-04-13 22:36:24,329 INFO L226 Difference]: Without dead ends: 6865 [2025-04-13 22:36:24,331 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:36:24,331 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 122 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:24,331 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 62 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:24,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6865 states. [2025-04-13 22:36:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6865 to 4511. [2025-04-13 22:36:25,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4511 states, 4510 states have (on average 3.8070953436807096) internal successors, (17170), 4510 states have internal predecessors, (17170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4511 states to 4511 states and 17170 transitions. [2025-04-13 22:36:25,029 INFO L79 Accepts]: Start accepts. Automaton has 4511 states and 17170 transitions. Word has length 40 [2025-04-13 22:36:25,030 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:25,030 INFO L485 AbstractCegarLoop]: Abstraction has 4511 states and 17170 transitions. [2025-04-13 22:36:25,030 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:36:25,030 INFO L278 IsEmpty]: Start isEmpty. Operand 4511 states and 17170 transitions. [2025-04-13 22:36:25,037 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:36:25,037 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:25,037 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:25,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-04-13 22:36:25,238 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,SelfDestructingSolverStorable49 [2025-04-13 22:36:25,238 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:36:25,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:25,238 INFO L85 PathProgramCache]: Analyzing trace with hash 607014419, now seen corresponding path program 20 times [2025-04-13 22:36:25,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:25,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309416173] [2025-04-13 22:36:25,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:36:25,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:25,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:36:25,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:36:25,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:25,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:25,389 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 22:36:25,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:25,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309416173] [2025-04-13 22:36:25,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309416173] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:25,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598264943] [2025-04-13 22:36:25,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:36:25,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:25,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:25,391 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 22:36:25,392 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 22:36:25,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:36:25,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:36:25,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:25,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:25,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:36:25,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:25,499 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 22:36:25,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 15 treesize of output 7 [2025-04-13 22:36:25,625 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 22:36:25,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:25,717 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 22:36:25,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598264943] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:36:25,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:36:25,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 23 [2025-04-13 22:36:25,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417029027] [2025-04-13 22:36:25,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:36:25,718 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:36:25,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:25,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:36:25,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:36:25,719 INFO L87 Difference]: Start difference. First operand 4511 states and 17170 transitions. Second operand has 24 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 24 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:29,240 INFO L93 Difference]: Finished difference Result 9730 states and 37107 transitions. [2025-04-13 22:36:29,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:36:29,240 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 24 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:36:29,240 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:29,270 INFO L225 Difference]: With dead ends: 9730 [2025-04-13 22:36:29,270 INFO L226 Difference]: Without dead ends: 9479 [2025-04-13 22:36:29,273 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=1365, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:36:29,273 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 551 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 2884 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 2893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:29,273 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 208 Invalid, 2893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2884 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 22:36:29,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9479 states. [2025-04-13 22:36:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9479 to 4843. [2025-04-13 22:36:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4843 states, 4842 states have (on average 3.792647666253614) internal successors, (18364), 4842 states have internal predecessors, (18364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4843 states to 4843 states and 18364 transitions. [2025-04-13 22:36:30,030 INFO L79 Accepts]: Start accepts. Automaton has 4843 states and 18364 transitions. Word has length 40 [2025-04-13 22:36:30,030 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:30,030 INFO L485 AbstractCegarLoop]: Abstraction has 4843 states and 18364 transitions. [2025-04-13 22:36:30,030 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 24 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:30,030 INFO L278 IsEmpty]: Start isEmpty. Operand 4843 states and 18364 transitions. [2025-04-13 22:36:30,037 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:36:30,037 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:30,037 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:30,043 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 22:36:30,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:30,238 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:36:30,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:30,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1243074898, now seen corresponding path program 18 times [2025-04-13 22:36:30,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:30,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725664026] [2025-04-13 22:36:30,238 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:36:30,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:30,243 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:36:30,248 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:36:30,248 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 22:36:30,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:30,382 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 22:36:30,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:30,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725664026] [2025-04-13 22:36:30,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725664026] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:30,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370962385] [2025-04-13 22:36:30,382 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:36:30,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:30,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:30,384 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 22:36:30,384 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 22:36:30,451 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:36:30,470 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:36:30,471 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 22:36:30,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:30,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:36:30,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:30,491 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 22:36:30,670 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 15 treesize of output 7 [2025-04-13 22:36:30,682 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 22:36:30,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:30,859 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 22:36:30,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370962385] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:36:30,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:36:30,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 23 [2025-04-13 22:36:30,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055422354] [2025-04-13 22:36:30,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:36:30,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:36:30,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:30,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:36:30,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:36:30,860 INFO L87 Difference]: Start difference. First operand 4843 states and 18364 transitions. Second operand has 24 states, 23 states have (on average 3.782608695652174) internal successors, (87), 24 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:34,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:34,403 INFO L93 Difference]: Finished difference Result 9372 states and 34795 transitions. [2025-04-13 22:36:34,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:36:34,406 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.782608695652174) internal successors, (87), 24 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-13 22:36:34,406 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:34,440 INFO L225 Difference]: With dead ends: 9372 [2025-04-13 22:36:34,440 INFO L226 Difference]: Without dead ends: 9163 [2025-04-13 22:36:34,444 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=1401, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:36:34,444 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 347 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 3180 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 3187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:34,444 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 257 Invalid, 3187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3180 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:36:34,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9163 states. [2025-04-13 22:36:35,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9163 to 5065. [2025-04-13 22:36:35,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5065 states, 5064 states have (on average 3.800947867298578) internal successors, (19248), 5064 states have internal predecessors, (19248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5065 states to 5065 states and 19248 transitions. [2025-04-13 22:36:35,246 INFO L79 Accepts]: Start accepts. Automaton has 5065 states and 19248 transitions. Word has length 40 [2025-04-13 22:36:35,246 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:35,246 INFO L485 AbstractCegarLoop]: Abstraction has 5065 states and 19248 transitions. [2025-04-13 22:36:35,246 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.782608695652174) internal successors, (87), 24 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:35,246 INFO L278 IsEmpty]: Start isEmpty. Operand 5065 states and 19248 transitions. [2025-04-13 22:36:35,253 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:36:35,254 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:35,254 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:35,260 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 22:36:35,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:35,454 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:36:35,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:35,455 INFO L85 PathProgramCache]: Analyzing trace with hash 182540274, now seen corresponding path program 19 times [2025-04-13 22:36:35,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:35,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433577769] [2025-04-13 22:36:35,455 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:35,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:35,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:36:35,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:36:35,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:35,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:36:35,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:35,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433577769] [2025-04-13 22:36:35,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433577769] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:35,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390471203] [2025-04-13 22:36:35,677 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:36:35,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:35,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:35,679 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 22:36:35,680 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 22:36:35,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 22:36:35,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:36:35,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:36:35,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:35,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:36:35,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:35,834 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 19 treesize of output 7 [2025-04-13 22:36:35,843 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 22:36:35,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:35,906 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:36:35,906 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2025-04-13 22:36:35,923 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 22:36:35,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390471203] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:36:35,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:36:35,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2025-04-13 22:36:35,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707779729] [2025-04-13 22:36:35,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:36:35,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:36:35,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:35,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:36:35,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:36:35,924 INFO L87 Difference]: Start difference. First operand 5065 states and 19248 transitions. Second operand has 19 states, 18 states have (on average 4.166666666666667) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:39,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:39,157 INFO L93 Difference]: Finished difference Result 9574 states and 36501 transitions. [2025-04-13 22:36:39,157 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:36:39,157 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.166666666666667) internal successors, (75), 19 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 40 [2025-04-13 22:36:39,157 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:39,186 INFO L225 Difference]: With dead ends: 9574 [2025-04-13 22:36:39,186 INFO L226 Difference]: Without dead ends: 9353 [2025-04-13 22:36:39,188 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:36:39,188 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 362 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:39,188 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 149 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:36:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9353 states. [2025-04-13 22:36:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9353 to 4957. [2025-04-13 22:36:39,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4957 states, 4956 states have (on average 3.794188861985472) internal successors, (18804), 4956 states have internal predecessors, (18804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:39,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4957 states to 4957 states and 18804 transitions. [2025-04-13 22:36:40,011 INFO L79 Accepts]: Start accepts. Automaton has 4957 states and 18804 transitions. Word has length 40 [2025-04-13 22:36:40,011 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:40,011 INFO L485 AbstractCegarLoop]: Abstraction has 4957 states and 18804 transitions. [2025-04-13 22:36:40,011 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.166666666666667) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:40,011 INFO L278 IsEmpty]: Start isEmpty. Operand 4957 states and 18804 transitions. [2025-04-13 22:36:40,019 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:36:40,019 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:40,019 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:40,025 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 22:36:40,220 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:40,220 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:36:40,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:40,220 INFO L85 PathProgramCache]: Analyzing trace with hash -392277840, now seen corresponding path program 20 times [2025-04-13 22:36:40,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:40,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422727194] [2025-04-13 22:36:40,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:36:40,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:40,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:36:40,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 22:36:40,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:36:40,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:40,340 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 22:36:40,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:40,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422727194] [2025-04-13 22:36:40,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422727194] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:40,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:40,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:36:40,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469844639] [2025-04-13 22:36:40,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:40,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:36:40,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:40,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:36:40,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:36:40,341 INFO L87 Difference]: Start difference. First operand 4957 states and 18804 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 22:36:42,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:42,445 INFO L93 Difference]: Finished difference Result 7176 states and 27410 transitions. [2025-04-13 22:36:42,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:36:42,446 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 40 [2025-04-13 22:36:42,446 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:42,473 INFO L225 Difference]: With dead ends: 7176 [2025-04-13 22:36:42,473 INFO L226 Difference]: Without dead ends: 6955 [2025-04-13 22:36:42,475 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:36:42,475 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 146 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:42,476 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 71 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:42,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6955 states. [2025-04-13 22:36:43,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6955 to 5001. [2025-04-13 22:36:43,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5001 states, 5000 states have (on average 3.7964) internal successors, (18982), 5000 states have internal predecessors, (18982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5001 states to 5001 states and 18982 transitions. [2025-04-13 22:36:43,313 INFO L79 Accepts]: Start accepts. Automaton has 5001 states and 18982 transitions. Word has length 40 [2025-04-13 22:36:43,313 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:43,313 INFO L485 AbstractCegarLoop]: Abstraction has 5001 states and 18982 transitions. [2025-04-13 22:36:43,313 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 22:36:43,313 INFO L278 IsEmpty]: Start isEmpty. Operand 5001 states and 18982 transitions. [2025-04-13 22:36:43,320 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:36:43,320 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:43,320 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:43,320 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-04-13 22:36:43,320 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:36:43,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:43,320 INFO L85 PathProgramCache]: Analyzing trace with hash 773548620, now seen corresponding path program 21 times [2025-04-13 22:36:43,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:43,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129604099] [2025-04-13 22:36:43,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:36:43,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:43,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:36:43,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-13 22:36:43,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:36:43,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:43,448 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 22:36:43,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:43,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129604099] [2025-04-13 22:36:43,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129604099] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:43,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:43,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:36:43,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752680606] [2025-04-13 22:36:43,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:43,449 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:36:43,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:43,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:36:43,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:36:43,449 INFO L87 Difference]: Start difference. First operand 5001 states and 18982 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 22:36:45,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:45,654 INFO L93 Difference]: Finished difference Result 7156 states and 27330 transitions. [2025-04-13 22:36:45,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:36:45,654 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 40 [2025-04-13 22:36:45,654 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:45,678 INFO L225 Difference]: With dead ends: 7156 [2025-04-13 22:36:45,678 INFO L226 Difference]: Without dead ends: 6935 [2025-04-13 22:36:45,679 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:36:45,679 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 149 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:45,679 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 66 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6935 states. [2025-04-13 22:36:46,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6935 to 5023. [2025-04-13 22:36:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5023 states, 5022 states have (on average 3.7974910394265233) internal successors, (19071), 5022 states have internal predecessors, (19071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:46,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5023 states to 5023 states and 19071 transitions. [2025-04-13 22:36:46,512 INFO L79 Accepts]: Start accepts. Automaton has 5023 states and 19071 transitions. Word has length 40 [2025-04-13 22:36:46,512 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:46,512 INFO L485 AbstractCegarLoop]: Abstraction has 5023 states and 19071 transitions. [2025-04-13 22:36:46,512 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 22:36:46,512 INFO L278 IsEmpty]: Start isEmpty. Operand 5023 states and 19071 transitions. [2025-04-13 22:36:46,541 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 22:36:46,541 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:46,542 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:46,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-04-13 22:36:46,542 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:36:46,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:46,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1416216368, now seen corresponding path program 22 times [2025-04-13 22:36:46,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:46,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527526409] [2025-04-13 22:36:46,542 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:36:46,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:46,547 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 22:36:46,551 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 22:36:46,551 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:36:46,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:46,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 22:36:46,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:46,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527526409] [2025-04-13 22:36:46,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527526409] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:46,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:46,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:36:46,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149504377] [2025-04-13 22:36:46,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:46,651 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:36:46,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:46,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:36:46,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:36:46,651 INFO L87 Difference]: Start difference. First operand 5023 states and 19071 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:36:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:48,667 INFO L93 Difference]: Finished difference Result 6963 states and 26623 transitions. [2025-04-13 22:36:48,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:36:48,667 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 40 [2025-04-13 22:36:48,668 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:48,694 INFO L225 Difference]: With dead ends: 6963 [2025-04-13 22:36:48,694 INFO L226 Difference]: Without dead ends: 6712 [2025-04-13 22:36:48,696 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:36:48,696 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 111 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:48,696 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 60 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:36:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6712 states. [2025-04-13 22:36:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6712 to 4957. [2025-04-13 22:36:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4957 states, 4956 states have (on average 3.794188861985472) internal successors, (18804), 4956 states have internal predecessors, (18804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4957 states to 4957 states and 18804 transitions. [2025-04-13 22:36:49,524 INFO L79 Accepts]: Start accepts. Automaton has 4957 states and 18804 transitions. Word has length 40 [2025-04-13 22:36:49,524 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:49,524 INFO L485 AbstractCegarLoop]: Abstraction has 4957 states and 18804 transitions. [2025-04-13 22:36:49,524 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 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 22:36:49,524 INFO L278 IsEmpty]: Start isEmpty. Operand 4957 states and 18804 transitions. [2025-04-13 22:36:49,562 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 22:36:49,562 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:49,562 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:49,562 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-04-13 22:36:49,562 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:36:49,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:49,562 INFO L85 PathProgramCache]: Analyzing trace with hash 468686231, now seen corresponding path program 21 times [2025-04-13 22:36:49,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:49,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739898502] [2025-04-13 22:36:49,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:36:49,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:49,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 2 equivalence classes. [2025-04-13 22:36:49,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 22:36:49,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:36:49,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:49,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:49,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739898502] [2025-04-13 22:36:49,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739898502] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:49,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901944205] [2025-04-13 22:36:49,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:36:49,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:49,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:49,632 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 22:36:49,634 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 22:36:49,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 2 equivalence classes. [2025-04-13 22:36:49,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 22:36:49,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:36:49,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:49,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:36:49,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:49,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:49,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:49,837 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:36:49,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901944205] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:36:49,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:36:49,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-13 22:36:49,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109969530] [2025-04-13 22:36:49,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:36:49,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 22:36:49,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:49,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 22:36:49,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:36:49,838 INFO L87 Difference]: Start difference. First operand 4957 states and 18804 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 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 22:36:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:52,350 INFO L93 Difference]: Finished difference Result 11835 states and 44887 transitions. [2025-04-13 22:36:52,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:36:52,351 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 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 43 [2025-04-13 22:36:52,351 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:52,380 INFO L225 Difference]: With dead ends: 11835 [2025-04-13 22:36:52,381 INFO L226 Difference]: Without dead ends: 8758 [2025-04-13 22:36:52,386 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:36:52,387 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 246 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:52,387 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 43 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:36:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8758 states. [2025-04-13 22:36:53,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8758 to 7485. [2025-04-13 22:36:53,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7485 states, 7484 states have (on average 3.786878674505612) internal successors, (28341), 7484 states have internal predecessors, (28341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:53,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7485 states to 7485 states and 28341 transitions. [2025-04-13 22:36:53,710 INFO L79 Accepts]: Start accepts. Automaton has 7485 states and 28341 transitions. Word has length 43 [2025-04-13 22:36:53,711 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:53,711 INFO L485 AbstractCegarLoop]: Abstraction has 7485 states and 28341 transitions. [2025-04-13 22:36:53,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 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 22:36:53,711 INFO L278 IsEmpty]: Start isEmpty. Operand 7485 states and 28341 transitions. [2025-04-13 22:36:53,722 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 22:36:53,722 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:53,722 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:53,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-04-13 22:36:53,922 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,SelfDestructingSolverStorable56 [2025-04-13 22:36:53,923 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:36:53,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:53,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1019596266, now seen corresponding path program 22 times [2025-04-13 22:36:53,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:53,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222836953] [2025-04-13 22:36:53,923 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:36:53,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:53,928 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 22:36:53,929 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 31 of 43 statements. [2025-04-13 22:36:53,929 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:36:53,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:53,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:36:53,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:53,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222836953] [2025-04-13 22:36:53,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222836953] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:36:53,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:36:53,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:36:53,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094010941] [2025-04-13 22:36:53,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:36:53,955 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:36:53,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:53,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:36:53,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:36:53,955 INFO L87 Difference]: Start difference. First operand 7485 states and 28341 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:56,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:36:56,630 INFO L93 Difference]: Finished difference Result 10213 states and 38328 transitions. [2025-04-13 22:36:56,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:36:56,631 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-13 22:36:56,631 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:36:56,670 INFO L225 Difference]: With dead ends: 10213 [2025-04-13 22:36:56,670 INFO L226 Difference]: Without dead ends: 9401 [2025-04-13 22:36:56,674 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:36:56,674 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 184 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:36:56,674 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 51 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:36:56,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9401 states. [2025-04-13 22:36:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9401 to 7477. [2025-04-13 22:36:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7477 states, 7476 states have (on average 3.7882557517388977) internal successors, (28321), 7476 states have internal predecessors, (28321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:57,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7477 states to 7477 states and 28321 transitions. [2025-04-13 22:36:58,007 INFO L79 Accepts]: Start accepts. Automaton has 7477 states and 28321 transitions. Word has length 43 [2025-04-13 22:36:58,007 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:36:58,007 INFO L485 AbstractCegarLoop]: Abstraction has 7477 states and 28321 transitions. [2025-04-13 22:36:58,007 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:36:58,007 INFO L278 IsEmpty]: Start isEmpty. Operand 7477 states and 28321 transitions. [2025-04-13 22:36:58,019 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 22:36:58,019 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:36:58,019 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:36:58,019 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-04-13 22:36:58,019 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:36:58,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:36:58,020 INFO L85 PathProgramCache]: Analyzing trace with hash 665499828, now seen corresponding path program 23 times [2025-04-13 22:36:58,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:36:58,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120484457] [2025-04-13 22:36:58,020 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:58,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:36:58,025 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-13 22:36:58,028 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 22:36:58,028 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:58,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:36:58,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:36:58,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120484457] [2025-04-13 22:36:58,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120484457] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:36:58,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106552162] [2025-04-13 22:36:58,077 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:36:58,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:36:58,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:36:58,079 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 22:36:58,080 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 22:36:58,163 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-13 22:36:58,185 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 22:36:58,185 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:36:58,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:36:58,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:36:58,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:36:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:36:58,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:36:58,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:36:58,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106552162] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:36:58,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:36:58,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-13 22:36:58,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863075881] [2025-04-13 22:36:58,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:36:58,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 22:36:58,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:36:58,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 22:36:58,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:36:58,325 INFO L87 Difference]: Start difference. First operand 7477 states and 28321 transitions. Second operand has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:00,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:00,286 INFO L93 Difference]: Finished difference Result 8994 states and 33780 transitions. [2025-04-13 22:37:00,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:37:00,286 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 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 43 [2025-04-13 22:37:00,286 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:00,308 INFO L225 Difference]: With dead ends: 8994 [2025-04-13 22:37:00,308 INFO L226 Difference]: Without dead ends: 4950 [2025-04-13 22:37:00,313 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:37:00,314 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 100 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:00,314 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 66 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:37:00,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4950 states. [2025-04-13 22:37:01,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4950 to 4950. [2025-04-13 22:37:01,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4950 states, 4949 states have (on average 3.79571630632451) internal successors, (18785), 4949 states have internal predecessors, (18785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 18785 transitions. [2025-04-13 22:37:01,162 INFO L79 Accepts]: Start accepts. Automaton has 4950 states and 18785 transitions. Word has length 43 [2025-04-13 22:37:01,162 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:01,162 INFO L485 AbstractCegarLoop]: Abstraction has 4950 states and 18785 transitions. [2025-04-13 22:37:01,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:01,162 INFO L278 IsEmpty]: Start isEmpty. Operand 4950 states and 18785 transitions. [2025-04-13 22:37:01,169 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:37:01,169 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:01,169 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:01,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-04-13 22:37:01,369 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-04-13 22:37:01,370 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:37:01,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:01,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1163814357, now seen corresponding path program 24 times [2025-04-13 22:37:01,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:01,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605324814] [2025-04-13 22:37:01,370 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:37:01,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:01,376 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 3 equivalence classes. [2025-04-13 22:37:01,381 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:37:01,381 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:37:01,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:37:01,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:01,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605324814] [2025-04-13 22:37:01,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605324814] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:01,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868088667] [2025-04-13 22:37:01,424 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:37:01,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:01,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:01,426 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 22:37:01,427 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 22:37:01,500 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 3 equivalence classes. [2025-04-13 22:37:01,520 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:37:01,520 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:37:01,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:01,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:37:01,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:37:01,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:37:01,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868088667] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:01,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:37:01,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 16 [2025-04-13 22:37:01,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696665919] [2025-04-13 22:37:01,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:01,655 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:37:01,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:01,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:37:01,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:37:01,655 INFO L87 Difference]: Start difference. First operand 4950 states and 18785 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:03,248 INFO L93 Difference]: Finished difference Result 6815 states and 25911 transitions. [2025-04-13 22:37:03,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:37:03,249 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 22:37:03,249 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:03,271 INFO L225 Difference]: With dead ends: 6815 [2025-04-13 22:37:03,271 INFO L226 Difference]: Without dead ends: 5193 [2025-04-13 22:37:03,273 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:37:03,274 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 205 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:03,274 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 10 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:37:03,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5193 states. [2025-04-13 22:37:03,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5193 to 3633. [2025-04-13 22:37:03,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3633 states, 3632 states have (on average 3.7849669603524227) internal successors, (13747), 3632 states have internal predecessors, (13747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:03,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 13747 transitions. [2025-04-13 22:37:03,958 INFO L79 Accepts]: Start accepts. Automaton has 3633 states and 13747 transitions. Word has length 44 [2025-04-13 22:37:03,958 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:03,958 INFO L485 AbstractCegarLoop]: Abstraction has 3633 states and 13747 transitions. [2025-04-13 22:37:03,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:03,958 INFO L278 IsEmpty]: Start isEmpty. Operand 3633 states and 13747 transitions. [2025-04-13 22:37:03,964 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:37:03,964 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:03,964 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:03,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-04-13 22:37:04,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-04-13 22:37:04,165 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:37:04,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:04,165 INFO L85 PathProgramCache]: Analyzing trace with hash 952304520, now seen corresponding path program 25 times [2025-04-13 22:37:04,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:04,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102634473] [2025-04-13 22:37:04,165 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:04,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:04,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 22:37:04,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:37:04,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:04,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:37:04,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:04,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102634473] [2025-04-13 22:37:04,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102634473] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:04,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040421666] [2025-04-13 22:37:04,228 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:37:04,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:04,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:04,230 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 22:37:04,230 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 22:37:04,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 22:37:04,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:37:04,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:04,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:04,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:37:04,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:37:04,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:37:04,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040421666] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:04,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:37:04,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 16 [2025-04-13 22:37:04,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604395470] [2025-04-13 22:37:04,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:04,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:37:04,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:04,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:37:04,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:37:04,477 INFO L87 Difference]: Start difference. First operand 3633 states and 13747 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:06,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:06,138 INFO L93 Difference]: Finished difference Result 6138 states and 23405 transitions. [2025-04-13 22:37:06,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:37:06,138 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 22:37:06,138 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:06,161 INFO L225 Difference]: With dead ends: 6138 [2025-04-13 22:37:06,162 INFO L226 Difference]: Without dead ends: 5061 [2025-04-13 22:37:06,164 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:37:06,165 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 151 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:06,166 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 10 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:37:06,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5061 states. [2025-04-13 22:37:07,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5061 to 4700. [2025-04-13 22:37:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4700 states, 4699 states have (on average 3.8031496062992125) internal successors, (17871), 4699 states have internal predecessors, (17871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:07,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4700 states to 4700 states and 17871 transitions. [2025-04-13 22:37:07,178 INFO L79 Accepts]: Start accepts. Automaton has 4700 states and 17871 transitions. Word has length 44 [2025-04-13 22:37:07,179 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:07,179 INFO L485 AbstractCegarLoop]: Abstraction has 4700 states and 17871 transitions. [2025-04-13 22:37:07,179 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:07,179 INFO L278 IsEmpty]: Start isEmpty. Operand 4700 states and 17871 transitions. [2025-04-13 22:37:07,186 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:37:07,186 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:07,186 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:07,192 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 22:37:07,386 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,SelfDestructingSolverStorable60 [2025-04-13 22:37:07,386 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:37:07,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:07,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1192471652, now seen corresponding path program 26 times [2025-04-13 22:37:07,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:07,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634467116] [2025-04-13 22:37:07,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:07,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:07,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:37:07,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:37:07,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:07,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:37:07,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:07,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634467116] [2025-04-13 22:37:07,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634467116] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:37:07,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729938503] [2025-04-13 22:37:07,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:07,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:37:07,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:07,898 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 22:37:07,899 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 22:37:07,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:37:07,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:37:07,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:37:07,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:08,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-04-13 22:37:08,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:37:08,017 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 29 treesize of output 1 [2025-04-13 22:37:08,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:37:08,329 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:37:08,329 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 36 [2025-04-13 22:37:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:37:08,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:37:13,537 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 66 treesize of output 58 [2025-04-13 22:37:13,575 INFO L325 Elim1Store]: treesize reduction 15, result has 65.1 percent of original size [2025-04-13 22:37:13,575 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 422 treesize of output 265 [2025-04-13 22:37:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:37:13,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729938503] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:37:13,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:37:13,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 42 [2025-04-13 22:37:13,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618983959] [2025-04-13 22:37:13,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:37:13,847 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-13 22:37:13,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:13,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-13 22:37:13,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1653, Unknown=1, NotChecked=0, Total=1892 [2025-04-13 22:37:13,848 INFO L87 Difference]: Start difference. First operand 4700 states and 17871 transitions. Second operand has 44 states, 43 states have (on average 2.488372093023256) internal successors, (107), 43 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:37:18,904 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:37:24,448 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:37:29,275 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:37:35,424 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:37:38,223 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:37:49,188 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:38:01,727 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:38:06,214 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:38:15,728 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:38:19,293 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:38:24,814 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:38:31,605 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:38:39,732 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:38:56,105 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:39:00,615 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:39:05,118 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:39:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:39:11,233 INFO L93 Difference]: Finished difference Result 28342 states and 105821 transitions. [2025-04-13 22:39:11,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-04-13 22:39:11,233 INFO L79 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.488372093023256) internal successors, (107), 43 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:39:11,233 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:39:11,321 INFO L225 Difference]: With dead ends: 28342 [2025-04-13 22:39:11,321 INFO L226 Difference]: Without dead ends: 27911 [2025-04-13 22:39:11,329 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3098 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=1689, Invalid=10294, Unknown=7, NotChecked=0, Total=11990 [2025-04-13 22:39:11,329 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 2575 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 8525 mSolverCounterSat, 55 mSolverCounterUnsat, 94 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 101.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2575 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 8674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 8525 IncrementalHoareTripleChecker+Invalid, 94 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 101.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:39:11,329 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2575 Valid, 709 Invalid, 8674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 8525 Invalid, 94 Unknown, 0 Unchecked, 101.8s Time] [2025-04-13 22:39:11,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27911 states. [2025-04-13 22:39:12,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27911 to 5067. [2025-04-13 22:39:12,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5067 states, 5066 states have (on average 3.7850375049348597) internal successors, (19175), 5066 states have internal predecessors, (19175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5067 states to 5067 states and 19175 transitions. [2025-04-13 22:39:13,016 INFO L79 Accepts]: Start accepts. Automaton has 5067 states and 19175 transitions. Word has length 47 [2025-04-13 22:39:13,016 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:39:13,016 INFO L485 AbstractCegarLoop]: Abstraction has 5067 states and 19175 transitions. [2025-04-13 22:39:13,016 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.488372093023256) internal successors, (107), 43 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:13,016 INFO L278 IsEmpty]: Start isEmpty. Operand 5067 states and 19175 transitions. [2025-04-13 22:39:13,024 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:39:13,025 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:39:13,025 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:39:13,032 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 22:39:13,225 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:39:13,225 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:39:13,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:39:13,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1424430777, now seen corresponding path program 1 times [2025-04-13 22:39:13,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:39:13,226 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375388650] [2025-04-13 22:39:13,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:39:13,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:39:13,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 22:39:13,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:39:13,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:39:13,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:39:13,872 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:39:13,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:39:13,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375388650] [2025-04-13 22:39:13,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375388650] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:39:13,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734012218] [2025-04-13 22:39:13,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:39:13,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:39:13,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:39:13,874 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 22:39:13,875 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 22:39:13,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 22:39:13,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:39:13,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:39:13,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:39:13,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:39:13,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:39:14,223 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:39:14,223 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 36 treesize of output 12 [2025-04-13 22:39:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:39:14,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:39:14,410 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:39:14,410 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 38 treesize of output 43 [2025-04-13 22:39:14,438 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:39:14,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734012218] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:39:14,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:39:14,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2025-04-13 22:39:14,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742592713] [2025-04-13 22:39:14,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:39:14,439 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:39:14,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:39:14,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:39:14,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:39:14,439 INFO L87 Difference]: Start difference. First operand 5067 states and 19175 transitions. Second operand has 31 states, 30 states have (on average 3.3) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:39:30,774 INFO L93 Difference]: Finished difference Result 25168 states and 96635 transitions. [2025-04-13 22:39:30,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-13 22:39:30,774 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.3) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:39:30,774 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:39:30,859 INFO L225 Difference]: With dead ends: 25168 [2025-04-13 22:39:30,859 INFO L226 Difference]: Without dead ends: 23615 [2025-04-13 22:39:30,868 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=521, Invalid=4171, Unknown=0, NotChecked=0, Total=4692 [2025-04-13 22:39:30,868 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 1364 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 8305 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 8351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 8305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:39:30,869 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 526 Invalid, 8351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 8305 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-04-13 22:39:30,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23615 states. [2025-04-13 22:39:33,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23615 to 6135. [2025-04-13 22:39:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6135 states, 6134 states have (on average 3.86256928594718) internal successors, (23693), 6134 states have internal predecessors, (23693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6135 states to 6135 states and 23693 transitions. [2025-04-13 22:39:33,201 INFO L79 Accepts]: Start accepts. Automaton has 6135 states and 23693 transitions. Word has length 47 [2025-04-13 22:39:33,201 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:39:33,201 INFO L485 AbstractCegarLoop]: Abstraction has 6135 states and 23693 transitions. [2025-04-13 22:39:33,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.3) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:33,202 INFO L278 IsEmpty]: Start isEmpty. Operand 6135 states and 23693 transitions. [2025-04-13 22:39:33,211 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:39:33,211 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:39:33,211 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:39:33,217 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 22:39:33,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:39:33,411 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:39:33,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:39:33,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1442031849, now seen corresponding path program 2 times [2025-04-13 22:39:33,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:39:33,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157755314] [2025-04-13 22:39:33,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:39:33,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:39:33,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:39:33,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:39:33,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:39:33,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:39:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:39:33,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:39:33,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157755314] [2025-04-13 22:39:33,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157755314] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:39:33,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44306401] [2025-04-13 22:39:33,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:39:33,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:39:33,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:39:33,896 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 22:39:33,897 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 22:39:33,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:39:33,996 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:39:33,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:39:33,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:39:33,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:39:33,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:39:34,162 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:39:34,162 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 28 treesize of output 12 [2025-04-13 22:39:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:39:34,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:39:34,348 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:39:34,348 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 38 treesize of output 43 [2025-04-13 22:39:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:39:34,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44306401] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:39:34,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:39:34,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 11] total 28 [2025-04-13 22:39:34,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593462281] [2025-04-13 22:39:34,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:39:34,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:39:34,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:39:34,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:39:34,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:39:34,398 INFO L87 Difference]: Start difference. First operand 6135 states and 23693 transitions. Second operand has 29 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 29 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:41,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:39:41,991 INFO L93 Difference]: Finished difference Result 11368 states and 43900 transitions. [2025-04-13 22:39:41,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:39:41,991 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 29 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:39:41,991 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:39:42,029 INFO L225 Difference]: With dead ends: 11368 [2025-04-13 22:39:42,030 INFO L226 Difference]: Without dead ends: 11147 [2025-04-13 22:39:42,032 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=1266, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:39:42,032 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 401 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 4639 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 4642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:39:42,033 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 261 Invalid, 4642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4639 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 22:39:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11147 states. [2025-04-13 22:39:44,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11147 to 6403. [2025-04-13 22:39:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6403 states, 6402 states have (on average 3.8698844111215247) internal successors, (24775), 6402 states have internal predecessors, (24775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:44,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6403 states to 6403 states and 24775 transitions. [2025-04-13 22:39:44,374 INFO L79 Accepts]: Start accepts. Automaton has 6403 states and 24775 transitions. Word has length 47 [2025-04-13 22:39:44,375 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:39:44,375 INFO L485 AbstractCegarLoop]: Abstraction has 6403 states and 24775 transitions. [2025-04-13 22:39:44,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 29 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:44,375 INFO L278 IsEmpty]: Start isEmpty. Operand 6403 states and 24775 transitions. [2025-04-13 22:39:44,386 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:39:44,386 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:39:44,386 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:39:44,392 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 22:39:44,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:39:44,586 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:39:44,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:39:44,587 INFO L85 PathProgramCache]: Analyzing trace with hash 553355125, now seen corresponding path program 3 times [2025-04-13 22:39:44,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:39:44,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266631861] [2025-04-13 22:39:44,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:39:44,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:39:44,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:39:44,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 46 of 47 statements. [2025-04-13 22:39:44,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:39:44,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:39:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:39:44,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:39:44,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266631861] [2025-04-13 22:39:44,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266631861] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:39:44,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242068703] [2025-04-13 22:39:44,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:39:44,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:39:44,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:39:44,880 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 22:39:44,880 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 22:39:44,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:39:44,981 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 46 of 47 statements. [2025-04-13 22:39:44,981 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:39:44,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:39:44,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 22:39:44,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:39:45,008 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 22:39:45,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:39:45,329 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:39:45,330 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 36 [2025-04-13 22:39:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:39:45,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:39:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:39:45,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242068703] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:39:45,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:39:45,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 36 [2025-04-13 22:39:45,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001573657] [2025-04-13 22:39:45,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:39:45,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:39:45,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:39:45,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:39:45,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1201, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:39:45,727 INFO L87 Difference]: Start difference. First operand 6403 states and 24775 transitions. Second operand has 37 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:55,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:39:55,443 INFO L93 Difference]: Finished difference Result 12472 states and 46914 transitions. [2025-04-13 22:39:55,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:39:55,443 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:39:55,443 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:39:55,493 INFO L225 Difference]: With dead ends: 12472 [2025-04-13 22:39:55,493 INFO L226 Difference]: Without dead ends: 12280 [2025-04-13 22:39:55,497 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=520, Invalid=3512, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:39:55,498 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 1559 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 5152 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 5181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:39:55,498 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 427 Invalid, 5181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5152 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-04-13 22:39:55,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12280 states. [2025-04-13 22:39:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12280 to 6651. [2025-04-13 22:39:58,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6651 states, 6650 states have (on average 3.8657142857142857) internal successors, (25707), 6650 states have internal predecessors, (25707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6651 states to 6651 states and 25707 transitions. [2025-04-13 22:39:58,152 INFO L79 Accepts]: Start accepts. Automaton has 6651 states and 25707 transitions. Word has length 47 [2025-04-13 22:39:58,152 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:39:58,152 INFO L485 AbstractCegarLoop]: Abstraction has 6651 states and 25707 transitions. [2025-04-13 22:39:58,152 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:58,152 INFO L278 IsEmpty]: Start isEmpty. Operand 6651 states and 25707 transitions. [2025-04-13 22:39:58,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:39:58,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:39:58,164 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:39:58,171 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 22:39:58,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:39:58,365 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:39:58,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:39:58,365 INFO L85 PathProgramCache]: Analyzing trace with hash -216785981, now seen corresponding path program 4 times [2025-04-13 22:39:58,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:39:58,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052165025] [2025-04-13 22:39:58,365 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:39:58,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:39:58,371 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:39:58,376 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:39:58,377 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:39:58,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:39:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:39:58,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:39:58,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052165025] [2025-04-13 22:39:58,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052165025] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:39:58,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540979139] [2025-04-13 22:39:58,677 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:39:58,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:39:58,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:39:58,678 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 22:39:58,680 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 22:39:58,766 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:39:58,787 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:39:58,787 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:39:58,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:39:58,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:39:58,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:39:58,984 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:39:58,984 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 36 treesize of output 12 [2025-04-13 22:39:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:39:58,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:39:59,158 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:39:59,159 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 38 treesize of output 43 [2025-04-13 22:39:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:39:59,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540979139] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:39:59,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:39:59,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 27 [2025-04-13 22:39:59,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480308958] [2025-04-13 22:39:59,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:39:59,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:39:59,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:39:59,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:39:59,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:39:59,183 INFO L87 Difference]: Start difference. First operand 6651 states and 25707 transitions. Second operand has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:14,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:14,768 INFO L93 Difference]: Finished difference Result 18097 states and 70301 transitions. [2025-04-13 22:40:14,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 22:40:14,768 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:40:14,768 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:14,828 INFO L225 Difference]: With dead ends: 18097 [2025-04-13 22:40:14,829 INFO L226 Difference]: Without dead ends: 17728 [2025-04-13 22:40:14,833 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=429, Invalid=3353, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 22:40:14,833 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 1213 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 6517 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 6546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 6517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:14,833 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 382 Invalid, 6546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 6517 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-04-13 22:40:14,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17728 states. [2025-04-13 22:40:18,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17728 to 7895. [2025-04-13 22:40:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7895 states, 7894 states have (on average 3.942868001013428) internal successors, (31125), 7894 states have internal predecessors, (31125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7895 states to 7895 states and 31125 transitions. [2025-04-13 22:40:18,497 INFO L79 Accepts]: Start accepts. Automaton has 7895 states and 31125 transitions. Word has length 47 [2025-04-13 22:40:18,498 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:18,498 INFO L485 AbstractCegarLoop]: Abstraction has 7895 states and 31125 transitions. [2025-04-13 22:40:18,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:18,498 INFO L278 IsEmpty]: Start isEmpty. Operand 7895 states and 31125 transitions. [2025-04-13 22:40:18,511 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:40:18,511 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:18,512 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:18,518 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 22:40:18,712 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,SelfDestructingSolverStorable65 [2025-04-13 22:40:18,712 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:40:18,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:18,712 INFO L85 PathProgramCache]: Analyzing trace with hash -898017017, now seen corresponding path program 5 times [2025-04-13 22:40:18,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:18,713 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34824116] [2025-04-13 22:40:18,713 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:40:18,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:18,718 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:40:18,725 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:40:18,725 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:40:18,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:40:19,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:19,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34824116] [2025-04-13 22:40:19,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34824116] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:40:19,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783519653] [2025-04-13 22:40:19,246 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:40:19,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:40:19,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:40:19,248 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 22:40:19,249 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 22:40:19,331 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:40:19,352 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:40:19,352 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:40:19,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:19,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 22:40:19,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:40:19,503 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:40:19,503 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 36 treesize of output 12 [2025-04-13 22:40:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:40:19,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:40:19,699 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:40:19,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 38 treesize of output 43 [2025-04-13 22:40:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:40:19,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783519653] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:40:19,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:40:19,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 27 [2025-04-13 22:40:19,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287524271] [2025-04-13 22:40:19,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:40:19,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:40:19,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:19,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:40:19,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:40:19,727 INFO L87 Difference]: Start difference. First operand 7895 states and 31125 transitions. Second operand has 28 states, 27 states have (on average 3.111111111111111) internal successors, (84), 28 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:30,461 INFO L93 Difference]: Finished difference Result 12637 states and 49266 transitions. [2025-04-13 22:40:30,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:40:30,461 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.111111111111111) internal successors, (84), 28 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:40:30,461 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:30,513 INFO L225 Difference]: With dead ends: 12637 [2025-04-13 22:40:30,513 INFO L226 Difference]: Without dead ends: 12416 [2025-04-13 22:40:30,516 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=1854, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:40:30,516 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 616 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 5122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 5124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:30,516 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 281 Invalid, 5124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5122 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-04-13 22:40:30,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12416 states. [2025-04-13 22:40:34,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12416 to 7895. [2025-04-13 22:40:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7895 states, 7894 states have (on average 3.942868001013428) internal successors, (31125), 7894 states have internal predecessors, (31125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7895 states to 7895 states and 31125 transitions. [2025-04-13 22:40:34,190 INFO L79 Accepts]: Start accepts. Automaton has 7895 states and 31125 transitions. Word has length 47 [2025-04-13 22:40:34,191 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:34,191 INFO L485 AbstractCegarLoop]: Abstraction has 7895 states and 31125 transitions. [2025-04-13 22:40:34,191 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.111111111111111) internal successors, (84), 28 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:34,191 INFO L278 IsEmpty]: Start isEmpty. Operand 7895 states and 31125 transitions. [2025-04-13 22:40:34,203 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:40:34,203 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:34,204 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:34,210 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 22:40:34,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2025-04-13 22:40:34,404 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:40:34,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:34,404 INFO L85 PathProgramCache]: Analyzing trace with hash 245386303, now seen corresponding path program 6 times [2025-04-13 22:40:34,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:34,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107379725] [2025-04-13 22:40:34,404 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:40:34,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:34,411 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:40:34,419 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:40:34,419 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:40:34,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:34,825 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:40:34,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:34,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107379725] [2025-04-13 22:40:34,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107379725] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:40:34,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913114073] [2025-04-13 22:40:34,825 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:40:34,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:40:34,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:40:34,827 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 22:40:34,828 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 22:40:34,911 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:40:34,933 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:40:34,933 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:40:34,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:34,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 22:40:34,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:40:34,943 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 22:40:35,215 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:40:35,215 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 28 treesize of output 12 [2025-04-13 22:40:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:40:35,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:40:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:40:36,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913114073] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:40:36,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:40:36,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 12] total 31 [2025-04-13 22:40:36,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055132545] [2025-04-13 22:40:36,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:40:36,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:40:36,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:36,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:40:36,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=879, Unknown=2, NotChecked=0, Total=992 [2025-04-13 22:40:36,304 INFO L87 Difference]: Start difference. First operand 7895 states and 31125 transitions. Second operand has 32 states, 31 states have (on average 3.129032258064516) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:50,410 INFO L93 Difference]: Finished difference Result 15023 states and 57546 transitions. [2025-04-13 22:40:50,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 22:40:50,410 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.129032258064516) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:40:50,410 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:50,465 INFO L225 Difference]: With dead ends: 15023 [2025-04-13 22:40:50,465 INFO L226 Difference]: Without dead ends: 14736 [2025-04-13 22:40:50,469 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=601, Invalid=4799, Unknown=2, NotChecked=0, Total=5402 [2025-04-13 22:40:50,469 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 944 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 7960 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 7973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 7960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:50,469 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 574 Invalid, 7973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 7960 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-04-13 22:40:50,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14736 states. [2025-04-13 22:40:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14736 to 8007. [2025-04-13 22:40:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8007 states, 8006 states have (on average 3.944666500124906) internal successors, (31581), 8006 states have internal predecessors, (31581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:54,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8007 states to 8007 states and 31581 transitions. [2025-04-13 22:40:54,247 INFO L79 Accepts]: Start accepts. Automaton has 8007 states and 31581 transitions. Word has length 47 [2025-04-13 22:40:54,248 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:54,248 INFO L485 AbstractCegarLoop]: Abstraction has 8007 states and 31581 transitions. [2025-04-13 22:40:54,248 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.129032258064516) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:54,248 INFO L278 IsEmpty]: Start isEmpty. Operand 8007 states and 31581 transitions. [2025-04-13 22:40:54,260 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:40:54,260 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:54,260 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:54,267 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 22:40:54,461 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,SelfDestructingSolverStorable67 [2025-04-13 22:40:54,461 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:40:54,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:54,461 INFO L85 PathProgramCache]: Analyzing trace with hash -189883082, now seen corresponding path program 23 times [2025-04-13 22:40:54,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:54,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575054677] [2025-04-13 22:40:54,461 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:40:54,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:54,467 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:40:54,475 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:40:54,475 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:40:54,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:40:54,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:54,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575054677] [2025-04-13 22:40:54,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575054677] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:40:54,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326459560] [2025-04-13 22:40:54,792 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:40:54,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:40:54,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:40:54,793 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 22:40:54,794 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 22:40:54,882 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:40:54,904 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:40:54,904 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:40:54,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:54,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 22:40:54,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:40:55,062 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:40:55,062 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 36 treesize of output 12 [2025-04-13 22:40:55,074 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:40:55,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:40:55,181 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:40:55,181 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 38 treesize of output 43 [2025-04-13 22:40:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:40:55,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326459560] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:40:55,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:40:55,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 21 [2025-04-13 22:40:55,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346273080] [2025-04-13 22:40:55,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:40:55,212 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:40:55,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:55,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:40:55,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:40:55,212 INFO L87 Difference]: Start difference. First operand 8007 states and 31581 transitions. Second operand has 22 states, 21 states have (on average 3.380952380952381) internal successors, (71), 22 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 22:41:06,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:06,443 INFO L93 Difference]: Finished difference Result 13703 states and 53437 transitions. [2025-04-13 22:41:06,444 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:41:06,444 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.380952380952381) internal successors, (71), 22 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 47 [2025-04-13 22:41:06,444 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:06,492 INFO L225 Difference]: With dead ends: 13703 [2025-04-13 22:41:06,492 INFO L226 Difference]: Without dead ends: 13452 [2025-04-13 22:41:06,495 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=1199, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:41:06,496 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 554 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 4905 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 4909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:06,496 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 329 Invalid, 4909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4905 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 22:41:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13452 states. [2025-04-13 22:41:10,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13452 to 8035. [2025-04-13 22:41:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8035 states, 8034 states have (on average 3.94336569579288) internal successors, (31681), 8034 states have internal predecessors, (31681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8035 states to 8035 states and 31681 transitions. [2025-04-13 22:41:10,391 INFO L79 Accepts]: Start accepts. Automaton has 8035 states and 31681 transitions. Word has length 47 [2025-04-13 22:41:10,392 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:10,392 INFO L485 AbstractCegarLoop]: Abstraction has 8035 states and 31681 transitions. [2025-04-13 22:41:10,392 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.380952380952381) internal successors, (71), 22 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 22:41:10,392 INFO L278 IsEmpty]: Start isEmpty. Operand 8035 states and 31681 transitions. [2025-04-13 22:41:10,405 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:41:10,406 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:10,406 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:10,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2025-04-13 22:41:10,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2025-04-13 22:41:10,606 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:41:10,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:10,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1915618076, now seen corresponding path program 27 times [2025-04-13 22:41:10,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:10,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424084080] [2025-04-13 22:41:10,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:41:10,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:10,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:41:10,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 46 of 47 statements. [2025-04-13 22:41:10,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:41:10,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:41:11,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:11,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424084080] [2025-04-13 22:41:11,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424084080] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:41:11,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818589752] [2025-04-13 22:41:11,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:41:11,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:11,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:41:11,061 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 22:41:11,062 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 22:41:11,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:41:11,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 46 of 47 statements. [2025-04-13 22:41:11,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:41:11,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:11,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-04-13 22:41:11,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:41:11,499 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:41:11,499 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 28 treesize of output 12 [2025-04-13 22:41:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:41:11,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:41:11,745 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:41:11,745 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 37 treesize of output 41 [2025-04-13 22:41:11,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:41:11,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818589752] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:41:11,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:41:11,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 12] total 35 [2025-04-13 22:41:11,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927896873] [2025-04-13 22:41:11,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:41:11,790 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 22:41:11,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:11,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 22:41:11,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1115, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:41:11,791 INFO L87 Difference]: Start difference. First operand 8035 states and 31681 transitions. Second operand has 36 states, 35 states have (on average 2.914285714285714) internal successors, (102), 36 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:38,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:38,194 INFO L93 Difference]: Finished difference Result 23810 states and 92180 transitions. [2025-04-13 22:41:38,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-04-13 22:41:38,194 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.914285714285714) internal successors, (102), 36 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:41:38,195 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:38,294 INFO L225 Difference]: With dead ends: 23810 [2025-04-13 22:41:38,294 INFO L226 Difference]: Without dead ends: 23078 [2025-04-13 22:41:38,302 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3334 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1494, Invalid=10278, Unknown=0, NotChecked=0, Total=11772 [2025-04-13 22:41:38,303 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 2829 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 10688 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2829 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 10782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 10688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:38,303 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2829 Valid, 758 Invalid, 10782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 10688 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-04-13 22:41:38,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23078 states. [2025-04-13 22:41:42,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23078 to 8218. [2025-04-13 22:41:42,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8218 states, 8217 states have (on average 3.9863697213094804) internal successors, (32756), 8217 states have internal predecessors, (32756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8218 states to 8218 states and 32756 transitions. [2025-04-13 22:41:42,717 INFO L79 Accepts]: Start accepts. Automaton has 8218 states and 32756 transitions. Word has length 47 [2025-04-13 22:41:42,717 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:42,717 INFO L485 AbstractCegarLoop]: Abstraction has 8218 states and 32756 transitions. [2025-04-13 22:41:42,717 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.914285714285714) internal successors, (102), 36 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:42,717 INFO L278 IsEmpty]: Start isEmpty. Operand 8218 states and 32756 transitions. [2025-04-13 22:41:42,732 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:41:42,732 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:42,733 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:42,739 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 22:41:42,933 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:42,933 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:41:42,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:42,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1487986069, now seen corresponding path program 7 times [2025-04-13 22:41:42,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:42,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480903652] [2025-04-13 22:41:42,934 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:41:42,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:42,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 22:41:42,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:41:42,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:42,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:43,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:41:43,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:43,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480903652] [2025-04-13 22:41:43,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480903652] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:41:43,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400901630] [2025-04-13 22:41:43,481 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:41:43,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:43,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:41:43,482 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 22:41:43,484 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 22:41:43,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 22:41:43,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:41:43,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:41:43,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:43,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:41:43,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:41:43,788 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:41:43,789 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 36 treesize of output 12 [2025-04-13 22:41:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:41:43,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:41:43,959 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:41:43,960 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 38 treesize of output 43 [2025-04-13 22:41:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:41:43,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400901630] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:41:43,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:41:43,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 29 [2025-04-13 22:41:43,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067862820] [2025-04-13 22:41:43,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:41:43,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:41:43,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:43,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:41:43,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:41:43,983 INFO L87 Difference]: Start difference. First operand 8218 states and 32756 transitions. Second operand has 30 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 30 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:55,478 INFO L93 Difference]: Finished difference Result 12964 states and 50923 transitions. [2025-04-13 22:41:55,478 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:41:55,478 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 30 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:41:55,478 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:55,532 INFO L225 Difference]: With dead ends: 12964 [2025-04-13 22:41:55,533 INFO L226 Difference]: Without dead ends: 12737 [2025-04-13 22:41:55,537 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=1485, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:41:55,537 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 424 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 4495 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 4498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:55,537 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 246 Invalid, 4498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4495 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 22:41:55,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12737 states. [2025-04-13 22:41:59,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12737 to 8066. [2025-04-13 22:41:59,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8066 states, 8065 states have (on average 3.99008059516429) internal successors, (32180), 8065 states have internal predecessors, (32180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8066 states to 8066 states and 32180 transitions. [2025-04-13 22:42:00,029 INFO L79 Accepts]: Start accepts. Automaton has 8066 states and 32180 transitions. Word has length 47 [2025-04-13 22:42:00,029 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:00,029 INFO L485 AbstractCegarLoop]: Abstraction has 8066 states and 32180 transitions. [2025-04-13 22:42:00,029 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 30 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:00,029 INFO L278 IsEmpty]: Start isEmpty. Operand 8066 states and 32180 transitions. [2025-04-13 22:42:00,044 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:42:00,044 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:00,045 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:00,051 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 22:42:00,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:00,245 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:42:00,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:00,245 INFO L85 PathProgramCache]: Analyzing trace with hash -240288284, now seen corresponding path program 28 times [2025-04-13 22:42:00,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:00,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991074003] [2025-04-13 22:42:00,246 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:42:00,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:00,252 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:42:00,257 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:42:00,257 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:42:00,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:42:00,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:00,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991074003] [2025-04-13 22:42:00,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991074003] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:42:00,553 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632887910] [2025-04-13 22:42:00,553 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:42:00,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:00,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:42:00,554 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 22:42:00,555 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 22:42:00,644 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:42:00,665 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:42:00,665 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:42:00,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:00,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:42:00,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:42:00,877 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:42:00,878 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 36 treesize of output 12 [2025-04-13 22:42:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:42:00,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:42:01,076 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:42:01,077 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 38 treesize of output 43 [2025-04-13 22:42:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:42:01,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632887910] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:42:01,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:42:01,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2025-04-13 22:42:01,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715919525] [2025-04-13 22:42:01,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:42:01,109 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:42:01,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:01,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:42:01,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:42:01,110 INFO L87 Difference]: Start difference. First operand 8066 states and 32180 transitions. Second operand has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 30 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:16,579 INFO L93 Difference]: Finished difference Result 17247 states and 67608 transitions. [2025-04-13 22:42:16,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 22:42:16,579 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 30 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:42:16,580 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:16,640 INFO L225 Difference]: With dead ends: 17247 [2025-04-13 22:42:16,640 INFO L226 Difference]: Without dead ends: 16424 [2025-04-13 22:42:16,645 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=357, Invalid=2835, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:42:16,645 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 965 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 5100 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 5147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 5100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:16,645 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 339 Invalid, 5147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 5100 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-04-13 22:42:16,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16424 states. [2025-04-13 22:42:21,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16424 to 8310. [2025-04-13 22:42:21,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8310 states, 8309 states have (on average 3.9995185942953424) internal successors, (33232), 8309 states have internal predecessors, (33232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8310 states to 8310 states and 33232 transitions. [2025-04-13 22:42:21,084 INFO L79 Accepts]: Start accepts. Automaton has 8310 states and 33232 transitions. Word has length 47 [2025-04-13 22:42:21,084 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:21,084 INFO L485 AbstractCegarLoop]: Abstraction has 8310 states and 33232 transitions. [2025-04-13 22:42:21,084 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 30 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:21,084 INFO L278 IsEmpty]: Start isEmpty. Operand 8310 states and 33232 transitions. [2025-04-13 22:42:21,098 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:42:21,098 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:21,098 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:21,106 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 22:42:21,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:21,298 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:42:21,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:21,299 INFO L85 PathProgramCache]: Analyzing trace with hash -907239047, now seen corresponding path program 8 times [2025-04-13 22:42:21,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:21,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698804665] [2025-04-13 22:42:21,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:42:21,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:21,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:42:21,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:42:21,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:42:21,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:21,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:42:21,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:21,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698804665] [2025-04-13 22:42:21,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698804665] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:42:21,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364910800] [2025-04-13 22:42:21,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:42:21,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:21,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:42:21,620 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 22:42:21,621 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 22:42:21,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:42:21,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:42:21,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:42:21,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:21,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-13 22:42:21,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:42:21,774 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 22:42:22,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:42:22,160 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:42:22,160 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 36 [2025-04-13 22:42:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:42:22,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:42:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:42:22,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364910800] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:42:22,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:42:22,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 36 [2025-04-13 22:42:22,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588031120] [2025-04-13 22:42:22,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:42:22,519 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:42:22,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:22,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:42:22,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1207, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:42:22,519 INFO L87 Difference]: Start difference. First operand 8310 states and 33232 transitions. Second operand has 37 states, 36 states have (on average 2.8333333333333335) internal successors, (102), 37 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:37,158 INFO L93 Difference]: Finished difference Result 14199 states and 53902 transitions. [2025-04-13 22:42:37,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 22:42:37,159 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.8333333333333335) internal successors, (102), 37 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:42:37,159 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:37,213 INFO L225 Difference]: With dead ends: 14199 [2025-04-13 22:42:37,214 INFO L226 Difference]: Without dead ends: 14007 [2025-04-13 22:42:37,217 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1931 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=801, Invalid=6339, Unknown=0, NotChecked=0, Total=7140 [2025-04-13 22:42:37,217 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 1677 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 6752 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1677 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 6828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 6752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:37,217 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1677 Valid, 560 Invalid, 6828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 6752 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 22:42:37,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14007 states. [2025-04-13 22:42:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14007 to 8346. [2025-04-13 22:42:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8346 states, 8345 states have (on average 4.000718993409227) internal successors, (33386), 8345 states have internal predecessors, (33386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:41,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8346 states to 8346 states and 33386 transitions. [2025-04-13 22:42:41,789 INFO L79 Accepts]: Start accepts. Automaton has 8346 states and 33386 transitions. Word has length 47 [2025-04-13 22:42:41,789 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:41,789 INFO L485 AbstractCegarLoop]: Abstraction has 8346 states and 33386 transitions. [2025-04-13 22:42:41,789 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.8333333333333335) internal successors, (102), 37 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:41,789 INFO L278 IsEmpty]: Start isEmpty. Operand 8346 states and 33386 transitions. [2025-04-13 22:42:41,803 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:42:41,803 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:41,803 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:42:41,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2025-04-13 22:42:42,003 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,SelfDestructingSolverStorable72 [2025-04-13 22:42:42,004 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:42:42,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:42,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1530910889, now seen corresponding path program 9 times [2025-04-13 22:42:42,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:42,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451722243] [2025-04-13 22:42:42,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:42:42,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:42,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:42:42,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 46 of 47 statements. [2025-04-13 22:42:42,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:42:42,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:42:42,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:42,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451722243] [2025-04-13 22:42:42,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451722243] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:42:42,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810679144] [2025-04-13 22:42:42,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:42:42,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:42,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:42:42,429 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 22:42:42,430 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 22:42:42,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:42:42,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 46 of 47 statements. [2025-04-13 22:42:42,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:42:42,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:42,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-13 22:42:42,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:42:42,560 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 22:42:42,900 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:42: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 28 treesize of output 12 [2025-04-13 22:42:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:42:42,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:42:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:42:43,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810679144] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:42:43,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:42:43,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 12] total 32 [2025-04-13 22:42:43,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348788146] [2025-04-13 22:42:43,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:42:43,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:42:43,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:43,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:42:43,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:42:43,238 INFO L87 Difference]: Start difference. First operand 8346 states and 33386 transitions. Second operand has 33 states, 32 states have (on average 3.15625) internal successors, (101), 33 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:58,349 INFO L93 Difference]: Finished difference Result 14352 states and 55462 transitions. [2025-04-13 22:42:58,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 22:42:58,349 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.15625) internal successors, (101), 33 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:42:58,349 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:58,412 INFO L225 Difference]: With dead ends: 14352 [2025-04-13 22:42:58,412 INFO L226 Difference]: Without dead ends: 14083 [2025-04-13 22:42:58,418 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1614 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=684, Invalid=5322, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 22:42:58,418 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 1134 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 7095 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 7134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 7095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:58,418 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 583 Invalid, 7134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 7095 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 22:42:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14083 states. [2025-04-13 22:43:03,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14083 to 8506. [2025-04-13 22:43:03,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8506 states, 8505 states have (on average 4.002821869488536) internal successors, (34044), 8505 states have internal predecessors, (34044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:43:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8506 states to 8506 states and 34044 transitions. [2025-04-13 22:43:03,177 INFO L79 Accepts]: Start accepts. Automaton has 8506 states and 34044 transitions. Word has length 47 [2025-04-13 22:43:03,177 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:43:03,177 INFO L485 AbstractCegarLoop]: Abstraction has 8506 states and 34044 transitions. [2025-04-13 22:43:03,177 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.15625) internal successors, (101), 33 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:43:03,177 INFO L278 IsEmpty]: Start isEmpty. Operand 8506 states and 34044 transitions. [2025-04-13 22:43:03,191 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:43:03,191 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:43:03,191 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:43:03,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2025-04-13 22:43:03,392 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:43:03,392 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:43:03,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:43:03,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1778314699, now seen corresponding path program 10 times [2025-04-13 22:43:03,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:43:03,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546602874] [2025-04-13 22:43:03,392 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:43:03,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:43:03,398 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:43:03,404 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:43:03,404 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:43:03,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:43:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:43:03,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:43:03,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546602874] [2025-04-13 22:43:03,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546602874] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:43:03,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340484588] [2025-04-13 22:43:03,685 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:43:03,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:43:03,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:43:03,687 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 22:43:03,688 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 22:43:03,778 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:43:03,799 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:43:03,799 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:43:03,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:43:03,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:43:03,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:43:04,044 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:43:04,044 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 36 treesize of output 12 [2025-04-13 22:43:04,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:43:04,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:43:04,256 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:43:04,256 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 38 treesize of output 43 [2025-04-13 22:43:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:43:04,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340484588] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:43:04,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:43:04,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2025-04-13 22:43:04,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170751725] [2025-04-13 22:43:04,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:43:04,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:43:04,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:43:04,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:43:04,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:43:04,280 INFO L87 Difference]: Start difference. First operand 8506 states and 34044 transitions. Second operand has 30 states, 29 states have (on average 3.2758620689655173) internal successors, (95), 30 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:43:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:43:19,045 INFO L93 Difference]: Finished difference Result 15075 states and 59577 transitions. [2025-04-13 22:43:19,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:43:19,046 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.2758620689655173) internal successors, (95), 30 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:43:19,046 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:43:19,108 INFO L225 Difference]: With dead ends: 15075 [2025-04-13 22:43:19,108 INFO L226 Difference]: Without dead ends: 14610 [2025-04-13 22:43:19,113 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=309, Invalid=2241, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:43:19,113 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 744 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 4457 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 4486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:43:19,113 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 283 Invalid, 4486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4457 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 22:43:19,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14610 states. [2025-04-13 22:43:23,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14610 to 8534. [2025-04-13 22:43:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8534 states, 8533 states have (on average 4.003515762334466) internal successors, (34162), 8533 states have internal predecessors, (34162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:43:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8534 states to 8534 states and 34162 transitions. [2025-04-13 22:43:23,889 INFO L79 Accepts]: Start accepts. Automaton has 8534 states and 34162 transitions. Word has length 47 [2025-04-13 22:43:23,890 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:43:23,890 INFO L485 AbstractCegarLoop]: Abstraction has 8534 states and 34162 transitions. [2025-04-13 22:43:23,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.2758620689655173) internal successors, (95), 30 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:43:23,890 INFO L278 IsEmpty]: Start isEmpty. Operand 8534 states and 34162 transitions. [2025-04-13 22:43:23,904 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:43:23,904 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:43:23,904 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:43:23,911 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 22:43:24,104 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:43:24,105 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:43:24,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:43:24,105 INFO L85 PathProgramCache]: Analyzing trace with hash -407155825, now seen corresponding path program 11 times [2025-04-13 22:43:24,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:43:24,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631084026] [2025-04-13 22:43:24,105 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:43:24,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:43:24,111 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:43:24,121 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:43:24,121 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:43:24,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:43:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:43:24,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:43:24,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631084026] [2025-04-13 22:43:24,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631084026] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:43:24,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186333899] [2025-04-13 22:43:24,664 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:43:24,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:43:24,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:43:24,666 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 22:43:24,666 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 22:43:24,759 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:43:24,783 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:43:24,783 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:43:24,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:43:24,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-13 22:43:24,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:43:24,830 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 22:43:25,155 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:43:25,156 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 28 treesize of output 12 [2025-04-13 22:43:25,165 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:43:25,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:43:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:43:25,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186333899] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:43:25,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:43:25,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 11] total 37 [2025-04-13 22:43:25,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771055378] [2025-04-13 22:43:25,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:43:25,396 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:43:25,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:43:25,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:43:25,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1299, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:43:25,397 INFO L87 Difference]: Start difference. First operand 8534 states and 34162 transitions. Second operand has 38 states, 37 states have (on average 3.108108108108108) internal successors, (115), 38 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:43:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:43:51,511 INFO L93 Difference]: Finished difference Result 26063 states and 100777 transitions. [2025-04-13 22:43:51,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-04-13 22:43:51,511 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.108108108108108) internal successors, (115), 38 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:43:51,511 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:43:51,601 INFO L225 Difference]: With dead ends: 26063 [2025-04-13 22:43:51,601 INFO L226 Difference]: Without dead ends: 25490 [2025-04-13 22:43:51,609 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2401 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=785, Invalid=9115, Unknown=0, NotChecked=0, Total=9900 [2025-04-13 22:43:51,610 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 1905 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 8794 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1905 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 8861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 8794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:43:51,610 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1905 Valid, 732 Invalid, 8861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 8794 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-04-13 22:43:51,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25490 states. [2025-04-13 22:43:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25490 to 9346. [2025-04-13 22:43:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9346 states, 9345 states have (on average 4.046013911182451) internal successors, (37810), 9345 states have internal predecessors, (37810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:43:57,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9346 states to 9346 states and 37810 transitions. [2025-04-13 22:43:57,228 INFO L79 Accepts]: Start accepts. Automaton has 9346 states and 37810 transitions. Word has length 47 [2025-04-13 22:43:57,228 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:43:57,228 INFO L485 AbstractCegarLoop]: Abstraction has 9346 states and 37810 transitions. [2025-04-13 22:43:57,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.108108108108108) internal successors, (115), 38 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:43:57,228 INFO L278 IsEmpty]: Start isEmpty. Operand 9346 states and 37810 transitions. [2025-04-13 22:43:57,244 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:43:57,244 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:43:57,244 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:43:57,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2025-04-13 22:43:57,444 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:43:57,444 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:43:57,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:43:57,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1629265812, now seen corresponding path program 29 times [2025-04-13 22:43:57,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:43:57,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017641128] [2025-04-13 22:43:57,445 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:43:57,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:43:57,450 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:43:57,456 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:43:57,456 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:43:57,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:43:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:43:57,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:43:57,893 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017641128] [2025-04-13 22:43:57,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017641128] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:43:57,893 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488013785] [2025-04-13 22:43:57,893 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:43:57,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:43:57,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:43:57,895 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 22:43:57,896 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 22:43:57,991 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:43:58,013 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:43:58,013 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:43:58,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:43:58,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 22:43:58,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:43:58,201 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:43:58,201 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 37 treesize of output 13 [2025-04-13 22:43:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:43:58,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:43:58,409 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:43:58,409 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 38 treesize of output 43 [2025-04-13 22:43:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:43:58,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488013785] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:43:58,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:43:58,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 31 [2025-04-13 22:43:58,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707242718] [2025-04-13 22:43:58,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:43:58,441 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:43:58,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:43:58,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:43:58,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:43:58,441 INFO L87 Difference]: Start difference. First operand 9346 states and 37810 transitions. Second operand has 32 states, 31 states have (on average 3.064516129032258) internal successors, (95), 32 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:44:10,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:44:10,732 INFO L93 Difference]: Finished difference Result 12379 states and 49439 transitions. [2025-04-13 22:44:10,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:44:10,732 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.064516129032258) internal successors, (95), 32 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:44:10,733 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:44:10,789 INFO L225 Difference]: With dead ends: 12379 [2025-04-13 22:44:10,789 INFO L226 Difference]: Without dead ends: 12104 [2025-04-13 22:44:10,792 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=329, Invalid=2121, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:44:10,793 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 790 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 4411 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 4416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:44:10,793 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 301 Invalid, 4416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4411 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 22:44:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12104 states. [2025-04-13 22:44:16,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12104 to 9366. [2025-04-13 22:44:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9366 states, 9365 states have (on average 4.044634276561665) internal successors, (37878), 9365 states have internal predecessors, (37878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:44:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9366 states to 9366 states and 37878 transitions. [2025-04-13 22:44:16,363 INFO L79 Accepts]: Start accepts. Automaton has 9366 states and 37878 transitions. Word has length 47 [2025-04-13 22:44:16,363 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:44:16,363 INFO L485 AbstractCegarLoop]: Abstraction has 9366 states and 37878 transitions. [2025-04-13 22:44:16,363 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.064516129032258) internal successors, (95), 32 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:44:16,363 INFO L278 IsEmpty]: Start isEmpty. Operand 9366 states and 37878 transitions. [2025-04-13 22:44:16,378 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:44:16,379 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:44:16,379 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:44:16,386 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 22:44:16,579 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,SelfDestructingSolverStorable76 [2025-04-13 22:44:16,579 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:44:16,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:44:16,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1950957340, now seen corresponding path program 30 times [2025-04-13 22:44:16,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:44:16,580 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081584833] [2025-04-13 22:44:16,580 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:44:16,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:44:16,586 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:44:16,597 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:44:16,597 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:44:16,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:44:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:44:16,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:44:16,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081584833] [2025-04-13 22:44:16,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081584833] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:44:16,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673908232] [2025-04-13 22:44:16,864 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:44:16,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:44:16,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:44:16,866 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 22:44:16,867 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 22:44:16,965 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:44:16,988 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:44:16,988 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:44:16,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:44:16,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 22:44:16,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:44:17,040 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 22:44:17,389 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:44:17,389 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 33 treesize of output 37 [2025-04-13 22:44:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:44:17,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:44:26,523 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-04-13 22:44:26,530 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:44:26,530 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-04-13 22:44:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:44:26,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673908232] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:44:26,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:44:26,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 44 [2025-04-13 22:44:26,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995763228] [2025-04-13 22:44:26,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:44:26,656 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 22:44:26,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:44:26,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 22:44:26,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1729, Unknown=2, NotChecked=0, Total=1980 [2025-04-13 22:44:26,657 INFO L87 Difference]: Start difference. First operand 9366 states and 37878 transitions. Second operand has 45 states, 44 states have (on average 2.6136363636363638) internal successors, (115), 45 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:44:47,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:44:47,036 INFO L93 Difference]: Finished difference Result 17177 states and 67984 transitions. [2025-04-13 22:44:47,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 22:44:47,036 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.6136363636363638) internal successors, (115), 45 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:44:47,036 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:44:47,114 INFO L225 Difference]: With dead ends: 17177 [2025-04-13 22:44:47,114 INFO L226 Difference]: Without dead ends: 16688 [2025-04-13 22:44:47,119 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1661 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1382, Invalid=6448, Unknown=2, NotChecked=0, Total=7832 [2025-04-13 22:44:47,119 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 2198 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 6754 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2198 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 6897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 6754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:44:47,119 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2198 Valid, 442 Invalid, 6897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 6754 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-04-13 22:44:47,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16688 states. [2025-04-13 22:44:52,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16688 to 9710. [2025-04-13 22:44:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9710 states, 9709 states have (on average 4.047172726336389) internal successors, (39294), 9709 states have internal predecessors, (39294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:44:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9710 states to 9710 states and 39294 transitions. [2025-04-13 22:44:53,042 INFO L79 Accepts]: Start accepts. Automaton has 9710 states and 39294 transitions. Word has length 47 [2025-04-13 22:44:53,042 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:44:53,042 INFO L485 AbstractCegarLoop]: Abstraction has 9710 states and 39294 transitions. [2025-04-13 22:44:53,043 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.6136363636363638) internal successors, (115), 45 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:44:53,043 INFO L278 IsEmpty]: Start isEmpty. Operand 9710 states and 39294 transitions. [2025-04-13 22:44:53,058 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:44:53,058 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:44:53,059 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:44:53,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2025-04-13 22:44:53,259 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,SelfDestructingSolverStorable77 [2025-04-13 22:44:53,259 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:44:53,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:44:53,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2118904334, now seen corresponding path program 31 times [2025-04-13 22:44:53,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:44:53,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521010945] [2025-04-13 22:44:53,260 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:44:53,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:44:53,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 22:44:53,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:44:53,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:44:53,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:44:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:44:53,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:44:53,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521010945] [2025-04-13 22:44:53,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521010945] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:44:53,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490885779] [2025-04-13 22:44:53,688 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:44:53,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:44:53,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:44:53,690 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 22:44:53,692 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 22:44:53,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 22:44:53,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:44:53,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:44:53,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:44:53,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:44:53,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:44:54,066 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:44:54,067 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 36 treesize of output 12 [2025-04-13 22:44:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:44:54,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:44:54,259 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:44:54,259 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 38 treesize of output 43 [2025-04-13 22:44:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:44:54,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490885779] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:44:54,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:44:54,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 31 [2025-04-13 22:44:54,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47796438] [2025-04-13 22:44:54,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:44:54,281 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:44:54,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:44:54,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:44:54,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:44:54,281 INFO L87 Difference]: Start difference. First operand 9710 states and 39294 transitions. Second operand has 32 states, 31 states have (on average 3.129032258064516) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:08,167 INFO L93 Difference]: Finished difference Result 13426 states and 53548 transitions. [2025-04-13 22:45:08,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:45:08,168 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.129032258064516) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:45:08,168 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:08,220 INFO L225 Difference]: With dead ends: 13426 [2025-04-13 22:45:08,220 INFO L226 Difference]: Without dead ends: 13151 [2025-04-13 22:45:08,223 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=258, Invalid=2394, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:45:08,223 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 640 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 4708 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 4716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 4708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:08,223 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 313 Invalid, 4716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 4708 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 22:45:08,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13151 states. [2025-04-13 22:45:14,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13151 to 9710. [2025-04-13 22:45:14,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9710 states, 9709 states have (on average 4.047172726336389) internal successors, (39294), 9709 states have internal predecessors, (39294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9710 states to 9710 states and 39294 transitions. [2025-04-13 22:45:14,163 INFO L79 Accepts]: Start accepts. Automaton has 9710 states and 39294 transitions. Word has length 47 [2025-04-13 22:45:14,163 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:14,163 INFO L485 AbstractCegarLoop]: Abstraction has 9710 states and 39294 transitions. [2025-04-13 22:45:14,163 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.129032258064516) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:14,163 INFO L278 IsEmpty]: Start isEmpty. Operand 9710 states and 39294 transitions. [2025-04-13 22:45:14,179 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:45:14,180 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:14,180 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:45:14,187 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 22:45:14,380 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,SelfDestructingSolverStorable78 [2025-04-13 22:45:14,380 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:45:14,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:14,381 INFO L85 PathProgramCache]: Analyzing trace with hash 701584271, now seen corresponding path program 12 times [2025-04-13 22:45:14,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:14,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171608619] [2025-04-13 22:45:14,381 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:45:14,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:14,387 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:45:14,393 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:45:14,393 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:45:14,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:14,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:14,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171608619] [2025-04-13 22:45:14,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171608619] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:45:14,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434223433] [2025-04-13 22:45:14,818 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:45:14,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:45:14,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:45:14,820 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 22:45:14,820 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 22:45:14,921 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:45:14,946 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:45:14,946 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:45:14,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:14,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 22:45:14,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:45:14,956 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 22:45:15,279 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:45:15,279 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 28 treesize of output 12 [2025-04-13 22:45:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:15,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:45:15,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:45:15,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434223433] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:45:15,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:45:15,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 12] total 34 [2025-04-13 22:45:15,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313960009] [2025-04-13 22:45:15,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:45:15,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:45:15,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:15,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:45:15,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1060, Unknown=1, NotChecked=0, Total=1190 [2025-04-13 22:45:15,983 INFO L87 Difference]: Start difference. First operand 9710 states and 39294 transitions. Second operand has 35 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 35 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:42,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:42,743 INFO L93 Difference]: Finished difference Result 22445 states and 87340 transitions. [2025-04-13 22:45:42,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-13 22:45:42,743 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 35 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:45:42,743 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:42,827 INFO L225 Difference]: With dead ends: 22445 [2025-04-13 22:45:42,828 INFO L226 Difference]: Without dead ends: 22138 [2025-04-13 22:45:42,835 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5047 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1580, Invalid=14931, Unknown=1, NotChecked=0, Total=16512 [2025-04-13 22:45:42,835 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 2302 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 8126 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2302 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 8282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 8126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:42,835 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2302 Valid, 622 Invalid, 8282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 8126 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-04-13 22:45:42,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22138 states. [2025-04-13 22:45:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22138 to 10554. [2025-04-13 22:45:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10554 states, 10553 states have (on average 4.0852838055529235) internal successors, (43112), 10553 states have internal predecessors, (43112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10554 states to 10554 states and 43112 transitions. [2025-04-13 22:45:49,696 INFO L79 Accepts]: Start accepts. Automaton has 10554 states and 43112 transitions. Word has length 47 [2025-04-13 22:45:49,696 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:49,697 INFO L485 AbstractCegarLoop]: Abstraction has 10554 states and 43112 transitions. [2025-04-13 22:45:49,697 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 35 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:49,697 INFO L278 IsEmpty]: Start isEmpty. Operand 10554 states and 43112 transitions. [2025-04-13 22:45:49,715 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:45:49,715 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:49,715 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:45:49,722 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 22:45:49,916 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,SelfDestructingSolverStorable79 [2025-04-13 22:45:49,916 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:45:49,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1719844331, now seen corresponding path program 13 times [2025-04-13 22:45:49,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:49,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184310392] [2025-04-13 22:45:49,916 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:45:49,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:49,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 22:45:49,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:45:49,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:45:49,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:50,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:50,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184310392] [2025-04-13 22:45:50,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184310392] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:45:50,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445200832] [2025-04-13 22:45:50,424 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:45:50,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:45:50,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:45:50,425 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 22:45:50,426 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 22:45:50,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 22:45:50,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:45:50,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:45:50,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:50,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:45:50,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:45:50,765 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:45:50,765 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 37 treesize of output 13 [2025-04-13 22:45:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:45:50,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:45:50,982 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:45:50,983 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 38 treesize of output 43 [2025-04-13 22:45:51,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:45:51,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445200832] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:45:51,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:45:51,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2025-04-13 22:45:51,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203029307] [2025-04-13 22:45:51,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:45:51,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:45:51,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:51,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:45:51,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:45:51,013 INFO L87 Difference]: Start difference. First operand 10554 states and 43112 transitions. Second operand has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:46:16,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:46:16,635 INFO L93 Difference]: Finished difference Result 23246 states and 92737 transitions. [2025-04-13 22:46:16,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 22:46:16,636 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:46:16,636 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:46:16,748 INFO L225 Difference]: With dead ends: 23246 [2025-04-13 22:46:16,748 INFO L226 Difference]: Without dead ends: 22853 [2025-04-13 22:46:16,757 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=323, Invalid=2983, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 22:46:16,757 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 1054 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5710 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 5724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 5710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:46:16,757 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 361 Invalid, 5724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 5710 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-04-13 22:46:16,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22853 states. [2025-04-13 22:46:23,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22853 to 10596. [2025-04-13 22:46:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10596 states, 10595 states have (on average 4.084473808400189) internal successors, (43275), 10595 states have internal predecessors, (43275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:46:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10596 states to 10596 states and 43275 transitions. [2025-04-13 22:46:23,760 INFO L79 Accepts]: Start accepts. Automaton has 10596 states and 43275 transitions. Word has length 47 [2025-04-13 22:46:23,760 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:46:23,760 INFO L485 AbstractCegarLoop]: Abstraction has 10596 states and 43275 transitions. [2025-04-13 22:46:23,760 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:46:23,760 INFO L278 IsEmpty]: Start isEmpty. Operand 10596 states and 43275 transitions. [2025-04-13 22:46:23,779 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:46:23,779 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:46:23,779 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:46:23,786 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 22:46:23,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:46:23,980 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:46:23,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:46:23,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1935554993, now seen corresponding path program 14 times [2025-04-13 22:46:23,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:46:23,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834354183] [2025-04-13 22:46:23,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:46:23,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:46:23,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:46:23,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:46:23,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:46:23,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:46:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:46:24,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:46:24,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834354183] [2025-04-13 22:46:24,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834354183] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:46:24,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639718071] [2025-04-13 22:46:24,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:46:24,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:46:24,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:46:24,479 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 22:46:24,480 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 22:46:24,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:46:24,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:46:24,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:46:24,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:46:24,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 22:46:24,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:46:24,614 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 22:46:24,846 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:46:24,846 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 31 treesize of output 29 [2025-04-13 22:46:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:46:24,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:46:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:46:25,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639718071] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:46:25,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:46:25,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 12] total 34 [2025-04-13 22:46:25,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591527012] [2025-04-13 22:46:25,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:46:25,758 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:46:25,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:46:25,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:46:25,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1050, Unknown=1, NotChecked=0, Total=1190 [2025-04-13 22:46:25,759 INFO L87 Difference]: Start difference. First operand 10596 states and 43275 transitions. Second operand has 35 states, 34 states have (on average 3.088235294117647) internal successors, (105), 35 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:47:05,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:47:05,246 INFO L93 Difference]: Finished difference Result 30917 states and 121467 transitions. [2025-04-13 22:47:05,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2025-04-13 22:47:05,246 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.088235294117647) internal successors, (105), 35 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:47:05,246 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:47:05,361 INFO L225 Difference]: With dead ends: 30917 [2025-04-13 22:47:05,362 INFO L226 Difference]: Without dead ends: 30084 [2025-04-13 22:47:05,372 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6090 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2596, Invalid=16309, Unknown=1, NotChecked=0, Total=18906 [2025-04-13 22:47:05,373 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 2959 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 7717 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2959 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 8131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 7717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:47:05,373 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2959 Valid, 412 Invalid, 8131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 7717 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-04-13 22:47:05,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30084 states. [2025-04-13 22:47:14,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30084 to 12906. [2025-04-13 22:47:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12906 states, 12905 states have (on average 4.135451375435878) internal successors, (53368), 12905 states have internal predecessors, (53368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:47:14,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12906 states to 12906 states and 53368 transitions. [2025-04-13 22:47:14,455 INFO L79 Accepts]: Start accepts. Automaton has 12906 states and 53368 transitions. Word has length 47 [2025-04-13 22:47:14,455 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:47:14,455 INFO L485 AbstractCegarLoop]: Abstraction has 12906 states and 53368 transitions. [2025-04-13 22:47:14,455 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.088235294117647) internal successors, (105), 35 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:47:14,455 INFO L278 IsEmpty]: Start isEmpty. Operand 12906 states and 53368 transitions. [2025-04-13 22:47:14,484 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:47:14,484 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:47:14,484 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:47:14,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2025-04-13 22:47:14,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:47:14,684 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:47:14,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:47:14,685 INFO L85 PathProgramCache]: Analyzing trace with hash 161208119, now seen corresponding path program 15 times [2025-04-13 22:47:14,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:47:14,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413951212] [2025-04-13 22:47:14,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:47:14,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:47:14,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:47:14,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 46 of 47 statements. [2025-04-13 22:47:14,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:47:14,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:47:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:47:14,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:47:14,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413951212] [2025-04-13 22:47:14,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413951212] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:47:14,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071168482] [2025-04-13 22:47:14,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:47:14,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:47:14,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:47:14,992 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 22:47:14,992 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 22:47:15,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:47:15,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 46 of 47 statements. [2025-04-13 22:47:15,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:47:15,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:47:15,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-13 22:47:15,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:47:15,147 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 22:47:15,478 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:47:15,479 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 45 [2025-04-13 22:47:15,641 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:47:15,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:47:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:47:15,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071168482] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:47:15,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:47:15,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 35 [2025-04-13 22:47:15,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425040735] [2025-04-13 22:47:15,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:47:15,962 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 22:47:15,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:47:15,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 22:47:15,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1135, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:47:15,962 INFO L87 Difference]: Start difference. First operand 12906 states and 53368 transitions. Second operand has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 36 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:47:44,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:47:44,939 INFO L93 Difference]: Finished difference Result 20801 states and 83896 transitions. [2025-04-13 22:47:44,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-04-13 22:47:44,940 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 36 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:47:44,940 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:47:45,041 INFO L225 Difference]: With dead ends: 20801 [2025-04-13 22:47:45,041 INFO L226 Difference]: Without dead ends: 20569 [2025-04-13 22:47:45,047 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2766 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1017, Invalid=7725, Unknown=0, NotChecked=0, Total=8742 [2025-04-13 22:47:45,047 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 1363 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 9599 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 9641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 9599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:47:45,047 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1363 Valid, 653 Invalid, 9641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 9599 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-04-13 22:47:45,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20569 states. [2025-04-13 22:47:54,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20569 to 12912. [2025-04-13 22:47:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12912 states, 12911 states have (on average 4.136550228487336) internal successors, (53407), 12911 states have internal predecessors, (53407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:47:54,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12912 states to 12912 states and 53407 transitions. [2025-04-13 22:47:54,115 INFO L79 Accepts]: Start accepts. Automaton has 12912 states and 53407 transitions. Word has length 47 [2025-04-13 22:47:54,115 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:47:54,116 INFO L485 AbstractCegarLoop]: Abstraction has 12912 states and 53407 transitions. [2025-04-13 22:47:54,116 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 36 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:47:54,116 INFO L278 IsEmpty]: Start isEmpty. Operand 12912 states and 53407 transitions. [2025-04-13 22:47:54,144 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:47:54,144 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:47:54,144 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:47:54,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2025-04-13 22:47:54,344 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:47:54,345 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:47:54,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:47:54,345 INFO L85 PathProgramCache]: Analyzing trace with hash 223782059, now seen corresponding path program 16 times [2025-04-13 22:47:54,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:47:54,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798595077] [2025-04-13 22:47:54,345 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:47:54,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:47:54,351 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:47:54,357 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:47:54,357 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:47:54,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:47:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:47:54,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:47:54,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798595077] [2025-04-13 22:47:54,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798595077] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:47:54,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233226004] [2025-04-13 22:47:54,640 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:47:54,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:47:54,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:47:54,641 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 22:47:54,642 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 22:47:54,744 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-13 22:47:54,766 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:47:54,766 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:47:54,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:47:54,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:47:54,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:47:54,933 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:47:54,934 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 37 treesize of output 13 [2025-04-13 22:47:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:47:54,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:47:55,138 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:47:55,139 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 38 treesize of output 43 [2025-04-13 22:47:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:47:55,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233226004] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:47:55,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:47:55,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2025-04-13 22:47:55,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287802999] [2025-04-13 22:47:55,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:47:55,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:47:55,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:47:55,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:47:55,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:47:55,164 INFO L87 Difference]: Start difference. First operand 12912 states and 53407 transitions. Second operand has 27 states, 26 states have (on average 3.5) internal successors, (91), 27 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:48:14,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:48:14,408 INFO L93 Difference]: Finished difference Result 16840 states and 68599 transitions. [2025-04-13 22:48:14,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:48:14,408 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.5) internal successors, (91), 27 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 22:48:14,408 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:48:14,485 INFO L225 Difference]: With dead ends: 16840 [2025-04-13 22:48:14,485 INFO L226 Difference]: Without dead ends: 16619 [2025-04-13 22:48:14,489 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=1231, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:48:14,490 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 490 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 3355 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 3372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:48:14,490 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 213 Invalid, 3372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3355 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 22:48:14,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16619 states. [2025-04-13 22:48:23,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16619 to 12932. [2025-04-13 22:48:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12932 states, 12931 states have (on average 4.136339030237414) internal successors, (53487), 12931 states have internal predecessors, (53487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:48:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12932 states to 12932 states and 53487 transitions. [2025-04-13 22:48:23,253 INFO L79 Accepts]: Start accepts. Automaton has 12932 states and 53487 transitions. Word has length 47 [2025-04-13 22:48:23,253 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:48:23,253 INFO L485 AbstractCegarLoop]: Abstraction has 12932 states and 53487 transitions. [2025-04-13 22:48:23,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.5) internal successors, (91), 27 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:48:23,253 INFO L278 IsEmpty]: Start isEmpty. Operand 12932 states and 53487 transitions. [2025-04-13 22:48:23,277 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 22:48:23,277 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:48:23,277 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:48:23,284 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 22:48:23,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:48:23,478 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 22:48:23,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:48:23,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1176423663, now seen corresponding path program 17 times [2025-04-13 22:48:23,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:48:23,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355342385] [2025-04-13 22:48:23,478 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:48:23,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:48:23,484 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:48:23,490 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:48:23,490 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:48:23,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:48:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:48:24,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:48:24,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355342385] [2025-04-13 22:48:24,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355342385] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:48:24,011 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712401970] [2025-04-13 22:48:24,011 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:48:24,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:48:24,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:48:24,012 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 22:48:24,013 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 22:48:24,115 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 3 equivalence classes. [2025-04-13 22:48:24,136 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 22:48:24,137 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:48:24,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:48:24,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 22:48:24,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:48:24,309 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:48:24,309 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 37 treesize of output 13 [2025-04-13 22:48:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:48:24,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:48:24,557 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:48:24,558 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 38 treesize of output 43 [2025-04-13 22:48:24,579 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:48:24,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712401970] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:48:24,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:48:24,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 31 [2025-04-13 22:48:24,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782976776] [2025-04-13 22:48:24,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:48:24,580 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:48:24,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:48:24,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:48:24,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:48:24,580 INFO L87 Difference]: Start difference. First operand 12932 states and 53487 transitions. Second operand has 32 states, 31 states have (on average 3.225806451612903) internal successors, (100), 32 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2025-04-13 22:48:35,780 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:48:35,780 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:48:35,781 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 22:48:35,781 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=535, Invalid=4295, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 22:48:35,782 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 785 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 5594 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 5697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 5594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:48:35,782 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 466 Invalid, 5697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 5594 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-04-13 22:48:35,783 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 22:48:35,790 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 22:48:35,983 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:48:35,984 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (12932states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (8407 states constructed, input type IntersectNwa). [2025-04-13 22:48:35,985 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2025-04-13 22:48:35,985 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 22:48:35,985 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 22:48:35,985 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-13 22:48:35,985 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork3Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-13 22:48:35,985 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork3Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2025-04-13 22:48:35,987 INFO L422 BasicCegarLoop]: Path program histogram: [31, 23, 17, 5, 5, 2, 1, 1] [2025-04-13 22:48:35,989 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:48:35,990 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:48:35,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:48:35 BasicIcfg [2025-04-13 22:48:35,991 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:48:35,991 INFO L158 Benchmark]: Toolchain (without parser) took 843155.52ms. Allocated memory was 167.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 117.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2025-04-13 22:48:35,992 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:48:35,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.89ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 101.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 22:48:35,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.11ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 99.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:48:35,992 INFO L158 Benchmark]: Boogie Preprocessor took 40.75ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 97.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:48:35,992 INFO L158 Benchmark]: IcfgBuilder took 711.79ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 92.9MB in the end (delta: 4.1MB). Peak memory consumption was 79.0MB. Max. memory is 8.0GB. [2025-04-13 22:48:35,992 INFO L158 Benchmark]: TraceAbstraction took 842088.68ms. Allocated memory was 167.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 92.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2025-04-13 22:48:35,992 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.19ms. Allocated memory is still 159.4MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 273.89ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 101.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.11ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 99.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 40.75ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 97.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 711.79ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 92.9MB in the end (delta: 4.1MB). Peak memory consumption was 79.0MB. Max. memory is 8.0GB. * TraceAbstraction took 842088.68ms. Allocated memory was 167.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 92.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (12932states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (8407 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (12932states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (8407 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (12932states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (8407 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (12932states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (8407 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (12932states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (8407 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (12932states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (8407 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (12932states) and FLOYD_HOARE automaton (currently 46 states, 32 states before enhancement),while ReachableStatesComputation was computing reachable states (8407 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 83 locations, 97 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 842.0s, OverallIterations: 85, TraceHistogramMax: 3, PathProgramHistogramMax: 31, EmptinessCheckTime: 0.9s, AutomataDifference: 622.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 97 mSolverCounterUnknown, 42299 SdHoareTripleChecker+Valid, 199.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42299 mSDsluCounter, 14892 SdHoareTripleChecker+Invalid, 185.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13786 mSDsCounter, 1593 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 211397 IncrementalHoareTripleChecker+Invalid, 213087 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1593 mSolverCounterUnsat, 1106 mSDtfsCounter, 211397 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6825 GetRequests, 4163 SyntacticMatches, 20 SemanticMatches, 2642 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41676 ImplicationChecksByTransitivity, 64.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12932occurred in iteration=84, InterpolantAutomatonStates: 1788, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 144.4s AutomataMinimizationTime, 84 MinimizatonAttempts, 319728 StatesRemovedByMinimization, 81 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 54.1s InterpolantComputationTime, 5975 NumberOfCodeBlocks, 5905 NumberOfCodeBlocksAsserted, 248 NumberOfCheckSat, 8107 ConstructedInterpolants, 118 QuantifiedInterpolants, 74470 SizeOfPredicates, 695 NumberOfNonLiveVariables, 16062 ConjunctsInSsa, 2063 ConjunctsInUnsatCore, 196 InterpolantComputations, 40 PerfectInterpolantSequences, 571/1122 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown