/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:22:32,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:22:32,168 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 18:22:32,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:22:32,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:22:32,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:22:32,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:22:32,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:22:32,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:22:32,196 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:22:32,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:22:32,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:22:32,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:22:32,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:22:32,197 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:22:32,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:22:32,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:22:32,198 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:22:32,198 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:22:32,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:22:32,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:22:32,198 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:22:32,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:22:32,198 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:22:32,198 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:22:32,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:22:32,198 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:22:32,198 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:22:32,198 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:22:32,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:22:32,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:22:32,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:22:32,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:22:32,199 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:22:32,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:22:32,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:22:32,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:22:32,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:22:32,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:22:32,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:22:32,199 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:22:32,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:22:32,199 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:22:32,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:22:32,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:22:32,199 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:22:32,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:22:32,200 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 18:22:32,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:22:32,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:22:32,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:22:32,469 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:22:32,471 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:22:32,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2025-04-13 18:22:33,814 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6651c3ecb/2ec85c846847456aaafee91dd44944b0/FLAG4eedb5336 [2025-04-13 18:22:34,006 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:22:34,007 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2025-04-13 18:22:34,017 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6651c3ecb/2ec85c846847456aaafee91dd44944b0/FLAG4eedb5336 [2025-04-13 18:22:35,915 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6651c3ecb/2ec85c846847456aaafee91dd44944b0 [2025-04-13 18:22:35,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:22:35,918 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:22:35,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:22:35,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:22:35,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:22:35,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:22:35" (1/1) ... [2025-04-13 18:22:35,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97acdad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:22:35, skipping insertion in model container [2025-04-13 18:22:35,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:22:35" (1/1) ... [2025-04-13 18:22:35,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:22:36,116 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c[2638,2651] [2025-04-13 18:22:36,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:22:36,130 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:22:36,150 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c[2638,2651] [2025-04-13 18:22:36,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:22:36,164 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:22:36,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:22:36 WrapperNode [2025-04-13 18:22:36,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:22:36,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:22:36,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:22:36,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:22:36,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:22:36" (1/1) ... [2025-04-13 18:22:36,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:22:36" (1/1) ... [2025-04-13 18:22:36,204 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 249 [2025-04-13 18:22:36,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:22:36,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:22:36,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:22:36,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:22:36,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:22:36" (1/1) ... [2025-04-13 18:22:36,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:22:36" (1/1) ... [2025-04-13 18:22:36,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:22:36" (1/1) ... [2025-04-13 18:22:36,229 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 18:22:36,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:22:36" (1/1) ... [2025-04-13 18:22:36,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:22:36" (1/1) ... [2025-04-13 18:22:36,236 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:22:36" (1/1) ... [2025-04-13 18:22:36,240 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:22:36" (1/1) ... [2025-04-13 18:22:36,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:22:36" (1/1) ... [2025-04-13 18:22:36,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:22:36" (1/1) ... [2025-04-13 18:22:36,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:22:36" (1/1) ... [2025-04-13 18:22:36,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:22:36,249 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:22:36,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:22:36,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:22:36,250 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:22:36" (1/1) ... [2025-04-13 18:22:36,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:22:36,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:36,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 18:22:36,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 18:22:36,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:22:36,296 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:22:36,296 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:22:36,296 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:22:36,296 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:22:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:22:36,297 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:22:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:22:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:22:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:22:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:22:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 18:22:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 18:22:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:22:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:22:36,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:22:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:22:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:22:36,299 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:22:36,371 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:22:36,373 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:22:36,651 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:22:36,652 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:22:36,652 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:22:36,962 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:22:36,964 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:22:36,966 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:22:36,968 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:22:36,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:22:36 BoogieIcfgContainer [2025-04-13 18:22:36,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:22:36,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:22:36,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:22:36,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:22:36,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:22:35" (1/3) ... [2025-04-13 18:22:36,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e9aec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:22:36, skipping insertion in model container [2025-04-13 18:22:36,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:22:36" (2/3) ... [2025-04-13 18:22:36,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e9aec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:22:36, skipping insertion in model container [2025-04-13 18:22:36,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:22:36" (3/3) ... [2025-04-13 18:22:36,977 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2025-04-13 18:22:36,988 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:22:36,990 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum2.wvr.c that has 4 procedures, 27 locations, 31 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-13 18:22:36,990 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:22:37,036 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 18:22:37,058 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 34 transitions, 89 flow [2025-04-13 18:22:37,091 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 194 states, 193 states have (on average 3.8704663212435233) internal successors, (747), 193 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:37,116 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:22:37,125 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;@1ea9083c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:22:37,126 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 18:22:37,129 INFO L278 IsEmpty]: Start isEmpty. Operand has 194 states, 193 states have (on average 3.8704663212435233) internal successors, (747), 193 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:37,136 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 18:22:37,136 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:37,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:37,137 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:37,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:37,143 INFO L85 PathProgramCache]: Analyzing trace with hash -759290619, now seen corresponding path program 1 times [2025-04-13 18:22:37,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:37,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735937797] [2025-04-13 18:22:37,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:22:37,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:37,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 18:22:37,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:22:37,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:37,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:37,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:37,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735937797] [2025-04-13 18:22:37,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735937797] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:37,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:37,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:22:37,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406089618] [2025-04-13 18:22:37,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:37,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:22:37,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:37,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:22:37,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:22:37,462 INFO L87 Difference]: Start difference. First operand has 194 states, 193 states have (on average 3.8704663212435233) internal successors, (747), 193 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:37,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:37,527 INFO L93 Difference]: Finished difference Result 258 states and 930 transitions. [2025-04-13 18:22:37,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:22:37,529 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 18:22:37,529 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:37,536 INFO L225 Difference]: With dead ends: 258 [2025-04-13 18:22:37,536 INFO L226 Difference]: Without dead ends: 194 [2025-04-13 18:22:37,538 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:22:37,540 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:37,540 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:22:37,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-04-13 18:22:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-04-13 18:22:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 3.6528497409326426) internal successors, (705), 193 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:37,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 705 transitions. [2025-04-13 18:22:37,575 INFO L79 Accepts]: Start accepts. Automaton has 194 states and 705 transitions. Word has length 16 [2025-04-13 18:22:37,576 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:37,576 INFO L485 AbstractCegarLoop]: Abstraction has 194 states and 705 transitions. [2025-04-13 18:22:37,576 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:37,576 INFO L278 IsEmpty]: Start isEmpty. Operand 194 states and 705 transitions. [2025-04-13 18:22:37,578 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 18:22:37,579 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:37,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:37,579 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:22:37,579 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:37,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:37,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1640689324, now seen corresponding path program 1 times [2025-04-13 18:22:37,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:37,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179658374] [2025-04-13 18:22:37,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:22:37,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:37,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 18:22:37,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 18:22:37,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:37,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:37,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:37,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179658374] [2025-04-13 18:22:37,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179658374] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:37,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:37,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:22:37,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506222329] [2025-04-13 18:22:37,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:37,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:22:37,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:37,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:22:37,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:22:37,709 INFO L87 Difference]: Start difference. First operand 194 states and 705 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:37,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:37,760 INFO L93 Difference]: Finished difference Result 233 states and 805 transitions. [2025-04-13 18:22:37,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:22:37,760 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 18:22:37,760 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:37,762 INFO L225 Difference]: With dead ends: 233 [2025-04-13 18:22:37,762 INFO L226 Difference]: Without dead ends: 194 [2025-04-13 18:22:37,763 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:22:37,763 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:37,766 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:22:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-04-13 18:22:37,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-04-13 18:22:37,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 3.461139896373057) internal successors, (668), 193 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:37,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 668 transitions. [2025-04-13 18:22:37,785 INFO L79 Accepts]: Start accepts. Automaton has 194 states and 668 transitions. Word has length 18 [2025-04-13 18:22:37,789 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:37,789 INFO L485 AbstractCegarLoop]: Abstraction has 194 states and 668 transitions. [2025-04-13 18:22:37,789 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:37,789 INFO L278 IsEmpty]: Start isEmpty. Operand 194 states and 668 transitions. [2025-04-13 18:22:37,790 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 18:22:37,791 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:37,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:37,791 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:22:37,791 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:37,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:37,791 INFO L85 PathProgramCache]: Analyzing trace with hash 727608399, now seen corresponding path program 1 times [2025-04-13 18:22:37,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:37,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534184887] [2025-04-13 18:22:37,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:22:37,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:37,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 18:22:37,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 18:22:37,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:37,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:37,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:37,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:37,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534184887] [2025-04-13 18:22:37,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534184887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:37,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:37,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:22:37,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434678386] [2025-04-13 18:22:37,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:37,966 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:22:37,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:37,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:22:37,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:22:37,966 INFO L87 Difference]: Start difference. First operand 194 states and 668 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:38,050 INFO L93 Difference]: Finished difference Result 389 states and 1339 transitions. [2025-04-13 18:22:38,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:22:38,051 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 18:22:38,051 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:38,053 INFO L225 Difference]: With dead ends: 389 [2025-04-13 18:22:38,053 INFO L226 Difference]: Without dead ends: 196 [2025-04-13 18:22:38,053 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:22:38,054 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:38,054 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:22:38,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-04-13 18:22:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-04-13 18:22:38,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 3.4358974358974357) internal successors, (670), 195 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 670 transitions. [2025-04-13 18:22:38,067 INFO L79 Accepts]: Start accepts. Automaton has 196 states and 670 transitions. Word has length 20 [2025-04-13 18:22:38,067 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:38,067 INFO L485 AbstractCegarLoop]: Abstraction has 196 states and 670 transitions. [2025-04-13 18:22:38,067 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:38,067 INFO L278 IsEmpty]: Start isEmpty. Operand 196 states and 670 transitions. [2025-04-13 18:22:38,068 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:38,068 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:38,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:38,068 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:22:38,071 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:38,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:38,071 INFO L85 PathProgramCache]: Analyzing trace with hash 126957711, now seen corresponding path program 1 times [2025-04-13 18:22:38,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:38,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775418191] [2025-04-13 18:22:38,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:22:38,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:38,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:22:38,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:38,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:38,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:38,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:38,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775418191] [2025-04-13 18:22:38,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775418191] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:38,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80077529] [2025-04-13 18:22:38,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:22:38,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:38,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:38,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:22:38,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 18:22:39,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:22:39,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:39,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:39,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:39,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 18:22:39,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:39,118 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:22:39,150 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:22:39,186 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:22:39,186 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 11 treesize of output 11 [2025-04-13 18:22:39,216 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:22:39,467 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 18:22:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:39,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:39,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:39,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80077529] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:39,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:22:39,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 10] total 26 [2025-04-13 18:22:39,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043785897] [2025-04-13 18:22:39,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:39,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:22:39,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:39,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:22:39,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:22:39,721 INFO L87 Difference]: Start difference. First operand 196 states and 670 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:40,071 INFO L93 Difference]: Finished difference Result 332 states and 1054 transitions. [2025-04-13 18:22:40,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:22:40,072 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:40,073 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:40,075 INFO L225 Difference]: With dead ends: 332 [2025-04-13 18:22:40,075 INFO L226 Difference]: Without dead ends: 326 [2025-04-13 18:22:40,077 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:22:40,078 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:40,078 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:22:40,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-04-13 18:22:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 228. [2025-04-13 18:22:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 3.2731277533039647) internal successors, (743), 227 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 743 transitions. [2025-04-13 18:22:40,099 INFO L79 Accepts]: Start accepts. Automaton has 228 states and 743 transitions. Word has length 22 [2025-04-13 18:22:40,099 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:40,100 INFO L485 AbstractCegarLoop]: Abstraction has 228 states and 743 transitions. [2025-04-13 18:22:40,100 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:40,100 INFO L278 IsEmpty]: Start isEmpty. Operand 228 states and 743 transitions. [2025-04-13 18:22:40,101 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:40,102 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:40,102 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:40,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 18:22:40,306 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:40,306 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:40,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:40,306 INFO L85 PathProgramCache]: Analyzing trace with hash 406316561, now seen corresponding path program 2 times [2025-04-13 18:22:40,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:40,307 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928239094] [2025-04-13 18:22:40,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:40,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:40,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:40,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:22:40,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:22:40,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:40,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:40,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928239094] [2025-04-13 18:22:40,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928239094] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:40,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:40,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:40,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993488016] [2025-04-13 18:22:40,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:40,778 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:22:40,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:40,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:22:40,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:22:40,778 INFO L87 Difference]: Start difference. First operand 228 states and 743 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:41,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:41,001 INFO L93 Difference]: Finished difference Result 306 states and 955 transitions. [2025-04-13 18:22:41,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:22:41,002 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:41,002 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:41,004 INFO L225 Difference]: With dead ends: 306 [2025-04-13 18:22:41,004 INFO L226 Difference]: Without dead ends: 300 [2025-04-13 18:22:41,005 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:22:41,005 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:41,005 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:22:41,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-04-13 18:22:41,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 238. [2025-04-13 18:22:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 3.240506329113924) internal successors, (768), 237 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 768 transitions. [2025-04-13 18:22:41,021 INFO L79 Accepts]: Start accepts. Automaton has 238 states and 768 transitions. Word has length 22 [2025-04-13 18:22:41,021 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:41,021 INFO L485 AbstractCegarLoop]: Abstraction has 238 states and 768 transitions. [2025-04-13 18:22:41,021 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:41,022 INFO L278 IsEmpty]: Start isEmpty. Operand 238 states and 768 transitions. [2025-04-13 18:22:41,022 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:41,022 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:41,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:41,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:22:41,022 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:41,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:41,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1932816369, now seen corresponding path program 3 times [2025-04-13 18:22:41,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:41,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757461416] [2025-04-13 18:22:41,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:22:41,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:41,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:41,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:22:41,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:22:41,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:41,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:41,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757461416] [2025-04-13 18:22:41,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757461416] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:41,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:41,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:41,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916796340] [2025-04-13 18:22:41,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:41,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:22:41,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:41,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:22:41,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:22:41,621 INFO L87 Difference]: Start difference. First operand 238 states and 768 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:42,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:42,039 INFO L93 Difference]: Finished difference Result 312 states and 994 transitions. [2025-04-13 18:22:42,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:22:42,040 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:42,040 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:42,042 INFO L225 Difference]: With dead ends: 312 [2025-04-13 18:22:42,042 INFO L226 Difference]: Without dead ends: 306 [2025-04-13 18:22:42,042 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:22:42,042 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:42,043 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:22:42,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-04-13 18:22:42,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 265. [2025-04-13 18:22:42,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 3.257575757575758) internal successors, (860), 264 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:42,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 860 transitions. [2025-04-13 18:22:42,051 INFO L79 Accepts]: Start accepts. Automaton has 265 states and 860 transitions. Word has length 22 [2025-04-13 18:22:42,052 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:42,052 INFO L485 AbstractCegarLoop]: Abstraction has 265 states and 860 transitions. [2025-04-13 18:22:42,052 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:42,052 INFO L278 IsEmpty]: Start isEmpty. Operand 265 states and 860 transitions. [2025-04-13 18:22:42,052 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:42,052 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:42,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:42,053 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:22:42,053 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:42,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:42,053 INFO L85 PathProgramCache]: Analyzing trace with hash 997394965, now seen corresponding path program 4 times [2025-04-13 18:22:42,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:42,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562052192] [2025-04-13 18:22:42,053 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:22:42,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:42,060 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:42,078 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:42,078 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:22:42,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:42,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:42,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562052192] [2025-04-13 18:22:42,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562052192] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:42,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:42,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:42,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415989143] [2025-04-13 18:22:42,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:42,426 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:22:42,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:42,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:22:42,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:22:42,427 INFO L87 Difference]: Start difference. First operand 265 states and 860 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:42,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:42,605 INFO L93 Difference]: Finished difference Result 323 states and 1016 transitions. [2025-04-13 18:22:42,605 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:22:42,605 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:42,605 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:42,607 INFO L225 Difference]: With dead ends: 323 [2025-04-13 18:22:42,607 INFO L226 Difference]: Without dead ends: 317 [2025-04-13 18:22:42,607 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:22:42,608 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:42,608 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:22:42,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-04-13 18:22:42,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 267. [2025-04-13 18:22:42,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 3.2518796992481205) internal successors, (865), 266 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 865 transitions. [2025-04-13 18:22:42,619 INFO L79 Accepts]: Start accepts. Automaton has 267 states and 865 transitions. Word has length 22 [2025-04-13 18:22:42,619 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:42,619 INFO L485 AbstractCegarLoop]: Abstraction has 267 states and 865 transitions. [2025-04-13 18:22:42,619 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:42,619 INFO L278 IsEmpty]: Start isEmpty. Operand 267 states and 865 transitions. [2025-04-13 18:22:42,620 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:42,620 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:42,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:42,620 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:22:42,620 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:42,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:42,621 INFO L85 PathProgramCache]: Analyzing trace with hash -807546477, now seen corresponding path program 5 times [2025-04-13 18:22:42,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:42,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507142977] [2025-04-13 18:22:42,621 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:42,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:42,630 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:42,645 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:42,646 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:42,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:43,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:43,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507142977] [2025-04-13 18:22:43,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507142977] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:43,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656012528] [2025-04-13 18:22:43,313 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:43,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:43,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:43,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:22:43,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 18:22:43,369 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:43,391 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:43,391 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:43,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:43,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 18:22:43,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:43,442 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:22:43,641 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:43,641 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 27 treesize of output 19 [2025-04-13 18:22:43,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:43,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:43,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656012528] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:43,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:22:43,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 9] total 24 [2025-04-13 18:22:43,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011980134] [2025-04-13 18:22:43,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:43,846 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:22:43,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:43,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:22:43,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:22:43,847 INFO L87 Difference]: Start difference. First operand 267 states and 865 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:44,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:44,244 INFO L93 Difference]: Finished difference Result 369 states and 1163 transitions. [2025-04-13 18:22:44,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:22:44,244 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:44,244 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:44,246 INFO L225 Difference]: With dead ends: 369 [2025-04-13 18:22:44,246 INFO L226 Difference]: Without dead ends: 363 [2025-04-13 18:22:44,247 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:22:44,247 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:44,247 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:22:44,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-04-13 18:22:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 267. [2025-04-13 18:22:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 3.2518796992481205) internal successors, (865), 266 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 865 transitions. [2025-04-13 18:22:44,258 INFO L79 Accepts]: Start accepts. Automaton has 267 states and 865 transitions. Word has length 22 [2025-04-13 18:22:44,259 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:44,259 INFO L485 AbstractCegarLoop]: Abstraction has 267 states and 865 transitions. [2025-04-13 18:22:44,259 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:44,259 INFO L278 IsEmpty]: Start isEmpty. Operand 267 states and 865 transitions. [2025-04-13 18:22:44,259 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:44,259 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:44,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:44,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 18:22:44,464 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-13 18:22:44,464 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:44,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:44,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1016699409, now seen corresponding path program 6 times [2025-04-13 18:22:44,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:44,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73973753] [2025-04-13 18:22:44,466 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:22:44,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:44,479 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:44,488 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:22:44,488 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:22:44,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:44,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:44,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73973753] [2025-04-13 18:22:44,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73973753] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:44,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:44,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:44,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556150395] [2025-04-13 18:22:44,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:44,944 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:22:44,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:44,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:22:44,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:22:44,945 INFO L87 Difference]: Start difference. First operand 267 states and 865 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:45,285 INFO L93 Difference]: Finished difference Result 311 states and 990 transitions. [2025-04-13 18:22:45,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:22:45,285 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:45,285 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:45,287 INFO L225 Difference]: With dead ends: 311 [2025-04-13 18:22:45,287 INFO L226 Difference]: Without dead ends: 305 [2025-04-13 18:22:45,287 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:22:45,288 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:45,288 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:22:45,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-04-13 18:22:45,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 271. [2025-04-13 18:22:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 3.248148148148148) internal successors, (877), 270 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:45,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 877 transitions. [2025-04-13 18:22:45,304 INFO L79 Accepts]: Start accepts. Automaton has 271 states and 877 transitions. Word has length 22 [2025-04-13 18:22:45,304 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:45,304 INFO L485 AbstractCegarLoop]: Abstraction has 271 states and 877 transitions. [2025-04-13 18:22:45,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:45,304 INFO L278 IsEmpty]: Start isEmpty. Operand 271 states and 877 transitions. [2025-04-13 18:22:45,305 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:45,305 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:45,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:45,305 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:22:45,305 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:45,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:45,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1537405297, now seen corresponding path program 7 times [2025-04-13 18:22:45,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:45,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126416656] [2025-04-13 18:22:45,305 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:45,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:45,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:22:45,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:45,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:45,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:45,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:45,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126416656] [2025-04-13 18:22:45,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126416656] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:45,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845981368] [2025-04-13 18:22:45,870 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:45,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:45,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:45,875 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:22:45,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 18:22:45,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:22:45,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:45,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:45,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:45,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 18:22:45,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:45,957 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:22:45,983 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:22:46,003 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:22:46,004 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 11 treesize of output 11 [2025-04-13 18:22:46,023 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:22:46,186 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 18:22:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:46,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:46,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845981368] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:46,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:22:46,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 10] total 26 [2025-04-13 18:22:46,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138565281] [2025-04-13 18:22:46,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:46,342 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:22:46,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:46,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:22:46,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:22:46,343 INFO L87 Difference]: Start difference. First operand 271 states and 877 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:46,639 INFO L93 Difference]: Finished difference Result 365 states and 1159 transitions. [2025-04-13 18:22:46,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:22:46,639 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:46,639 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:46,641 INFO L225 Difference]: With dead ends: 365 [2025-04-13 18:22:46,641 INFO L226 Difference]: Without dead ends: 359 [2025-04-13 18:22:46,642 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:22:46,642 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:46,642 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:22:46,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-04-13 18:22:46,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 271. [2025-04-13 18:22:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 3.248148148148148) internal successors, (877), 270 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 877 transitions. [2025-04-13 18:22:46,650 INFO L79 Accepts]: Start accepts. Automaton has 271 states and 877 transitions. Word has length 22 [2025-04-13 18:22:46,650 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:46,650 INFO L485 AbstractCegarLoop]: Abstraction has 271 states and 877 transitions. [2025-04-13 18:22:46,650 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:46,650 INFO L278 IsEmpty]: Start isEmpty. Operand 271 states and 877 transitions. [2025-04-13 18:22:46,651 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:46,651 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:46,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:46,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 18:22:46,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:46,855 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:46,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:46,855 INFO L85 PathProgramCache]: Analyzing trace with hash 970429909, now seen corresponding path program 8 times [2025-04-13 18:22:46,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:46,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903332994] [2025-04-13 18:22:46,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:46,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:46,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:46,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:22:46,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:22:46,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:47,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:47,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:47,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903332994] [2025-04-13 18:22:47,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903332994] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:47,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:47,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:47,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199366441] [2025-04-13 18:22:47,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:47,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:22:47,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:47,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:22:47,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:22:47,116 INFO L87 Difference]: Start difference. First operand 271 states and 877 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:47,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:47,310 INFO L93 Difference]: Finished difference Result 325 states and 1016 transitions. [2025-04-13 18:22:47,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:22:47,310 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:47,311 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:47,312 INFO L225 Difference]: With dead ends: 325 [2025-04-13 18:22:47,312 INFO L226 Difference]: Without dead ends: 319 [2025-04-13 18:22:47,313 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:22:47,313 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:47,313 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:22:47,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-04-13 18:22:47,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 267. [2025-04-13 18:22:47,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 3.2518796992481205) internal successors, (865), 266 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:47,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 865 transitions. [2025-04-13 18:22:47,320 INFO L79 Accepts]: Start accepts. Automaton has 267 states and 865 transitions. Word has length 22 [2025-04-13 18:22:47,320 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:47,320 INFO L485 AbstractCegarLoop]: Abstraction has 267 states and 865 transitions. [2025-04-13 18:22:47,320 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:47,320 INFO L278 IsEmpty]: Start isEmpty. Operand 267 states and 865 transitions. [2025-04-13 18:22:47,321 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:47,321 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:47,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:47,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 18:22:47,321 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:47,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:47,322 INFO L85 PathProgramCache]: Analyzing trace with hash -832465383, now seen corresponding path program 9 times [2025-04-13 18:22:47,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:47,322 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669495479] [2025-04-13 18:22:47,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:22:47,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:47,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:47,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:22:47,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:22:47,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:47,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:47,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:47,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669495479] [2025-04-13 18:22:47,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669495479] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:47,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:47,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:47,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996025434] [2025-04-13 18:22:47,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:47,633 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:22:47,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:47,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:22:47,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:22:47,633 INFO L87 Difference]: Start difference. First operand 267 states and 865 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:47,927 INFO L93 Difference]: Finished difference Result 375 states and 1177 transitions. [2025-04-13 18:22:47,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:22:47,927 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:47,927 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:47,929 INFO L225 Difference]: With dead ends: 375 [2025-04-13 18:22:47,929 INFO L226 Difference]: Without dead ends: 369 [2025-04-13 18:22:47,930 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:22:47,930 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:47,930 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:22:47,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-04-13 18:22:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 284. [2025-04-13 18:22:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.265017667844523) internal successors, (924), 283 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 924 transitions. [2025-04-13 18:22:47,938 INFO L79 Accepts]: Start accepts. Automaton has 284 states and 924 transitions. Word has length 22 [2025-04-13 18:22:47,938 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:47,938 INFO L485 AbstractCegarLoop]: Abstraction has 284 states and 924 transitions. [2025-04-13 18:22:47,938 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:47,938 INFO L278 IsEmpty]: Start isEmpty. Operand 284 states and 924 transitions. [2025-04-13 18:22:47,938 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:47,938 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:47,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:47,939 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 18:22:47,939 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:47,939 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:47,939 INFO L85 PathProgramCache]: Analyzing trace with hash 925147695, now seen corresponding path program 10 times [2025-04-13 18:22:47,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:47,939 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225192715] [2025-04-13 18:22:47,939 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:22:47,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:47,944 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:47,951 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:47,951 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:22:47,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:48,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:48,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:48,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225192715] [2025-04-13 18:22:48,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225192715] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:48,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930866379] [2025-04-13 18:22:48,282 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:22:48,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:48,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:48,284 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:22:48,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 18:22:48,333 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:48,353 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:48,353 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:22:48,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:48,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 18:22:48,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:48,367 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:22:48,382 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:22:48,408 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:22:48,408 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 11 treesize of output 11 [2025-04-13 18:22:48,432 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:22:48,595 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 18:22:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:48,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:48,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930866379] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:48,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:22:48,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 10] total 25 [2025-04-13 18:22:48,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499734994] [2025-04-13 18:22:48,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:48,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:22:48,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:48,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:22:48,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:22:48,748 INFO L87 Difference]: Start difference. First operand 284 states and 924 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:49,069 INFO L93 Difference]: Finished difference Result 419 states and 1327 transitions. [2025-04-13 18:22:49,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:22:49,070 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:49,070 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:49,072 INFO L225 Difference]: With dead ends: 419 [2025-04-13 18:22:49,072 INFO L226 Difference]: Without dead ends: 413 [2025-04-13 18:22:49,073 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:22:49,073 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:49,073 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:22:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-04-13 18:22:49,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 288. [2025-04-13 18:22:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 3.268292682926829) internal successors, (938), 287 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:49,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 938 transitions. [2025-04-13 18:22:49,082 INFO L79 Accepts]: Start accepts. Automaton has 288 states and 938 transitions. Word has length 22 [2025-04-13 18:22:49,082 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:49,082 INFO L485 AbstractCegarLoop]: Abstraction has 288 states and 938 transitions. [2025-04-13 18:22:49,083 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:49,083 INFO L278 IsEmpty]: Start isEmpty. Operand 288 states and 938 transitions. [2025-04-13 18:22:49,084 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:49,084 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:49,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:49,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 18:22:49,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:49,289 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:49,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:49,289 INFO L85 PathProgramCache]: Analyzing trace with hash -122627417, now seen corresponding path program 11 times [2025-04-13 18:22:49,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:49,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87315270] [2025-04-13 18:22:49,289 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:49,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:49,295 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:49,309 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:49,309 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:49,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:49,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:49,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87315270] [2025-04-13 18:22:49,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87315270] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:49,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123695920] [2025-04-13 18:22:49,753 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:49,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:49,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:49,755 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:22:49,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 18:22:49,804 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:49,824 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:49,824 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:49,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:49,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 18:22:49,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:49,870 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:22:50,076 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:50,077 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 27 treesize of output 19 [2025-04-13 18:22:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:50,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:50,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123695920] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:50,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:22:50,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 9] total 24 [2025-04-13 18:22:50,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750264610] [2025-04-13 18:22:50,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:50,236 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:22:50,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:50,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:22:50,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:22:50,237 INFO L87 Difference]: Start difference. First operand 288 states and 938 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:50,682 INFO L93 Difference]: Finished difference Result 463 states and 1433 transitions. [2025-04-13 18:22:50,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:22:50,683 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:50,683 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:50,685 INFO L225 Difference]: With dead ends: 463 [2025-04-13 18:22:50,685 INFO L226 Difference]: Without dead ends: 457 [2025-04-13 18:22:50,685 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:22:50,686 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:50,686 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:22:50,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-04-13 18:22:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 288. [2025-04-13 18:22:50,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 3.268292682926829) internal successors, (938), 287 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 938 transitions. [2025-04-13 18:22:50,694 INFO L79 Accepts]: Start accepts. Automaton has 288 states and 938 transitions. Word has length 22 [2025-04-13 18:22:50,695 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:50,695 INFO L485 AbstractCegarLoop]: Abstraction has 288 states and 938 transitions. [2025-04-13 18:22:50,695 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:50,695 INFO L278 IsEmpty]: Start isEmpty. Operand 288 states and 938 transitions. [2025-04-13 18:22:50,696 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:50,696 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:50,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:50,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 18:22:50,900 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,SelfDestructingSolverStorable13 [2025-04-13 18:22:50,900 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:50,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:50,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1516226099, now seen corresponding path program 12 times [2025-04-13 18:22:50,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:50,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303927342] [2025-04-13 18:22:50,900 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:22:50,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:50,907 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:50,914 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:22:50,914 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:22:50,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:51,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:51,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303927342] [2025-04-13 18:22:51,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303927342] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:51,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:51,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:51,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638973485] [2025-04-13 18:22:51,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:51,223 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:22:51,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:51,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:22:51,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:22:51,224 INFO L87 Difference]: Start difference. First operand 288 states and 938 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:51,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:51,402 INFO L93 Difference]: Finished difference Result 342 states and 1080 transitions. [2025-04-13 18:22:51,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:22:51,403 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:51,403 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:51,404 INFO L225 Difference]: With dead ends: 342 [2025-04-13 18:22:51,405 INFO L226 Difference]: Without dead ends: 336 [2025-04-13 18:22:51,406 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:22:51,406 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:51,407 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:22:51,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-04-13 18:22:51,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 290. [2025-04-13 18:22:51,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 3.262975778546713) internal successors, (943), 289 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 943 transitions. [2025-04-13 18:22:51,414 INFO L79 Accepts]: Start accepts. Automaton has 290 states and 943 transitions. Word has length 22 [2025-04-13 18:22:51,414 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:51,414 INFO L485 AbstractCegarLoop]: Abstraction has 290 states and 943 transitions. [2025-04-13 18:22:51,415 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:51,415 INFO L278 IsEmpty]: Start isEmpty. Operand 290 states and 943 transitions. [2025-04-13 18:22:51,415 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:51,415 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:51,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:51,415 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 18:22:51,415 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:51,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:51,416 INFO L85 PathProgramCache]: Analyzing trace with hash 162602109, now seen corresponding path program 13 times [2025-04-13 18:22:51,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:51,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686206425] [2025-04-13 18:22:51,416 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:51,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:51,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:22:51,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:51,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:51,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:51,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:51,847 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686206425] [2025-04-13 18:22:51,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686206425] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:51,847 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313573807] [2025-04-13 18:22:51,847 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:51,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:51,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:51,849 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:22:51,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 18:22:51,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:22:51,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:51,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:51,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:51,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 18:22:51,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:51,926 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:22:51,945 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:22:51,967 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:22:51,967 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 11 treesize of output 11 [2025-04-13 18:22:51,987 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:22:52,178 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 18:22:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:52,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:52,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:52,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313573807] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:52,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:22:52,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 10] total 26 [2025-04-13 18:22:52,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277159440] [2025-04-13 18:22:52,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:52,359 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:22:52,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:52,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:22:52,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:22:52,360 INFO L87 Difference]: Start difference. First operand 290 states and 943 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:52,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:52,835 INFO L93 Difference]: Finished difference Result 505 states and 1580 transitions. [2025-04-13 18:22:52,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:22:52,835 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:52,835 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:52,838 INFO L225 Difference]: With dead ends: 505 [2025-04-13 18:22:52,838 INFO L226 Difference]: Without dead ends: 499 [2025-04-13 18:22:52,838 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=1215, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:22:52,839 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:52,839 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:22:52,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-04-13 18:22:52,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 295. [2025-04-13 18:22:52,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 3.2823129251700682) internal successors, (965), 294 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:52,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 965 transitions. [2025-04-13 18:22:52,847 INFO L79 Accepts]: Start accepts. Automaton has 295 states and 965 transitions. Word has length 22 [2025-04-13 18:22:52,847 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:52,847 INFO L485 AbstractCegarLoop]: Abstraction has 295 states and 965 transitions. [2025-04-13 18:22:52,847 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:52,848 INFO L278 IsEmpty]: Start isEmpty. Operand 295 states and 965 transitions. [2025-04-13 18:22:52,848 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:52,848 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:52,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:52,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 18:22:53,049 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 18:22:53,049 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:53,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:53,049 INFO L85 PathProgramCache]: Analyzing trace with hash -497868275, now seen corresponding path program 14 times [2025-04-13 18:22:53,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:53,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735751913] [2025-04-13 18:22:53,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:53,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:53,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:53,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:22:53,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:22:53,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:53,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:53,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735751913] [2025-04-13 18:22:53,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735751913] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:53,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:53,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:22:53,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392261459] [2025-04-13 18:22:53,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:53,296 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:53,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:53,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:53,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:53,297 INFO L87 Difference]: Start difference. First operand 295 states and 965 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:53,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:53,456 INFO L93 Difference]: Finished difference Result 341 states and 1090 transitions. [2025-04-13 18:22:53,456 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:22:53,456 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:53,456 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:53,458 INFO L225 Difference]: With dead ends: 341 [2025-04-13 18:22:53,458 INFO L226 Difference]: Without dead ends: 335 [2025-04-13 18:22:53,458 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:22:53,460 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:53,460 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:22:53,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-04-13 18:22:53,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 297. [2025-04-13 18:22:53,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 3.2837837837837838) internal successors, (972), 296 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 972 transitions. [2025-04-13 18:22:53,467 INFO L79 Accepts]: Start accepts. Automaton has 297 states and 972 transitions. Word has length 22 [2025-04-13 18:22:53,467 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:53,467 INFO L485 AbstractCegarLoop]: Abstraction has 297 states and 972 transitions. [2025-04-13 18:22:53,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:53,467 INFO L278 IsEmpty]: Start isEmpty. Operand 297 states and 972 transitions. [2025-04-13 18:22:53,468 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:53,468 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:53,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] [2025-04-13 18:22:53,468 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 18:22:53,468 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:53,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:53,469 INFO L85 PathProgramCache]: Analyzing trace with hash 319898589, now seen corresponding path program 15 times [2025-04-13 18:22:53,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:53,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027172215] [2025-04-13 18:22:53,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:22:53,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:53,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:53,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:22:53,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:22:53,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:53,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:53,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027172215] [2025-04-13 18:22:53,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027172215] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:53,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:53,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:53,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667832790] [2025-04-13 18:22:53,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:53,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:22:53,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:53,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:22:53,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:22:53,771 INFO L87 Difference]: Start difference. First operand 297 states and 972 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:54,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:54,003 INFO L93 Difference]: Finished difference Result 366 states and 1176 transitions. [2025-04-13 18:22:54,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:22:54,004 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:54,004 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:54,006 INFO L225 Difference]: With dead ends: 366 [2025-04-13 18:22:54,006 INFO L226 Difference]: Without dead ends: 360 [2025-04-13 18:22:54,006 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:22:54,006 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:54,006 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:22:54,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-04-13 18:22:54,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 294. [2025-04-13 18:22:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.279863481228669) internal successors, (961), 293 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 961 transitions. [2025-04-13 18:22:54,013 INFO L79 Accepts]: Start accepts. Automaton has 294 states and 961 transitions. Word has length 22 [2025-04-13 18:22:54,013 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:54,013 INFO L485 AbstractCegarLoop]: Abstraction has 294 states and 961 transitions. [2025-04-13 18:22:54,013 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:54,013 INFO L278 IsEmpty]: Start isEmpty. Operand 294 states and 961 transitions. [2025-04-13 18:22:54,014 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:54,014 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:54,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:54,015 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 18:22:54,015 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:54,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:54,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1489261043, now seen corresponding path program 16 times [2025-04-13 18:22:54,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:54,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038746579] [2025-04-13 18:22:54,015 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:22:54,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:54,020 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:54,041 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:54,041 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:22:54,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:54,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:54,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:54,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038746579] [2025-04-13 18:22:54,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038746579] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:54,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:54,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:54,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706339876] [2025-04-13 18:22:54,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:54,289 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:22:54,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:54,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:22:54,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:22:54,289 INFO L87 Difference]: Start difference. First operand 294 states and 961 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:54,528 INFO L93 Difference]: Finished difference Result 344 states and 1086 transitions. [2025-04-13 18:22:54,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:22:54,528 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:54,528 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:54,530 INFO L225 Difference]: With dead ends: 344 [2025-04-13 18:22:54,530 INFO L226 Difference]: Without dead ends: 338 [2025-04-13 18:22:54,531 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:22:54,531 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:54,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:22:54,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-04-13 18:22:54,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 288. [2025-04-13 18:22:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 3.289198606271777) internal successors, (944), 287 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 944 transitions. [2025-04-13 18:22:54,537 INFO L79 Accepts]: Start accepts. Automaton has 288 states and 944 transitions. Word has length 22 [2025-04-13 18:22:54,537 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:54,537 INFO L485 AbstractCegarLoop]: Abstraction has 288 states and 944 transitions. [2025-04-13 18:22:54,538 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:54,538 INFO L278 IsEmpty]: Start isEmpty. Operand 288 states and 944 transitions. [2025-04-13 18:22:54,538 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:54,538 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:54,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:54,538 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 18:22:54,538 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:54,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:54,539 INFO L85 PathProgramCache]: Analyzing trace with hash -567518949, now seen corresponding path program 17 times [2025-04-13 18:22:54,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:54,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810322885] [2025-04-13 18:22:54,539 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:54,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:54,544 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:54,549 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:54,549 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:54,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:54,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:54,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:54,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810322885] [2025-04-13 18:22:54,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810322885] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:54,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134299916] [2025-04-13 18:22:54,891 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:54,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:54,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:54,893 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:22:54,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 18:22:54,946 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:54,965 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:54,965 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:54,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:54,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 18:22:54,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:55,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 15 treesize of output 1 [2025-04-13 18:22:55,167 INFO L325 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2025-04-13 18:22:55,167 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 31 treesize of output 43 [2025-04-13 18:22:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:55,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:55,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:55,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134299916] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:55,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:22:55,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 9] total 23 [2025-04-13 18:22:55,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204416540] [2025-04-13 18:22:55,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:55,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:22:55,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:55,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:22:55,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:22:55,344 INFO L87 Difference]: Start difference. First operand 288 states and 944 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:55,844 INFO L93 Difference]: Finished difference Result 543 states and 1716 transitions. [2025-04-13 18:22:55,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:22:55,844 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:55,844 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:55,847 INFO L225 Difference]: With dead ends: 543 [2025-04-13 18:22:55,847 INFO L226 Difference]: Without dead ends: 537 [2025-04-13 18:22:55,847 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=948, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:22:55,848 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:55,848 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:22:55,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-04-13 18:22:55,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 292. [2025-04-13 18:22:55,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.3195876288659796) internal successors, (966), 291 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 966 transitions. [2025-04-13 18:22:55,855 INFO L79 Accepts]: Start accepts. Automaton has 292 states and 966 transitions. Word has length 22 [2025-04-13 18:22:55,855 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:55,855 INFO L485 AbstractCegarLoop]: Abstraction has 292 states and 966 transitions. [2025-04-13 18:22:55,855 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:55,855 INFO L278 IsEmpty]: Start isEmpty. Operand 292 states and 966 transitions. [2025-04-13 18:22:55,855 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:55,855 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:55,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:55,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 18:22:56,060 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 18:22:56,060 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:56,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:56,060 INFO L85 PathProgramCache]: Analyzing trace with hash -431521493, now seen corresponding path program 18 times [2025-04-13 18:22:56,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:56,060 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406134173] [2025-04-13 18:22:56,061 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:22:56,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:56,065 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:56,070 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:22:56,070 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:22:56,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:56,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:56,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406134173] [2025-04-13 18:22:56,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406134173] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:56,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:56,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:56,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363234099] [2025-04-13 18:22:56,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:56,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:22:56,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:56,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:22:56,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:22:56,311 INFO L87 Difference]: Start difference. First operand 292 states and 966 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:56,524 INFO L93 Difference]: Finished difference Result 362 states and 1171 transitions. [2025-04-13 18:22:56,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:22:56,524 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:56,525 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:56,526 INFO L225 Difference]: With dead ends: 362 [2025-04-13 18:22:56,526 INFO L226 Difference]: Without dead ends: 356 [2025-04-13 18:22:56,526 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:22:56,527 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:56,527 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:22:56,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-04-13 18:22:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 294. [2025-04-13 18:22:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3344709897610922) internal successors, (977), 293 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:56,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 977 transitions. [2025-04-13 18:22:56,533 INFO L79 Accepts]: Start accepts. Automaton has 294 states and 977 transitions. Word has length 22 [2025-04-13 18:22:56,533 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:56,533 INFO L485 AbstractCegarLoop]: Abstraction has 294 states and 977 transitions. [2025-04-13 18:22:56,533 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:56,533 INFO L278 IsEmpty]: Start isEmpty. Operand 294 states and 977 transitions. [2025-04-13 18:22:56,535 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:56,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:56,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:56,535 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 18:22:56,535 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:56,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:56,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1309315277, now seen corresponding path program 19 times [2025-04-13 18:22:56,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:56,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127723173] [2025-04-13 18:22:56,536 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:56,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:56,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:22:56,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:56,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:56,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:56,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:56,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127723173] [2025-04-13 18:22:56,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127723173] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:56,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539581314] [2025-04-13 18:22:56,895 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:56,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:56,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:56,897 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:22:56,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 18:22:56,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:22:56,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:56,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:56,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:56,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 18:22:56,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:56,981 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:22:57,002 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:22:57,021 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:22:57,021 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 11 treesize of output 11 [2025-04-13 18:22:57,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:22:57,180 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 18:22:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:57,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:57,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539581314] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:57,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:22:57,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 10] total 25 [2025-04-13 18:22:57,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354285912] [2025-04-13 18:22:57,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:57,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:22:57,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:57,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:22:57,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:22:57,322 INFO L87 Difference]: Start difference. First operand 294 states and 977 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:57,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:57,620 INFO L93 Difference]: Finished difference Result 436 states and 1372 transitions. [2025-04-13 18:22:57,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:22:57,624 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:57,625 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:57,626 INFO L225 Difference]: With dead ends: 436 [2025-04-13 18:22:57,626 INFO L226 Difference]: Without dead ends: 430 [2025-04-13 18:22:57,627 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:22:57,628 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:57,628 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:22:57,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-04-13 18:22:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 290. [2025-04-13 18:22:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 3.3356401384083045) internal successors, (964), 289 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 964 transitions. [2025-04-13 18:22:57,635 INFO L79 Accepts]: Start accepts. Automaton has 290 states and 964 transitions. Word has length 22 [2025-04-13 18:22:57,635 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:57,635 INFO L485 AbstractCegarLoop]: Abstraction has 290 states and 964 transitions. [2025-04-13 18:22:57,635 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:57,635 INFO L278 IsEmpty]: Start isEmpty. Operand 290 states and 964 transitions. [2025-04-13 18:22:57,636 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:57,636 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:57,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:57,642 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 18:22:57,836 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,SelfDestructingSolverStorable21 [2025-04-13 18:22:57,836 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:57,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:57,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1231131195, now seen corresponding path program 20 times [2025-04-13 18:22:57,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:57,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403850806] [2025-04-13 18:22:57,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:57,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:57,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:57,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:22:57,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:22:57,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:58,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:58,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403850806] [2025-04-13 18:22:58,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403850806] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:58,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:58,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:58,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080242151] [2025-04-13 18:22:58,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:58,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:22:58,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:58,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:22:58,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:22:58,145 INFO L87 Difference]: Start difference. First operand 290 states and 964 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:58,421 INFO L93 Difference]: Finished difference Result 340 states and 1103 transitions. [2025-04-13 18:22:58,421 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:22:58,421 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:58,421 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:58,423 INFO L225 Difference]: With dead ends: 340 [2025-04-13 18:22:58,423 INFO L226 Difference]: Without dead ends: 334 [2025-04-13 18:22:58,423 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:22:58,424 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:58,424 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:22:58,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-04-13 18:22:58,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 292. [2025-04-13 18:22:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.336769759450172) internal successors, (971), 291 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:58,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 971 transitions. [2025-04-13 18:22:58,430 INFO L79 Accepts]: Start accepts. Automaton has 292 states and 971 transitions. Word has length 22 [2025-04-13 18:22:58,430 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:58,430 INFO L485 AbstractCegarLoop]: Abstraction has 292 states and 971 transitions. [2025-04-13 18:22:58,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:58,430 INFO L278 IsEmpty]: Start isEmpty. Operand 292 states and 971 transitions. [2025-04-13 18:22:58,430 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:58,430 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:58,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:58,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 18:22:58,431 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:58,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:58,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1558676263, now seen corresponding path program 21 times [2025-04-13 18:22:58,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:58,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293088259] [2025-04-13 18:22:58,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:22:58,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:58,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:58,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:22:58,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:22:58,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:58,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:58,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293088259] [2025-04-13 18:22:58,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293088259] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:58,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:58,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:58,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401764422] [2025-04-13 18:22:58,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:58,683 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:22:58,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:58,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:22:58,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:22:58,684 INFO L87 Difference]: Start difference. First operand 292 states and 971 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:58,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:58,830 INFO L93 Difference]: Finished difference Result 370 states and 1198 transitions. [2025-04-13 18:22:58,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:22:58,830 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:58,830 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:58,832 INFO L225 Difference]: With dead ends: 370 [2025-04-13 18:22:58,832 INFO L226 Difference]: Without dead ends: 364 [2025-04-13 18:22:58,832 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:22:58,833 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:58,833 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:22:58,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-04-13 18:22:58,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 296. [2025-04-13 18:22:58,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.3661016949152542) internal successors, (993), 295 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:58,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 993 transitions. [2025-04-13 18:22:58,839 INFO L79 Accepts]: Start accepts. Automaton has 296 states and 993 transitions. Word has length 22 [2025-04-13 18:22:58,839 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:58,839 INFO L485 AbstractCegarLoop]: Abstraction has 296 states and 993 transitions. [2025-04-13 18:22:58,839 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:58,839 INFO L278 IsEmpty]: Start isEmpty. Operand 296 states and 993 transitions. [2025-04-13 18:22:58,839 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:58,839 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:58,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:58,840 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 18:22:58,840 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:22:58,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:58,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1211722433, now seen corresponding path program 22 times [2025-04-13 18:22:58,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:58,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985496859] [2025-04-13 18:22:58,840 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:22:58,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:58,847 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:58,855 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:58,855 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:22:58,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:59,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:59,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:59,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985496859] [2025-04-13 18:22:59,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985496859] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:59,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274040377] [2025-04-13 18:22:59,145 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:22:59,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:59,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:59,147 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:22:59,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 18:22:59,199 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:59,219 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:59,219 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:22:59,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:59,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 18:22:59,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:59,230 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:22:59,249 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:22:59,273 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:22:59,273 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 11 treesize of output 11 [2025-04-13 18:22:59,293 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:22:59,443 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:59,443 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 27 [2025-04-13 18:22:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:59,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:59,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274040377] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:59,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:22:59,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 10] total 24 [2025-04-13 18:22:59,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835933602] [2025-04-13 18:22:59,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:59,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:22:59,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:59,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:22:59,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:22:59,588 INFO L87 Difference]: Start difference. First operand 296 states and 993 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:59,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:59,969 INFO L93 Difference]: Finished difference Result 533 states and 1721 transitions. [2025-04-13 18:22:59,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:22:59,970 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:59,970 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:59,972 INFO L225 Difference]: With dead ends: 533 [2025-04-13 18:22:59,972 INFO L226 Difference]: Without dead ends: 527 [2025-04-13 18:22:59,972 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=1001, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:22:59,973 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 105 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:59,973 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 0 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:22:59,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-04-13 18:22:59,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 300. [2025-04-13 18:22:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.3812709030100336) internal successors, (1011), 299 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1011 transitions. [2025-04-13 18:22:59,984 INFO L79 Accepts]: Start accepts. Automaton has 300 states and 1011 transitions. Word has length 22 [2025-04-13 18:22:59,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:59,984 INFO L485 AbstractCegarLoop]: Abstraction has 300 states and 1011 transitions. [2025-04-13 18:22:59,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:59,985 INFO L278 IsEmpty]: Start isEmpty. Operand 300 states and 1011 transitions. [2025-04-13 18:22:59,985 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:59,985 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:59,985 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:59,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 18:23:00,186 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-13 18:23:00,186 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:00,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:00,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1288106713, now seen corresponding path program 23 times [2025-04-13 18:23:00,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:00,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399543562] [2025-04-13 18:23:00,186 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:23:00,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:00,192 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:23:00,201 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:23:00,201 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:00,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:00,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:23:00,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:00,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399543562] [2025-04-13 18:23:00,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399543562] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:00,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418422461] [2025-04-13 18:23:00,629 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:23:00,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:00,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:00,632 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:00,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 18:23:00,685 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:23:00,701 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:23:00,701 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:00,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:00,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 18:23:00,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:00,743 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:23:00,902 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:23:00,902 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 27 treesize of output 19 [2025-04-13 18:23:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:00,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:23:01,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418422461] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:01,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:23:01,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 9] total 24 [2025-04-13 18:23:01,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802374755] [2025-04-13 18:23:01,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:01,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:23:01,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:01,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:23:01,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:23:01,036 INFO L87 Difference]: Start difference. First operand 300 states and 1011 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:01,343 INFO L93 Difference]: Finished difference Result 416 states and 1349 transitions. [2025-04-13 18:23:01,344 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:23:01,344 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:23:01,344 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:01,346 INFO L225 Difference]: With dead ends: 416 [2025-04-13 18:23:01,346 INFO L226 Difference]: Without dead ends: 410 [2025-04-13 18:23:01,346 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:23:01,346 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:01,347 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:23:01,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-04-13 18:23:01,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 302. [2025-04-13 18:23:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 3.3754152823920265) internal successors, (1016), 301 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 1016 transitions. [2025-04-13 18:23:01,352 INFO L79 Accepts]: Start accepts. Automaton has 302 states and 1016 transitions. Word has length 22 [2025-04-13 18:23:01,352 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:01,352 INFO L485 AbstractCegarLoop]: Abstraction has 302 states and 1016 transitions. [2025-04-13 18:23:01,352 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:01,352 INFO L278 IsEmpty]: Start isEmpty. Operand 302 states and 1016 transitions. [2025-04-13 18:23:01,353 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:23:01,353 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:01,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:01,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 18:23:01,554 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,SelfDestructingSolverStorable25 [2025-04-13 18:23:01,554 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:01,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:01,555 INFO L85 PathProgramCache]: Analyzing trace with hash 394258567, now seen corresponding path program 24 times [2025-04-13 18:23:01,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:01,555 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610164472] [2025-04-13 18:23:01,555 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:23:01,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:01,560 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:23:01,564 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:23:01,564 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:23:01,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:23:01,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:01,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610164472] [2025-04-13 18:23:01,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610164472] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:01,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:01,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:23:01,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619313323] [2025-04-13 18:23:01,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:01,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:23:01,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:01,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:23:01,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:23:01,801 INFO L87 Difference]: Start difference. First operand 302 states and 1016 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:02,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:02,192 INFO L93 Difference]: Finished difference Result 428 states and 1412 transitions. [2025-04-13 18:23:02,192 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:23:02,192 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:23:02,192 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:02,194 INFO L225 Difference]: With dead ends: 428 [2025-04-13 18:23:02,194 INFO L226 Difference]: Without dead ends: 422 [2025-04-13 18:23:02,194 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:23:02,195 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:02,195 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:23:02,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-04-13 18:23:02,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 302. [2025-04-13 18:23:02,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 3.3754152823920265) internal successors, (1016), 301 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:02,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 1016 transitions. [2025-04-13 18:23:02,200 INFO L79 Accepts]: Start accepts. Automaton has 302 states and 1016 transitions. Word has length 22 [2025-04-13 18:23:02,200 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:02,200 INFO L485 AbstractCegarLoop]: Abstraction has 302 states and 1016 transitions. [2025-04-13 18:23:02,200 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:02,200 INFO L278 IsEmpty]: Start isEmpty. Operand 302 states and 1016 transitions. [2025-04-13 18:23:02,201 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:23:02,201 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:02,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:02,201 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 18:23:02,201 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:02,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:02,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2006432213, now seen corresponding path program 25 times [2025-04-13 18:23:02,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:02,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425692551] [2025-04-13 18:23:02,202 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:23:02,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:02,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:23:02,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:23:02,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:02,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:02,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:23:02,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:02,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425692551] [2025-04-13 18:23:02,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425692551] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:02,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577716367] [2025-04-13 18:23:02,636 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:23:02,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:02,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:02,638 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:02,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 18:23:02,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:23:02,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:23:02,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:02,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:02,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 18:23:02,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:02,707 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:23:02,723 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:23:02,738 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:23:02,739 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 11 treesize of output 11 [2025-04-13 18:23:02,754 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:23:02,878 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 18:23:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:23:02,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:23:03,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577716367] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:03,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:23:03,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 10] total 26 [2025-04-13 18:23:03,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328101747] [2025-04-13 18:23:03,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:03,011 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:23:03,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:03,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:23:03,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:23:03,012 INFO L87 Difference]: Start difference. First operand 302 states and 1016 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:03,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:03,298 INFO L93 Difference]: Finished difference Result 414 states and 1349 transitions. [2025-04-13 18:23:03,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:23:03,299 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:23:03,299 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:03,300 INFO L225 Difference]: With dead ends: 414 [2025-04-13 18:23:03,300 INFO L226 Difference]: Without dead ends: 408 [2025-04-13 18:23:03,301 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=880, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:23:03,301 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:03,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:23:03,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-04-13 18:23:03,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 296. [2025-04-13 18:23:03,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.3966101694915256) internal successors, (1002), 295 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 1002 transitions. [2025-04-13 18:23:03,307 INFO L79 Accepts]: Start accepts. Automaton has 296 states and 1002 transitions. Word has length 22 [2025-04-13 18:23:03,307 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:03,307 INFO L485 AbstractCegarLoop]: Abstraction has 296 states and 1002 transitions. [2025-04-13 18:23:03,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:03,307 INFO L278 IsEmpty]: Start isEmpty. Operand 296 states and 1002 transitions. [2025-04-13 18:23:03,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:23:03,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:03,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:03,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 18:23:03,508 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,SelfDestructingSolverStorable27 [2025-04-13 18:23:03,508 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:03,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:03,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1906861953, now seen corresponding path program 26 times [2025-04-13 18:23:03,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:03,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979233946] [2025-04-13 18:23:03,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:23:03,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:03,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:23:03,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:23:03,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:23:03,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:03,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:23:03,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:03,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979233946] [2025-04-13 18:23:03,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979233946] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:03,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:03,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:23:03,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451677751] [2025-04-13 18:23:03,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:03,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:23:03,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:03,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:23:03,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:23:03,875 INFO L87 Difference]: Start difference. First operand 296 states and 1002 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:04,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:04,121 INFO L93 Difference]: Finished difference Result 378 states and 1234 transitions. [2025-04-13 18:23:04,122 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:23:04,122 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:23:04,122 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:04,123 INFO L225 Difference]: With dead ends: 378 [2025-04-13 18:23:04,123 INFO L226 Difference]: Without dead ends: 372 [2025-04-13 18:23:04,124 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:23:04,124 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:04,124 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:23:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-04-13 18:23:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 303. [2025-04-13 18:23:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.4205298013245033) internal successors, (1033), 302 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:04,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 1033 transitions. [2025-04-13 18:23:04,129 INFO L79 Accepts]: Start accepts. Automaton has 303 states and 1033 transitions. Word has length 22 [2025-04-13 18:23:04,129 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:04,129 INFO L485 AbstractCegarLoop]: Abstraction has 303 states and 1033 transitions. [2025-04-13 18:23:04,129 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:04,129 INFO L278 IsEmpty]: Start isEmpty. Operand 303 states and 1033 transitions. [2025-04-13 18:23:04,130 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:23:04,130 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:04,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:04,130 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 18:23:04,130 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:04,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:04,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1121444507, now seen corresponding path program 27 times [2025-04-13 18:23:04,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:04,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367916498] [2025-04-13 18:23:04,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:23:04,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:04,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:23:04,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:23:04,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:23:04,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:23:04,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:04,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367916498] [2025-04-13 18:23:04,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367916498] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:04,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:04,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:23:04,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761751942] [2025-04-13 18:23:04,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:04,403 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:23:04,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:04,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:23:04,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:23:04,404 INFO L87 Difference]: Start difference. First operand 303 states and 1033 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:04,661 INFO L93 Difference]: Finished difference Result 365 states and 1210 transitions. [2025-04-13 18:23:04,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:23:04,661 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:23:04,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:04,663 INFO L225 Difference]: With dead ends: 365 [2025-04-13 18:23:04,663 INFO L226 Difference]: Without dead ends: 359 [2025-04-13 18:23:04,663 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:23:04,664 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:04,664 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:23:04,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-04-13 18:23:04,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 295. [2025-04-13 18:23:04,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 3.377551020408163) internal successors, (993), 294 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 993 transitions. [2025-04-13 18:23:04,669 INFO L79 Accepts]: Start accepts. Automaton has 295 states and 993 transitions. Word has length 22 [2025-04-13 18:23:04,669 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:04,669 INFO L485 AbstractCegarLoop]: Abstraction has 295 states and 993 transitions. [2025-04-13 18:23:04,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:04,669 INFO L278 IsEmpty]: Start isEmpty. Operand 295 states and 993 transitions. [2025-04-13 18:23:04,670 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:23:04,670 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:04,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:04,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 18:23:04,670 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:04,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:04,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2064158433, now seen corresponding path program 28 times [2025-04-13 18:23:04,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:04,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011571933] [2025-04-13 18:23:04,671 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:23:04,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:04,675 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:23:04,683 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:23:04,683 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:23:04,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:05,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:05,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011571933] [2025-04-13 18:23:05,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011571933] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:05,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723699073] [2025-04-13 18:23:05,044 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:23:05,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:05,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:05,046 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:05,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 18:23:05,095 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:23:05,121 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:23:05,122 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:23:05,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:05,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 18:23:05,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:05,135 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:23:05,175 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:23:05,196 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:23:05,196 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 11 treesize of output 11 [2025-04-13 18:23:05,213 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:23:05,389 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:23:05,390 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 27 [2025-04-13 18:23:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:23:05,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:23:05,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723699073] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:05,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:23:05,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 10] total 24 [2025-04-13 18:23:05,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509894399] [2025-04-13 18:23:05,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:05,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:23:05,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:05,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:23:05,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:23:05,540 INFO L87 Difference]: Start difference. First operand 295 states and 993 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:05,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:05,897 INFO L93 Difference]: Finished difference Result 542 states and 1752 transitions. [2025-04-13 18:23:05,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 18:23:05,898 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:23:05,898 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:05,900 INFO L225 Difference]: With dead ends: 542 [2025-04-13 18:23:05,900 INFO L226 Difference]: Without dead ends: 536 [2025-04-13 18:23:05,900 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=922, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:23:05,901 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:05,901 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:23:05,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-04-13 18:23:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 290. [2025-04-13 18:23:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 3.359861591695502) internal successors, (971), 289 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 971 transitions. [2025-04-13 18:23:05,908 INFO L79 Accepts]: Start accepts. Automaton has 290 states and 971 transitions. Word has length 22 [2025-04-13 18:23:05,908 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:05,908 INFO L485 AbstractCegarLoop]: Abstraction has 290 states and 971 transitions. [2025-04-13 18:23:05,908 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:05,908 INFO L278 IsEmpty]: Start isEmpty. Operand 290 states and 971 transitions. [2025-04-13 18:23:05,909 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:23:05,909 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:05,909 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:05,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 18:23:06,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:06,113 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:06,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:06,114 INFO L85 PathProgramCache]: Analyzing trace with hash -502150399, now seen corresponding path program 29 times [2025-04-13 18:23:06,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:06,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102064283] [2025-04-13 18:23:06,114 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:23:06,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:06,119 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:23:06,126 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:23:06,126 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:06,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:23:06,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:06,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102064283] [2025-04-13 18:23:06,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102064283] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:06,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309091406] [2025-04-13 18:23:06,623 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:23:06,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:06,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:06,625 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:06,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 18:23:06,675 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:23:06,692 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:23:06,692 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:06,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:06,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 18:23:06,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:06,698 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:23:06,715 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:23:06,736 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:23:06,736 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 11 treesize of output 11 [2025-04-13 18:23:06,755 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:23:06,889 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 18:23:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:23:06,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:23:07,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309091406] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:07,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:23:07,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 10] total 26 [2025-04-13 18:23:07,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293001154] [2025-04-13 18:23:07,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:07,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:23:07,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:07,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:23:07,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:23:07,039 INFO L87 Difference]: Start difference. First operand 290 states and 971 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:07,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:07,344 INFO L93 Difference]: Finished difference Result 431 states and 1391 transitions. [2025-04-13 18:23:07,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:23:07,345 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:23:07,345 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:07,346 INFO L225 Difference]: With dead ends: 431 [2025-04-13 18:23:07,347 INFO L226 Difference]: Without dead ends: 425 [2025-04-13 18:23:07,347 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:23:07,347 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:07,347 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:23:07,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-04-13 18:23:07,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 288. [2025-04-13 18:23:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 3.3658536585365852) internal successors, (966), 287 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 966 transitions. [2025-04-13 18:23:07,365 INFO L79 Accepts]: Start accepts. Automaton has 288 states and 966 transitions. Word has length 22 [2025-04-13 18:23:07,366 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:07,366 INFO L485 AbstractCegarLoop]: Abstraction has 288 states and 966 transitions. [2025-04-13 18:23:07,366 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:07,366 INFO L278 IsEmpty]: Start isEmpty. Operand 288 states and 966 transitions. [2025-04-13 18:23:07,366 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:23:07,366 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:07,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:07,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 18:23:07,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-04-13 18:23:07,568 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:07,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:07,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1991865401, now seen corresponding path program 30 times [2025-04-13 18:23:07,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:07,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923209318] [2025-04-13 18:23:07,569 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:23:07,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:07,573 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:23:07,578 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:23:07,578 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:23:07,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:23:07,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:07,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923209318] [2025-04-13 18:23:07,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923209318] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:07,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:07,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:23:07,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30560700] [2025-04-13 18:23:07,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:07,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:23:07,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:07,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:23:07,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:23:07,874 INFO L87 Difference]: Start difference. First operand 288 states and 966 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:08,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:08,055 INFO L93 Difference]: Finished difference Result 340 states and 1101 transitions. [2025-04-13 18:23:08,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:23:08,056 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:23:08,056 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:08,057 INFO L225 Difference]: With dead ends: 340 [2025-04-13 18:23:08,057 INFO L226 Difference]: Without dead ends: 334 [2025-04-13 18:23:08,057 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:23:08,058 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:08,058 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:23:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-04-13 18:23:08,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 290. [2025-04-13 18:23:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 3.359861591695502) internal successors, (971), 289 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 971 transitions. [2025-04-13 18:23:08,062 INFO L79 Accepts]: Start accepts. Automaton has 290 states and 971 transitions. Word has length 22 [2025-04-13 18:23:08,062 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:08,062 INFO L485 AbstractCegarLoop]: Abstraction has 290 states and 971 transitions. [2025-04-13 18:23:08,062 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:08,062 INFO L278 IsEmpty]: Start isEmpty. Operand 290 states and 971 transitions. [2025-04-13 18:23:08,063 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:23:08,063 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:08,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:08,063 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 18:23:08,063 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:08,063 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:08,063 INFO L85 PathProgramCache]: Analyzing trace with hash -757326637, now seen corresponding path program 31 times [2025-04-13 18:23:08,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:08,064 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184658574] [2025-04-13 18:23:08,064 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:23:08,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:08,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:23:08,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:23:08,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:08,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:23:08,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:08,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184658574] [2025-04-13 18:23:08,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184658574] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:08,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043829568] [2025-04-13 18:23:08,468 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:23:08,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:08,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:08,470 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:08,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 18:23:08,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:23:08,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:23:08,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:08,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:08,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 18:23:08,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:08,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:23:08,565 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:23:08,581 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:23:08,581 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 11 treesize of output 11 [2025-04-13 18:23:08,597 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:23:08,732 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:23:08,733 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 27 [2025-04-13 18:23:08,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:23:08,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:23:08,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043829568] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:08,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:23:08,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 10] total 25 [2025-04-13 18:23:08,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461761684] [2025-04-13 18:23:08,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:08,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:23:08,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:08,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:23:08,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:23:08,877 INFO L87 Difference]: Start difference. First operand 290 states and 971 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:09,238 INFO L93 Difference]: Finished difference Result 494 states and 1594 transitions. [2025-04-13 18:23:09,238 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 18:23:09,238 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:23:09,239 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:09,241 INFO L225 Difference]: With dead ends: 494 [2025-04-13 18:23:09,241 INFO L226 Difference]: Without dead ends: 488 [2025-04-13 18:23:09,241 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:23:09,242 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:09,242 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:23:09,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-04-13 18:23:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 294. [2025-04-13 18:23:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3754266211604094) internal successors, (989), 293 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:09,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 989 transitions. [2025-04-13 18:23:09,247 INFO L79 Accepts]: Start accepts. Automaton has 294 states and 989 transitions. Word has length 22 [2025-04-13 18:23:09,248 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:09,248 INFO L485 AbstractCegarLoop]: Abstraction has 294 states and 989 transitions. [2025-04-13 18:23:09,248 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:09,248 INFO L278 IsEmpty]: Start isEmpty. Operand 294 states and 989 transitions. [2025-04-13 18:23:09,248 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:23:09,248 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:09,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:09,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 18:23:09,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:09,453 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:09,453 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:09,453 INFO L85 PathProgramCache]: Analyzing trace with hash 289007521, now seen corresponding path program 32 times [2025-04-13 18:23:09,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:09,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912898792] [2025-04-13 18:23:09,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:23:09,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:09,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:23:09,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:23:09,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:23:09,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:23:09,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:09,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912898792] [2025-04-13 18:23:09,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912898792] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:09,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:09,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:23:09,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762864634] [2025-04-13 18:23:09,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:09,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:23:09,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:09,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:23:09,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:23:09,762 INFO L87 Difference]: Start difference. First operand 294 states and 989 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:09,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:09,932 INFO L93 Difference]: Finished difference Result 338 states and 1107 transitions. [2025-04-13 18:23:09,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:23:09,932 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:23:09,932 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:09,933 INFO L225 Difference]: With dead ends: 338 [2025-04-13 18:23:09,933 INFO L226 Difference]: Without dead ends: 332 [2025-04-13 18:23:09,934 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:23:09,934 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:09,934 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:23:09,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-04-13 18:23:09,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 296. [2025-04-13 18:23:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.376271186440678) internal successors, (996), 295 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 996 transitions. [2025-04-13 18:23:09,939 INFO L79 Accepts]: Start accepts. Automaton has 296 states and 996 transitions. Word has length 22 [2025-04-13 18:23:09,939 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:09,939 INFO L485 AbstractCegarLoop]: Abstraction has 296 states and 996 transitions. [2025-04-13 18:23:09,939 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:09,939 INFO L278 IsEmpty]: Start isEmpty. Operand 296 states and 996 transitions. [2025-04-13 18:23:09,939 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:23:09,939 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:09,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:09,939 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 18:23:09,940 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:09,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:09,940 INFO L85 PathProgramCache]: Analyzing trace with hash -328902707, now seen corresponding path program 33 times [2025-04-13 18:23:09,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:09,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384535562] [2025-04-13 18:23:09,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:23:09,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:09,944 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:23:09,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:23:09,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:23:09,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:23:10,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:10,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384535562] [2025-04-13 18:23:10,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384535562] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:10,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:10,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:23:10,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19975621] [2025-04-13 18:23:10,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:10,174 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:23:10,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:10,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:23:10,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:23:10,174 INFO L87 Difference]: Start difference. First operand 296 states and 996 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:10,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:10,385 INFO L93 Difference]: Finished difference Result 372 states and 1210 transitions. [2025-04-13 18:23:10,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:23:10,385 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:23:10,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:10,387 INFO L225 Difference]: With dead ends: 372 [2025-04-13 18:23:10,387 INFO L226 Difference]: Without dead ends: 366 [2025-04-13 18:23:10,387 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:23:10,388 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:10,388 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:23:10,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-04-13 18:23:10,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 300. [2025-04-13 18:23:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.3846153846153846) internal successors, (1012), 299 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1012 transitions. [2025-04-13 18:23:10,393 INFO L79 Accepts]: Start accepts. Automaton has 300 states and 1012 transitions. Word has length 22 [2025-04-13 18:23:10,393 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:10,393 INFO L485 AbstractCegarLoop]: Abstraction has 300 states and 1012 transitions. [2025-04-13 18:23:10,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:10,393 INFO L278 IsEmpty]: Start isEmpty. Operand 300 states and 1012 transitions. [2025-04-13 18:23:10,393 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:23:10,394 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:10,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:10,394 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 18:23:10,394 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:10,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:10,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2018830457, now seen corresponding path program 34 times [2025-04-13 18:23:10,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:10,394 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530322639] [2025-04-13 18:23:10,394 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:23:10,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:10,399 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:23:10,405 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:23:10,405 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:23:10,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:10,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:10,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530322639] [2025-04-13 18:23:10,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530322639] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:10,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669154616] [2025-04-13 18:23:10,736 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:23:10,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:10,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:10,738 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:10,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 18:23:10,791 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:23:10,808 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:23:10,808 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:23:10,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:10,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 18:23:10,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:10,814 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:23:10,827 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:23:10,842 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:23:10,842 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 11 treesize of output 11 [2025-04-13 18:23:10,859 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:23:11,033 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 18:23:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:23:11,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:23:11,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669154616] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:11,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:23:11,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 10] total 25 [2025-04-13 18:23:11,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961158319] [2025-04-13 18:23:11,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:11,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:23:11,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:11,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:23:11,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:23:11,178 INFO L87 Difference]: Start difference. First operand 300 states and 1012 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:11,451 INFO L93 Difference]: Finished difference Result 445 states and 1442 transitions. [2025-04-13 18:23:11,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:23:11,451 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:23:11,451 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:11,453 INFO L225 Difference]: With dead ends: 445 [2025-04-13 18:23:11,453 INFO L226 Difference]: Without dead ends: 439 [2025-04-13 18:23:11,453 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=891, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:23:11,453 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:11,454 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:23:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-04-13 18:23:11,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 296. [2025-04-13 18:23:11,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.389830508474576) internal successors, (1000), 295 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 1000 transitions. [2025-04-13 18:23:11,459 INFO L79 Accepts]: Start accepts. Automaton has 296 states and 1000 transitions. Word has length 22 [2025-04-13 18:23:11,460 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:11,460 INFO L485 AbstractCegarLoop]: Abstraction has 296 states and 1000 transitions. [2025-04-13 18:23:11,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:11,460 INFO L278 IsEmpty]: Start isEmpty. Operand 296 states and 1000 transitions. [2025-04-13 18:23:11,460 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:23:11,460 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:11,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:11,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 18:23:11,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 18:23:11,661 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:11,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:11,661 INFO L85 PathProgramCache]: Analyzing trace with hash -58333157, now seen corresponding path program 35 times [2025-04-13 18:23:11,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:11,661 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267969691] [2025-04-13 18:23:11,661 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:23:11,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:11,667 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:23:11,673 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:23:11,674 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:11,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:11,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:11,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267969691] [2025-04-13 18:23:11,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267969691] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:11,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493704557] [2025-04-13 18:23:11,973 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:23:11,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:11,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:11,976 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:11,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 18:23:12,117 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:23:12,137 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:23:12,137 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:12,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:12,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 18:23:12,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:12,143 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:23:12,162 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:23:12,184 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:23:12,184 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 11 treesize of output 11 [2025-04-13 18:23:12,206 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:23:12,358 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 18:23:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:23:12,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:23:12,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493704557] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:12,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:23:12,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 10] total 23 [2025-04-13 18:23:12,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571607144] [2025-04-13 18:23:12,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:12,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:23:12,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:12,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:23:12,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:23:12,496 INFO L87 Difference]: Start difference. First operand 296 states and 1000 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:12,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:12,833 INFO L93 Difference]: Finished difference Result 439 states and 1419 transitions. [2025-04-13 18:23:12,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 18:23:12,833 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:23:12,833 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:12,835 INFO L225 Difference]: With dead ends: 439 [2025-04-13 18:23:12,835 INFO L226 Difference]: Without dead ends: 433 [2025-04-13 18:23:12,835 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:23:12,836 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:12,836 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:23:12,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-04-13 18:23:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 288. [2025-04-13 18:23:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 3.3658536585365852) internal successors, (966), 287 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 966 transitions. [2025-04-13 18:23:12,841 INFO L79 Accepts]: Start accepts. Automaton has 288 states and 966 transitions. Word has length 22 [2025-04-13 18:23:12,841 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:12,841 INFO L485 AbstractCegarLoop]: Abstraction has 288 states and 966 transitions. [2025-04-13 18:23:12,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:12,841 INFO L278 IsEmpty]: Start isEmpty. Operand 288 states and 966 transitions. [2025-04-13 18:23:12,841 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:23:12,841 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:12,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:12,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 18:23:13,042 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,SelfDestructingSolverStorable37 [2025-04-13 18:23:13,042 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:13,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:13,042 INFO L85 PathProgramCache]: Analyzing trace with hash 33831283, now seen corresponding path program 36 times [2025-04-13 18:23:13,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:13,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072986140] [2025-04-13 18:23:13,043 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:23:13,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:13,048 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:23:13,053 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:23:13,053 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:23:13,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:13,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:23:13,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:13,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072986140] [2025-04-13 18:23:13,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072986140] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:13,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:13,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:23:13,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719040753] [2025-04-13 18:23:13,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:13,404 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:23:13,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:13,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:23:13,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:23:13,405 INFO L87 Difference]: Start difference. First operand 288 states and 966 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:13,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:13,665 INFO L93 Difference]: Finished difference Result 435 states and 1426 transitions. [2025-04-13 18:23:13,665 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:23:13,665 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:23:13,665 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:13,667 INFO L225 Difference]: With dead ends: 435 [2025-04-13 18:23:13,667 INFO L226 Difference]: Without dead ends: 429 [2025-04-13 18:23:13,667 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:23:13,668 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:13,668 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:23:13,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-04-13 18:23:13,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 290. [2025-04-13 18:23:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 3.3806228373702423) internal successors, (977), 289 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:13,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 977 transitions. [2025-04-13 18:23:13,673 INFO L79 Accepts]: Start accepts. Automaton has 290 states and 977 transitions. Word has length 22 [2025-04-13 18:23:13,673 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:13,673 INFO L485 AbstractCegarLoop]: Abstraction has 290 states and 977 transitions. [2025-04-13 18:23:13,673 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:13,673 INFO L278 IsEmpty]: Start isEmpty. Operand 290 states and 977 transitions. [2025-04-13 18:23:13,673 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:23:13,673 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:13,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:13,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 18:23:13,674 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:13,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:13,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1041293139, now seen corresponding path program 37 times [2025-04-13 18:23:13,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:13,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445418938] [2025-04-13 18:23:13,674 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:23:13,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:13,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:23:13,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:23:13,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:13,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:23:14,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:14,020 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445418938] [2025-04-13 18:23:14,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445418938] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:14,020 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329315849] [2025-04-13 18:23:14,020 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:23:14,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:14,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:14,022 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:14,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 18:23:14,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:23:14,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:23:14,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:14,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:14,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 18:23:14,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:14,132 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:23:14,260 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:23:14,261 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 27 treesize of output 23 [2025-04-13 18:23:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:14,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:23:14,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329315849] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:14,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:23:14,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 9] total 23 [2025-04-13 18:23:14,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688399451] [2025-04-13 18:23:14,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:14,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:23:14,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:14,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:23:14,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:23:14,394 INFO L87 Difference]: Start difference. First operand 290 states and 977 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:14,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:14,919 INFO L93 Difference]: Finished difference Result 477 states and 1543 transitions. [2025-04-13 18:23:14,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:23:14,919 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:23:14,920 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:14,922 INFO L225 Difference]: With dead ends: 477 [2025-04-13 18:23:14,922 INFO L226 Difference]: Without dead ends: 471 [2025-04-13 18:23:14,922 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:23:14,922 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:14,922 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:23:14,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-04-13 18:23:14,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 292. [2025-04-13 18:23:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 3.381443298969072) internal successors, (984), 291 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:14,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 984 transitions. [2025-04-13 18:23:14,927 INFO L79 Accepts]: Start accepts. Automaton has 292 states and 984 transitions. Word has length 22 [2025-04-13 18:23:14,927 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:14,927 INFO L485 AbstractCegarLoop]: Abstraction has 292 states and 984 transitions. [2025-04-13 18:23:14,927 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:14,928 INFO L278 IsEmpty]: Start isEmpty. Operand 292 states and 984 transitions. [2025-04-13 18:23:14,928 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:23:14,928 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:14,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:14,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 18:23:15,128 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 18:23:15,129 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:15,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:15,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1519367037, now seen corresponding path program 38 times [2025-04-13 18:23:15,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:15,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883608585] [2025-04-13 18:23:15,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:23:15,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:15,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:23:15,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-13 18:23:15,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:23:15,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:23:15,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:15,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883608585] [2025-04-13 18:23:15,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883608585] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:15,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:15,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:23:15,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881644513] [2025-04-13 18:23:15,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:15,421 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:23:15,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:15,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:23:15,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:23:15,421 INFO L87 Difference]: Start difference. First operand 292 states and 984 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:15,746 INFO L93 Difference]: Finished difference Result 460 states and 1521 transitions. [2025-04-13 18:23:15,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:23:15,746 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:23:15,746 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:15,748 INFO L225 Difference]: With dead ends: 460 [2025-04-13 18:23:15,748 INFO L226 Difference]: Without dead ends: 454 [2025-04-13 18:23:15,748 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:23:15,748 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:15,749 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:23:15,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-04-13 18:23:15,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 286. [2025-04-13 18:23:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 3.357894736842105) internal successors, (957), 285 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 957 transitions. [2025-04-13 18:23:15,753 INFO L79 Accepts]: Start accepts. Automaton has 286 states and 957 transitions. Word has length 22 [2025-04-13 18:23:15,753 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:15,753 INFO L485 AbstractCegarLoop]: Abstraction has 286 states and 957 transitions. [2025-04-13 18:23:15,754 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:15,754 INFO L278 IsEmpty]: Start isEmpty. Operand 286 states and 957 transitions. [2025-04-13 18:23:15,754 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 18:23:15,754 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:15,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] [2025-04-13 18:23:15,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 18:23:15,754 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:15,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:15,755 INFO L85 PathProgramCache]: Analyzing trace with hash 700748270, now seen corresponding path program 1 times [2025-04-13 18:23:15,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:15,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144973012] [2025-04-13 18:23:15,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:23:15,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:15,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 18:23:15,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:23:15,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:15,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:15,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:15,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144973012] [2025-04-13 18:23:15,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144973012] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:15,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482070680] [2025-04-13 18:23:15,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:23:15,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:15,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:15,810 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:15,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 18:23:15,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 18:23:15,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:23:15,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:15,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:15,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:23:15,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:15,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:15,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:15,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:15,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482070680] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:23:15,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:23:15,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-13 18:23:15,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078139833] [2025-04-13 18:23:15,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:23:15,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:23:15,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:15,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:23:15,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:23:15,944 INFO L87 Difference]: Start difference. First operand 286 states and 957 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:16,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:16,045 INFO L93 Difference]: Finished difference Result 663 states and 2124 transitions. [2025-04-13 18:23:16,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:23:16,045 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 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 24 [2025-04-13 18:23:16,045 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:16,047 INFO L225 Difference]: With dead ends: 663 [2025-04-13 18:23:16,048 INFO L226 Difference]: Without dead ends: 522 [2025-04-13 18:23:16,048 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:23:16,048 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:16,048 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:23:16,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-04-13 18:23:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 386. [2025-04-13 18:23:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 3.2883116883116883) internal successors, (1266), 385 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1266 transitions. [2025-04-13 18:23:16,055 INFO L79 Accepts]: Start accepts. Automaton has 386 states and 1266 transitions. Word has length 24 [2025-04-13 18:23:16,055 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:16,055 INFO L485 AbstractCegarLoop]: Abstraction has 386 states and 1266 transitions. [2025-04-13 18:23:16,055 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:16,055 INFO L278 IsEmpty]: Start isEmpty. Operand 386 states and 1266 transitions. [2025-04-13 18:23:16,056 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 18:23:16,056 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:16,056 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:16,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 18:23:16,256 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:16,257 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:16,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:16,257 INFO L85 PathProgramCache]: Analyzing trace with hash -766643376, now seen corresponding path program 1 times [2025-04-13 18:23:16,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:16,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221680431] [2025-04-13 18:23:16,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:23:16,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:16,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 18:23:16,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:23:16,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:16,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:16,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:16,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221680431] [2025-04-13 18:23:16,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221680431] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:16,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177217699] [2025-04-13 18:23:16,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:23:16,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:16,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:16,327 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:16,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 18:23:16,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 18:23:16,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:23:16,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:16,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:16,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:23:16,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:16,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:16,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177217699] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:23:16,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:23:16,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 18:23:16,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629509705] [2025-04-13 18:23:16,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:23:16,525 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:23:16,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:16,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:23:16,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:23:16,525 INFO L87 Difference]: Start difference. First operand 386 states and 1266 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:16,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:16,634 INFO L93 Difference]: Finished difference Result 523 states and 1605 transitions. [2025-04-13 18:23:16,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:23:16,635 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 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 24 [2025-04-13 18:23:16,635 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:16,636 INFO L225 Difference]: With dead ends: 523 [2025-04-13 18:23:16,636 INFO L226 Difference]: Without dead ends: 437 [2025-04-13 18:23:16,636 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:23:16,637 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:16,637 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:23:16,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-04-13 18:23:16,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 421. [2025-04-13 18:23:16,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.138095238095238) internal successors, (1318), 420 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1318 transitions. [2025-04-13 18:23:16,643 INFO L79 Accepts]: Start accepts. Automaton has 421 states and 1318 transitions. Word has length 24 [2025-04-13 18:23:16,643 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:16,643 INFO L485 AbstractCegarLoop]: Abstraction has 421 states and 1318 transitions. [2025-04-13 18:23:16,643 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:16,643 INFO L278 IsEmpty]: Start isEmpty. Operand 421 states and 1318 transitions. [2025-04-13 18:23:16,643 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 18:23:16,643 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:16,643 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:16,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 18:23:16,848 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:16,848 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:16,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:16,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1575614642, now seen corresponding path program 1 times [2025-04-13 18:23:16,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:16,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144737787] [2025-04-13 18:23:16,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:23:16,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:16,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 18:23:16,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:23:16,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:16,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:16,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:16,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144737787] [2025-04-13 18:23:16,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144737787] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:16,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785296579] [2025-04-13 18:23:16,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:23:16,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:16,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:16,896 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:16,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 18:23:16,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 18:23:16,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:23:16,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:16,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:16,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:23:16,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:16,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:17,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785296579] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:23:17,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:23:17,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-13 18:23:17,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689242253] [2025-04-13 18:23:17,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:23:17,026 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:23:17,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:17,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:23:17,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:23:17,027 INFO L87 Difference]: Start difference. First operand 421 states and 1318 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:17,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:17,111 INFO L93 Difference]: Finished difference Result 437 states and 1340 transitions. [2025-04-13 18:23:17,111 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:23:17,111 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 18:23:17,111 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:17,112 INFO L225 Difference]: With dead ends: 437 [2025-04-13 18:23:17,112 INFO L226 Difference]: Without dead ends: 288 [2025-04-13 18:23:17,113 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:23:17,113 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:17,113 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:23:17,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-04-13 18:23:17,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-04-13 18:23:17,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 3.341463414634146) internal successors, (959), 287 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 959 transitions. [2025-04-13 18:23:17,117 INFO L79 Accepts]: Start accepts. Automaton has 288 states and 959 transitions. Word has length 24 [2025-04-13 18:23:17,118 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:17,118 INFO L485 AbstractCegarLoop]: Abstraction has 288 states and 959 transitions. [2025-04-13 18:23:17,118 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:17,118 INFO L278 IsEmpty]: Start isEmpty. Operand 288 states and 959 transitions. [2025-04-13 18:23:17,118 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:23:17,118 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:17,118 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:17,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 18:23:17,319 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,SelfDestructingSolverStorable43 [2025-04-13 18:23:17,319 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:17,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:17,319 INFO L85 PathProgramCache]: Analyzing trace with hash -910526802, now seen corresponding path program 2 times [2025-04-13 18:23:17,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:17,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483471502] [2025-04-13 18:23:17,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:23:17,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:17,326 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:23:17,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 26 statements. [2025-04-13 18:23:17,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:23:17,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:23:17,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:17,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483471502] [2025-04-13 18:23:17,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483471502] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:17,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:17,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:23:17,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460836555] [2025-04-13 18:23:17,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:17,360 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:23:17,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:17,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:23:17,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:23:17,360 INFO L87 Difference]: Start difference. First operand 288 states and 959 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:17,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:17,474 INFO L93 Difference]: Finished difference Result 570 states and 1932 transitions. [2025-04-13 18:23:17,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:23:17,474 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:23:17,474 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:17,476 INFO L225 Difference]: With dead ends: 570 [2025-04-13 18:23:17,476 INFO L226 Difference]: Without dead ends: 522 [2025-04-13 18:23:17,477 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:23:17,477 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:17,477 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:23:17,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-04-13 18:23:17,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 348. [2025-04-13 18:23:17,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 3.3688760806916425) internal successors, (1169), 347 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1169 transitions. [2025-04-13 18:23:17,484 INFO L79 Accepts]: Start accepts. Automaton has 348 states and 1169 transitions. Word has length 26 [2025-04-13 18:23:17,485 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:17,485 INFO L485 AbstractCegarLoop]: Abstraction has 348 states and 1169 transitions. [2025-04-13 18:23:17,485 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:17,485 INFO L278 IsEmpty]: Start isEmpty. Operand 348 states and 1169 transitions. [2025-04-13 18:23:17,485 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:23:17,485 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:17,485 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:17,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 18:23:17,486 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:17,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:17,486 INFO L85 PathProgramCache]: Analyzing trace with hash 828718732, now seen corresponding path program 2 times [2025-04-13 18:23:17,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:17,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258247996] [2025-04-13 18:23:17,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:23:17,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:17,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:23:17,502 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:23:17,502 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:17,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:17,547 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 18:23:17,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:17,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258247996] [2025-04-13 18:23:17,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258247996] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:17,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912450424] [2025-04-13 18:23:17,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:23:17,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:17,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:17,555 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:17,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 18:23:17,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:23:17,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:23:17,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:17,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:17,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:23:17,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:23:17,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:23:17,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912450424] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:17,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:23:17,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-04-13 18:23:17,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121413289] [2025-04-13 18:23:17,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:17,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:23:17,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:17,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:23:17,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:23:17,739 INFO L87 Difference]: Start difference. First operand 348 states and 1169 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:17,810 INFO L93 Difference]: Finished difference Result 446 states and 1390 transitions. [2025-04-13 18:23:17,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:23:17,811 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:23:17,811 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:17,812 INFO L225 Difference]: With dead ends: 446 [2025-04-13 18:23:17,812 INFO L226 Difference]: Without dead ends: 430 [2025-04-13 18:23:17,812 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:23:17,813 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:17,813 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:23:17,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-04-13 18:23:17,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 360. [2025-04-13 18:23:17,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 3.350974930362117) internal successors, (1203), 359 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 1203 transitions. [2025-04-13 18:23:17,818 INFO L79 Accepts]: Start accepts. Automaton has 360 states and 1203 transitions. Word has length 26 [2025-04-13 18:23:17,818 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:17,818 INFO L485 AbstractCegarLoop]: Abstraction has 360 states and 1203 transitions. [2025-04-13 18:23:17,819 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:17,819 INFO L278 IsEmpty]: Start isEmpty. Operand 360 states and 1203 transitions. [2025-04-13 18:23:17,819 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:23:17,819 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:17,819 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:17,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 18:23:18,019 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-04-13 18:23:18,020 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:18,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:18,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1637689998, now seen corresponding path program 2 times [2025-04-13 18:23:18,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:18,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729734686] [2025-04-13 18:23:18,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:23:18,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:18,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:23:18,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:23:18,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:18,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:18,069 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 18:23:18,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:18,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729734686] [2025-04-13 18:23:18,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729734686] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:18,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648515721] [2025-04-13 18:23:18,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:23:18,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:18,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:18,071 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:18,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 18:23:18,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:23:18,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:23:18,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:18,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:18,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:23:18,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:18,199 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 18:23:18,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:23:18,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648515721] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:18,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:23:18,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 11 [2025-04-13 18:23:18,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255528205] [2025-04-13 18:23:18,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:18,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:23:18,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:18,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:23:18,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:23:18,242 INFO L87 Difference]: Start difference. First operand 360 states and 1203 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:18,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:18,332 INFO L93 Difference]: Finished difference Result 628 states and 2152 transitions. [2025-04-13 18:23:18,333 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:23:18,333 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:23:18,333 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:18,334 INFO L225 Difference]: With dead ends: 628 [2025-04-13 18:23:18,334 INFO L226 Difference]: Without dead ends: 587 [2025-04-13 18:23:18,335 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:23:18,335 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:18,335 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:23:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-04-13 18:23:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 366. [2025-04-13 18:23:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 3.4027397260273973) internal successors, (1242), 365 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:18,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1242 transitions. [2025-04-13 18:23:18,344 INFO L79 Accepts]: Start accepts. Automaton has 366 states and 1242 transitions. Word has length 26 [2025-04-13 18:23:18,344 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:18,344 INFO L485 AbstractCegarLoop]: Abstraction has 366 states and 1242 transitions. [2025-04-13 18:23:18,345 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:18,345 INFO L278 IsEmpty]: Start isEmpty. Operand 366 states and 1242 transitions. [2025-04-13 18:23:18,345 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:23:18,345 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:18,345 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:18,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-13 18:23:18,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:18,546 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:18,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:18,546 INFO L85 PathProgramCache]: Analyzing trace with hash -144551122, now seen corresponding path program 3 times [2025-04-13 18:23:18,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:18,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993967441] [2025-04-13 18:23:18,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:23:18,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:18,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:23:18,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:23:18,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:23:18,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:23:18,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:18,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993967441] [2025-04-13 18:23:18,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993967441] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:18,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:18,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:23:18,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100490635] [2025-04-13 18:23:18,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:18,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:23:18,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:18,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:23:18,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:23:18,593 INFO L87 Difference]: Start difference. First operand 366 states and 1242 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:18,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:18,709 INFO L93 Difference]: Finished difference Result 600 states and 1970 transitions. [2025-04-13 18:23:18,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:23:18,709 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:23:18,709 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:18,711 INFO L225 Difference]: With dead ends: 600 [2025-04-13 18:23:18,711 INFO L226 Difference]: Without dead ends: 545 [2025-04-13 18:23:18,713 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:23:18,713 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:18,713 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:23:18,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-04-13 18:23:18,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 440. [2025-04-13 18:23:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.305239179954442) internal successors, (1451), 439 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1451 transitions. [2025-04-13 18:23:18,722 INFO L79 Accepts]: Start accepts. Automaton has 440 states and 1451 transitions. Word has length 26 [2025-04-13 18:23:18,722 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:18,722 INFO L485 AbstractCegarLoop]: Abstraction has 440 states and 1451 transitions. [2025-04-13 18:23:18,722 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:18,722 INFO L278 IsEmpty]: Start isEmpty. Operand 440 states and 1451 transitions. [2025-04-13 18:23:18,722 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:23:18,722 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:18,722 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:18,723 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-13 18:23:18,723 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:18,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:18,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1712800730, now seen corresponding path program 4 times [2025-04-13 18:23:18,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:18,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374287709] [2025-04-13 18:23:18,723 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:23:18,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:18,728 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:23:18,729 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 26 statements. [2025-04-13 18:23:18,729 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:23:18,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:18,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:23:18,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:18,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374287709] [2025-04-13 18:23:18,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374287709] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:18,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:18,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:23:18,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564477124] [2025-04-13 18:23:18,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:18,750 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:23:18,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:18,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:23:18,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:23:18,750 INFO L87 Difference]: Start difference. First operand 440 states and 1451 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:18,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:18,859 INFO L93 Difference]: Finished difference Result 601 states and 2034 transitions. [2025-04-13 18:23:18,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:23:18,860 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:23:18,860 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:18,861 INFO L225 Difference]: With dead ends: 601 [2025-04-13 18:23:18,861 INFO L226 Difference]: Without dead ends: 552 [2025-04-13 18:23:18,862 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:23:18,862 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:18,862 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:23:18,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-04-13 18:23:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 502. [2025-04-13 18:23:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 3.4191616766467066) internal successors, (1713), 501 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1713 transitions. [2025-04-13 18:23:18,875 INFO L79 Accepts]: Start accepts. Automaton has 502 states and 1713 transitions. Word has length 26 [2025-04-13 18:23:18,875 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:18,875 INFO L485 AbstractCegarLoop]: Abstraction has 502 states and 1713 transitions. [2025-04-13 18:23:18,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:18,875 INFO L278 IsEmpty]: Start isEmpty. Operand 502 states and 1713 transitions. [2025-04-13 18:23:18,876 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:23:18,876 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:18,876 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:18,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-13 18:23:18,876 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:18,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:18,876 INFO L85 PathProgramCache]: Analyzing trace with hash -784706236, now seen corresponding path program 5 times [2025-04-13 18:23:18,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:18,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29402308] [2025-04-13 18:23:18,876 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:23:18,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:18,882 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:23:18,885 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:23:18,886 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:18,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:23:18,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:18,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29402308] [2025-04-13 18:23:18,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29402308] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:18,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680469941] [2025-04-13 18:23:18,921 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:23:18,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:18,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:18,922 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:18,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 18:23:18,988 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:23:19,006 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:23:19,006 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:19,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:19,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 18:23:19,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:23:19,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:23:19,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680469941] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:19,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:23:19,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-04-13 18:23:19,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862492406] [2025-04-13 18:23:19,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:19,066 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:23:19,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:19,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:23:19,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:23:19,066 INFO L87 Difference]: Start difference. First operand 502 states and 1713 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:19,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:19,105 INFO L93 Difference]: Finished difference Result 607 states and 2068 transitions. [2025-04-13 18:23:19,105 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:23:19,106 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:23:19,106 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:19,107 INFO L225 Difference]: With dead ends: 607 [2025-04-13 18:23:19,107 INFO L226 Difference]: Without dead ends: 494 [2025-04-13 18:23:19,107 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:23:19,108 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:19,108 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:23:19,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-04-13 18:23:19,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 336. [2025-04-13 18:23:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 3.2776119402985073) internal successors, (1098), 335 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1098 transitions. [2025-04-13 18:23:19,115 INFO L79 Accepts]: Start accepts. Automaton has 336 states and 1098 transitions. Word has length 26 [2025-04-13 18:23:19,116 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:19,116 INFO L485 AbstractCegarLoop]: Abstraction has 336 states and 1098 transitions. [2025-04-13 18:23:19,116 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:19,116 INFO L278 IsEmpty]: Start isEmpty. Operand 336 states and 1098 transitions. [2025-04-13 18:23:19,116 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:23:19,116 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:19,116 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:19,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-13 18:23:19,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:19,317 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:19,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:19,317 INFO L85 PathProgramCache]: Analyzing trace with hash 964963214, now seen corresponding path program 3 times [2025-04-13 18:23:19,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:19,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682164926] [2025-04-13 18:23:19,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:23:19,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:19,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:23:19,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:23:19,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:23:19,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:23:19,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:19,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682164926] [2025-04-13 18:23:19,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682164926] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:19,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:19,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:23:19,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000740435] [2025-04-13 18:23:19,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:19,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:23:19,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:19,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:23:19,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:23:19,363 INFO L87 Difference]: Start difference. First operand 336 states and 1098 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:19,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:19,450 INFO L93 Difference]: Finished difference Result 500 states and 1664 transitions. [2025-04-13 18:23:19,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:23:19,450 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:23:19,450 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:19,452 INFO L225 Difference]: With dead ends: 500 [2025-04-13 18:23:19,452 INFO L226 Difference]: Without dead ends: 484 [2025-04-13 18:23:19,452 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:23:19,452 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:19,453 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:23:19,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-04-13 18:23:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 344. [2025-04-13 18:23:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 3.2886297376093294) internal successors, (1128), 343 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1128 transitions. [2025-04-13 18:23:19,458 INFO L79 Accepts]: Start accepts. Automaton has 344 states and 1128 transitions. Word has length 26 [2025-04-13 18:23:19,458 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:19,458 INFO L485 AbstractCegarLoop]: Abstraction has 344 states and 1128 transitions. [2025-04-13 18:23:19,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:19,458 INFO L278 IsEmpty]: Start isEmpty. Operand 344 states and 1128 transitions. [2025-04-13 18:23:19,459 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:23:19,459 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:19,459 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:19,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-13 18:23:19,459 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:19,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:19,459 INFO L85 PathProgramCache]: Analyzing trace with hash 760754574, now seen corresponding path program 4 times [2025-04-13 18:23:19,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:19,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428959644] [2025-04-13 18:23:19,460 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:23:19,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:19,464 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:23:19,465 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 26 statements. [2025-04-13 18:23:19,466 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:23:19,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:19,486 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 18:23:19,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:19,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428959644] [2025-04-13 18:23:19,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428959644] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:19,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135794662] [2025-04-13 18:23:19,487 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:23:19,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:19,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:19,489 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:19,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 18:23:19,556 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:23:19,564 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 26 statements. [2025-04-13 18:23:19,564 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:23:19,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:19,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:23:19,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:19,595 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 18:23:19,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:19,617 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 18:23:19,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135794662] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:23:19,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:23:19,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-04-13 18:23:19,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638875256] [2025-04-13 18:23:19,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:23:19,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:23:19,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:19,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:23:19,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:23:19,618 INFO L87 Difference]: Start difference. First operand 344 states and 1128 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:19,851 INFO L93 Difference]: Finished difference Result 623 states and 2051 transitions. [2025-04-13 18:23:19,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:23:19,852 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:23:19,852 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:19,853 INFO L225 Difference]: With dead ends: 623 [2025-04-13 18:23:19,853 INFO L226 Difference]: Without dead ends: 613 [2025-04-13 18:23:19,854 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:23:19,854 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:19,854 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:23:19,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-04-13 18:23:19,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 358. [2025-04-13 18:23:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 3.3529411764705883) internal successors, (1197), 357 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1197 transitions. [2025-04-13 18:23:19,860 INFO L79 Accepts]: Start accepts. Automaton has 358 states and 1197 transitions. Word has length 26 [2025-04-13 18:23:19,860 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:19,860 INFO L485 AbstractCegarLoop]: Abstraction has 358 states and 1197 transitions. [2025-04-13 18:23:19,860 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:19,861 INFO L278 IsEmpty]: Start isEmpty. Operand 358 states and 1197 transitions. [2025-04-13 18:23:19,861 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:23:19,861 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:19,861 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:19,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-13 18:23:20,061 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:20,062 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:20,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:20,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1029530274, now seen corresponding path program 5 times [2025-04-13 18:23:20,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:20,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880950671] [2025-04-13 18:23:20,062 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:23:20,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:20,070 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:23:20,074 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:23:20,074 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:20,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:23:20,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:20,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880950671] [2025-04-13 18:23:20,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880950671] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:20,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105645336] [2025-04-13 18:23:20,120 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:23:20,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:20,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:20,121 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:20,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 18:23:20,198 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:23:20,222 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:23:20,222 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:20,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:20,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:23:20,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:20,270 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 18:23:20,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:20,308 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 18:23:20,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105645336] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:23:20,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:23:20,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 18:23:20,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004908370] [2025-04-13 18:23:20,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:23:20,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:23:20,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:20,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:23:20,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:23:20,309 INFO L87 Difference]: Start difference. First operand 358 states and 1197 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:20,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:20,484 INFO L93 Difference]: Finished difference Result 729 states and 2430 transitions. [2025-04-13 18:23:20,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 18:23:20,485 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:23:20,485 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:20,486 INFO L225 Difference]: With dead ends: 729 [2025-04-13 18:23:20,487 INFO L226 Difference]: Without dead ends: 715 [2025-04-13 18:23:20,487 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:23:20,487 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:20,487 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:23:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-04-13 18:23:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 362. [2025-04-13 18:23:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 3.398891966759003) internal successors, (1227), 361 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 1227 transitions. [2025-04-13 18:23:20,494 INFO L79 Accepts]: Start accepts. Automaton has 362 states and 1227 transitions. Word has length 26 [2025-04-13 18:23:20,494 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:20,494 INFO L485 AbstractCegarLoop]: Abstraction has 362 states and 1227 transitions. [2025-04-13 18:23:20,494 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:20,494 INFO L278 IsEmpty]: Start isEmpty. Operand 362 states and 1227 transitions. [2025-04-13 18:23:20,494 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:23:20,494 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:20,495 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:20,501 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 18:23:20,695 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,SelfDestructingSolverStorable52 [2025-04-13 18:23:20,695 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:20,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:20,695 INFO L85 PathProgramCache]: Analyzing trace with hash 924970254, now seen corresponding path program 6 times [2025-04-13 18:23:20,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:20,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953173127] [2025-04-13 18:23:20,696 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:23:20,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:20,701 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:23:20,705 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:23:20,705 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:23:20,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:20,740 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 18:23:20,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:20,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953173127] [2025-04-13 18:23:20,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953173127] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:20,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810536482] [2025-04-13 18:23:20,741 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:23:20,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:20,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:20,743 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:20,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 18:23:20,807 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:23:20,827 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:23:20,827 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:23:20,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:20,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:23:20,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:23:20,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:20,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:23:20,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810536482] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:20,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:23:20,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-13 18:23:20,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630560054] [2025-04-13 18:23:20,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:20,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:23:20,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:20,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:23:20,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:23:20,919 INFO L87 Difference]: Start difference. First operand 362 states and 1227 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:20,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:20,976 INFO L93 Difference]: Finished difference Result 435 states and 1398 transitions. [2025-04-13 18:23:20,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:23:20,976 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:23:20,977 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:20,978 INFO L225 Difference]: With dead ends: 435 [2025-04-13 18:23:20,978 INFO L226 Difference]: Without dead ends: 419 [2025-04-13 18:23:20,978 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:23:20,978 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:20,978 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:23:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-04-13 18:23:20,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 375. [2025-04-13 18:23:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 3.3663101604278074) internal successors, (1259), 374 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1259 transitions. [2025-04-13 18:23:20,983 INFO L79 Accepts]: Start accepts. Automaton has 375 states and 1259 transitions. Word has length 26 [2025-04-13 18:23:20,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:20,984 INFO L485 AbstractCegarLoop]: Abstraction has 375 states and 1259 transitions. [2025-04-13 18:23:20,984 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:20,984 INFO L278 IsEmpty]: Start isEmpty. Operand 375 states and 1259 transitions. [2025-04-13 18:23:20,984 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:23:20,984 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:20,984 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:20,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 18:23:21,185 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,SelfDestructingSolverStorable53 [2025-04-13 18:23:21,185 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:21,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash -291003121, now seen corresponding path program 1 times [2025-04-13 18:23:21,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:21,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199449496] [2025-04-13 18:23:21,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:23:21,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:21,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:23:21,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:23:21,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:21,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:23:21,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:21,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199449496] [2025-04-13 18:23:21,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199449496] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:21,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418004478] [2025-04-13 18:23:21,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:23:21,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:21,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:21,916 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:21,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 18:23:21,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:23:22,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:23:22,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:22,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:22,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 18:23:22,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:22,010 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:23:22,053 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:23:22,079 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:23:22,079 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 11 treesize of output 11 [2025-04-13 18:23:22,104 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 18:23:22,123 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:23:22,427 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:23:22,428 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 15 [2025-04-13 18:23:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:23:22,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:22,733 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 18:23:22,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418004478] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:23:22,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:23:22,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 10] total 41 [2025-04-13 18:23:22,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187224261] [2025-04-13 18:23:22,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:23:22,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 18:23:22,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:22,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 18:23:22,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1663, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:23:22,734 INFO L87 Difference]: Start difference. First operand 375 states and 1259 transitions. Second operand has 43 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:24,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:24,619 INFO L93 Difference]: Finished difference Result 909 states and 3014 transitions. [2025-04-13 18:23:24,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 18:23:24,619 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:23:24,619 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:24,621 INFO L225 Difference]: With dead ends: 909 [2025-04-13 18:23:24,621 INFO L226 Difference]: Without dead ends: 782 [2025-04-13 18:23:24,622 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=460, Invalid=5240, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 18:23:24,622 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 270 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:24,622 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 0 Invalid, 2695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2661 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:23:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-04-13 18:23:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 468. [2025-04-13 18:23:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 3.394004282655246) internal successors, (1585), 467 states have internal predecessors, (1585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1585 transitions. [2025-04-13 18:23:24,630 INFO L79 Accepts]: Start accepts. Automaton has 468 states and 1585 transitions. Word has length 28 [2025-04-13 18:23:24,630 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:24,630 INFO L485 AbstractCegarLoop]: Abstraction has 468 states and 1585 transitions. [2025-04-13 18:23:24,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:24,630 INFO L278 IsEmpty]: Start isEmpty. Operand 468 states and 1585 transitions. [2025-04-13 18:23:24,631 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:23:24,631 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:24,631 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:24,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-04-13 18:23:24,831 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:24,832 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:24,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:24,832 INFO L85 PathProgramCache]: Analyzing trace with hash -46734165, now seen corresponding path program 2 times [2025-04-13 18:23:24,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:24,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797088666] [2025-04-13 18:23:24,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:23:24,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:24,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:23:24,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:23:24,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:24,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:25,215 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 18:23:25,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:25,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797088666] [2025-04-13 18:23:25,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797088666] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:25,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159056018] [2025-04-13 18:23:25,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:23:25,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:25,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:25,218 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:25,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 18:23:25,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:23:25,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:23:25,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:25,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:25,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:23:25,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:25,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:23:25,694 INFO L325 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2025-04-13 18:23:25,694 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 55 treesize of output 55 [2025-04-13 18:23:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:23:25,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:25,936 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:23:25,936 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 33 treesize of output 78 [2025-04-13 18:23:26,061 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 18:23:26,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159056018] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:23:26,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:23:26,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 10] total 33 [2025-04-13 18:23:26,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896681288] [2025-04-13 18:23:26,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:23:26,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:23:26,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:26,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:23:26,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:23:26,062 INFO L87 Difference]: Start difference. First operand 468 states and 1585 transitions. Second operand has 35 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:27,582 INFO L93 Difference]: Finished difference Result 732 states and 2381 transitions. [2025-04-13 18:23:27,582 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 18:23:27,583 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:23:27,583 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:27,585 INFO L225 Difference]: With dead ends: 732 [2025-04-13 18:23:27,585 INFO L226 Difference]: Without dead ends: 726 [2025-04-13 18:23:27,585 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=335, Invalid=2527, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 18:23:27,585 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 247 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2968 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:27,585 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 0 Invalid, 2992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2968 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:23:27,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-04-13 18:23:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 512. [2025-04-13 18:23:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 3.4090019569471623) internal successors, (1742), 511 states have internal predecessors, (1742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1742 transitions. [2025-04-13 18:23:27,593 INFO L79 Accepts]: Start accepts. Automaton has 512 states and 1742 transitions. Word has length 28 [2025-04-13 18:23:27,594 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:27,594 INFO L485 AbstractCegarLoop]: Abstraction has 512 states and 1742 transitions. [2025-04-13 18:23:27,595 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:27,595 INFO L278 IsEmpty]: Start isEmpty. Operand 512 states and 1742 transitions. [2025-04-13 18:23:27,595 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:23:27,595 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:27,596 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:27,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 18:23:27,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:27,796 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:27,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:27,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1818819501, now seen corresponding path program 3 times [2025-04-13 18:23:27,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:27,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864423610] [2025-04-13 18:23:27,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:23:27,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:27,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:23:27,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:23:27,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:23:27,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:28,189 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 18:23:28,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:28,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864423610] [2025-04-13 18:23:28,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864423610] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:28,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419093217] [2025-04-13 18:23:28,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:23:28,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:28,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:28,191 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:28,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 18:23:28,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:23:28,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:23:28,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:23:28,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:28,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:23:28,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:28,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:23:28,656 INFO L325 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2025-04-13 18:23:28,656 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 55 treesize of output 55 [2025-04-13 18:23:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:23:28,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:28,917 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:23:28,918 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 33 treesize of output 78 [2025-04-13 18:23:29,060 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 18:23:29,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419093217] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:23:29,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:23:29,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 34 [2025-04-13 18:23:29,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451582571] [2025-04-13 18:23:29,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:23:29,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 18:23:29,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:29,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 18:23:29,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:23:29,061 INFO L87 Difference]: Start difference. First operand 512 states and 1742 transitions. Second operand has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:30,746 INFO L93 Difference]: Finished difference Result 694 states and 2337 transitions. [2025-04-13 18:23:30,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 18:23:30,746 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:23:30,746 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:30,748 INFO L225 Difference]: With dead ends: 694 [2025-04-13 18:23:30,748 INFO L226 Difference]: Without dead ends: 688 [2025-04-13 18:23:30,749 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=430, Invalid=3230, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 18:23:30,749 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 132 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:30,749 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 0 Invalid, 2726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2702 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:23:30,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-04-13 18:23:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 560. [2025-04-13 18:23:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 3.445438282647585) internal successors, (1926), 559 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1926 transitions. [2025-04-13 18:23:30,758 INFO L79 Accepts]: Start accepts. Automaton has 560 states and 1926 transitions. Word has length 28 [2025-04-13 18:23:30,758 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:30,758 INFO L485 AbstractCegarLoop]: Abstraction has 560 states and 1926 transitions. [2025-04-13 18:23:30,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:30,758 INFO L278 IsEmpty]: Start isEmpty. Operand 560 states and 1926 transitions. [2025-04-13 18:23:30,759 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:23:30,759 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:30,759 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:30,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-04-13 18:23:30,960 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:30,960 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:30,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:30,961 INFO L85 PathProgramCache]: Analyzing trace with hash -430987787, now seen corresponding path program 4 times [2025-04-13 18:23:30,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:30,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949367149] [2025-04-13 18:23:30,961 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:23:30,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:30,966 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:23:30,975 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:23:30,975 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:23:30,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:31,388 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 18:23:31,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:31,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949367149] [2025-04-13 18:23:31,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949367149] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:31,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242518667] [2025-04-13 18:23:31,389 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:23:31,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:31,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:31,390 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:31,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 18:23:31,458 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:23:31,484 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:23:31,484 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:23:31,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:31,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 18:23:31,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:31,550 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:23:31,828 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:23:31,828 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:23:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:31,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:32,051 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 18:23:32,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242518667] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:23:32,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:23:32,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 9] total 33 [2025-04-13 18:23:32,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312089117] [2025-04-13 18:23:32,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:23:32,052 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:23:32,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:32,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:23:32,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:23:32,052 INFO L87 Difference]: Start difference. First operand 560 states and 1926 transitions. Second operand has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 34 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:33,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:33,629 INFO L93 Difference]: Finished difference Result 808 states and 2647 transitions. [2025-04-13 18:23:33,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:23:33,629 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 34 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:23:33,629 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:33,632 INFO L225 Difference]: With dead ends: 808 [2025-04-13 18:23:33,632 INFO L226 Difference]: Without dead ends: 802 [2025-04-13 18:23:33,632 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=239, Invalid=2211, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:23:33,632 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 172 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3172 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:33,632 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 0 Invalid, 3187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3172 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:23:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-04-13 18:23:33,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 612. [2025-04-13 18:23:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 611 states have (on average 3.4451718494271684) internal successors, (2105), 611 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 2105 transitions. [2025-04-13 18:23:33,644 INFO L79 Accepts]: Start accepts. Automaton has 612 states and 2105 transitions. Word has length 28 [2025-04-13 18:23:33,644 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:33,644 INFO L485 AbstractCegarLoop]: Abstraction has 612 states and 2105 transitions. [2025-04-13 18:23:33,645 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 34 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:33,645 INFO L278 IsEmpty]: Start isEmpty. Operand 612 states and 2105 transitions. [2025-04-13 18:23:33,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:23:33,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:33,646 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:33,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 18:23:33,846 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,SelfDestructingSolverStorable57 [2025-04-13 18:23:33,847 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:33,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:33,848 INFO L85 PathProgramCache]: Analyzing trace with hash 769491023, now seen corresponding path program 5 times [2025-04-13 18:23:33,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:33,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084125784] [2025-04-13 18:23:33,848 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:23:33,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:33,853 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:23:33,862 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:23:33,862 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:33,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:23:34,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:34,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084125784] [2025-04-13 18:23:34,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084125784] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:34,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145955013] [2025-04-13 18:23:34,551 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:23:34,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:34,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:34,552 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:34,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 18:23:34,623 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:23:34,643 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:23:34,643 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:34,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:34,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:23:34,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:34,984 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:23:34,985 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:23:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:23:34,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:35,301 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:23:35,301 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 65 treesize of output 330 [2025-04-13 18:23:48,205 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 18:23:48,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145955013] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:23:48,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:23:48,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 9] total 37 [2025-04-13 18:23:48,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585834931] [2025-04-13 18:23:48,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:23:48,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:23:48,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:48,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:23:48,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1317, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:23:48,206 INFO L87 Difference]: Start difference. First operand 612 states and 2105 transitions. Second operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:50,102 INFO L93 Difference]: Finished difference Result 772 states and 2554 transitions. [2025-04-13 18:23:50,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 18:23:50,103 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 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 28 [2025-04-13 18:23:50,103 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:50,106 INFO L225 Difference]: With dead ends: 772 [2025-04-13 18:23:50,106 INFO L226 Difference]: Without dead ends: 766 [2025-04-13 18:23:50,106 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=397, Invalid=3509, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 18:23:50,106 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2939 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:50,107 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 2976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2939 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:23:50,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-04-13 18:23:50,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 636. [2025-04-13 18:23:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 3.415748031496063) internal successors, (2169), 635 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2169 transitions. [2025-04-13 18:23:50,117 INFO L79 Accepts]: Start accepts. Automaton has 636 states and 2169 transitions. Word has length 28 [2025-04-13 18:23:50,117 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:50,117 INFO L485 AbstractCegarLoop]: Abstraction has 636 states and 2169 transitions. [2025-04-13 18:23:50,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:50,117 INFO L278 IsEmpty]: Start isEmpty. Operand 636 states and 2169 transitions. [2025-04-13 18:23:50,119 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:23:50,119 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:50,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:50,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 18:23:50,319 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 18:23:50,319 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:50,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1759124493, now seen corresponding path program 6 times [2025-04-13 18:23:50,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:50,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029978474] [2025-04-13 18:23:50,320 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:23:50,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:50,327 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:23:50,340 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:23:50,340 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:23:50,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:50,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:50,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029978474] [2025-04-13 18:23:50,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029978474] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:50,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948753694] [2025-04-13 18:23:50,952 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:23:50,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:50,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:50,953 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:50,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 18:23:51,030 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:23:51,051 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:23:51,051 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:23:51,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:51,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:23:51,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:51,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:23:51,470 INFO L325 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2025-04-13 18:23:51,471 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 55 treesize of output 55 [2025-04-13 18:23:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:23:51,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:51,768 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:23:51,768 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2025-04-13 18:23:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:23:51,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948753694] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:23:51,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:23:51,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 10] total 37 [2025-04-13 18:23:51,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399692832] [2025-04-13 18:23:51,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:23:51,883 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:23:51,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:51,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:23:51,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1322, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:23:51,884 INFO L87 Difference]: Start difference. First operand 636 states and 2169 transitions. Second operand has 39 states, 38 states have (on average 1.894736842105263) internal successors, (72), 38 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:53,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:53,619 INFO L93 Difference]: Finished difference Result 850 states and 2851 transitions. [2025-04-13 18:23:53,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 18:23:53,619 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.894736842105263) internal successors, (72), 38 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:23:53,619 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:53,621 INFO L225 Difference]: With dead ends: 850 [2025-04-13 18:23:53,621 INFO L226 Difference]: Without dead ends: 844 [2025-04-13 18:23:53,622 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=528, Invalid=3762, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 18:23:53,622 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 236 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2400 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:53,622 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 0 Invalid, 2459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2400 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:23:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2025-04-13 18:23:53,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 670. [2025-04-13 18:23:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 669 states have (on average 3.415545590433483) internal successors, (2285), 669 states have internal predecessors, (2285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 2285 transitions. [2025-04-13 18:23:53,631 INFO L79 Accepts]: Start accepts. Automaton has 670 states and 2285 transitions. Word has length 28 [2025-04-13 18:23:53,631 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:53,631 INFO L485 AbstractCegarLoop]: Abstraction has 670 states and 2285 transitions. [2025-04-13 18:23:53,631 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.894736842105263) internal successors, (72), 38 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:53,632 INFO L278 IsEmpty]: Start isEmpty. Operand 670 states and 2285 transitions. [2025-04-13 18:23:53,632 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:23:53,632 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:53,632 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:53,639 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 18:23:53,833 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 18:23:53,833 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:53,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:53,833 INFO L85 PathProgramCache]: Analyzing trace with hash 462053421, now seen corresponding path program 7 times [2025-04-13 18:23:53,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:53,833 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474668819] [2025-04-13 18:23:53,834 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:23:53,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:53,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:23:53,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:23:53,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:53,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:23:54,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:54,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474668819] [2025-04-13 18:23:54,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474668819] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:54,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434192745] [2025-04-13 18:23:54,665 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:23:54,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:54,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:54,667 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:54,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 18:23:54,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:23:54,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:23:54,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:54,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:54,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 18:23:54,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:54,765 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:23:54,806 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:23:54,829 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:23:54,829 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 11 treesize of output 11 [2025-04-13 18:23:54,858 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 18:23:54,884 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:23:55,218 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:23:55,218 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 15 [2025-04-13 18:23:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:23:55,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:55,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:23:55,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434192745] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:23:55,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:23:55,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 10] total 41 [2025-04-13 18:23:55,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501631778] [2025-04-13 18:23:55,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:23:55,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 18:23:55,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:55,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 18:23:55,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1652, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:23:55,507 INFO L87 Difference]: Start difference. First operand 670 states and 2285 transitions. Second operand has 43 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:58,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:58,256 INFO L93 Difference]: Finished difference Result 976 states and 3282 transitions. [2025-04-13 18:23:58,256 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 18:23:58,256 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:23:58,256 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:58,258 INFO L225 Difference]: With dead ends: 976 [2025-04-13 18:23:58,258 INFO L226 Difference]: Without dead ends: 970 [2025-04-13 18:23:58,259 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1561 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=584, Invalid=6222, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 18:23:58,259 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 188 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3449 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:58,259 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 0 Invalid, 3472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3449 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:23:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2025-04-13 18:23:58,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 724. [2025-04-13 18:23:58,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 3.413554633471646) internal successors, (2468), 723 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:58,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 2468 transitions. [2025-04-13 18:23:58,272 INFO L79 Accepts]: Start accepts. Automaton has 724 states and 2468 transitions. Word has length 28 [2025-04-13 18:23:58,272 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:58,272 INFO L485 AbstractCegarLoop]: Abstraction has 724 states and 2468 transitions. [2025-04-13 18:23:58,272 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:58,272 INFO L278 IsEmpty]: Start isEmpty. Operand 724 states and 2468 transitions. [2025-04-13 18:23:58,273 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:23:58,273 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:58,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:58,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 18:23:58,473 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 18:23:58,473 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:23:58,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:58,474 INFO L85 PathProgramCache]: Analyzing trace with hash -710668803, now seen corresponding path program 8 times [2025-04-13 18:23:58,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:58,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973917301] [2025-04-13 18:23:58,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:23:58,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:58,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:23:58,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:23:58,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:58,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:23:58,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:58,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973917301] [2025-04-13 18:23:58,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973917301] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:23:58,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202694591] [2025-04-13 18:23:58,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:23:58,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:23:58,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:23:58,899 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:23:58,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 18:23:58,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:23:58,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:23:58,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:58,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:58,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:23:58,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:23:59,318 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:23:59,318 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:23:59,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:23:59,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:23:59,557 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:23:59,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 33 treesize of output 78 [2025-04-13 18:23:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:23:59,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202694591] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:23:59,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:23:59,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 10] total 32 [2025-04-13 18:23:59,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557776127] [2025-04-13 18:23:59,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:23:59,645 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:23:59,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:59,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:23:59,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:23:59,645 INFO L87 Difference]: Start difference. First operand 724 states and 2468 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:02,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:02,040 INFO L93 Difference]: Finished difference Result 1077 states and 3601 transitions. [2025-04-13 18:24:02,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-04-13 18:24:02,040 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:24:02,040 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:02,042 INFO L225 Difference]: With dead ends: 1077 [2025-04-13 18:24:02,042 INFO L226 Difference]: Without dead ends: 1071 [2025-04-13 18:24:02,043 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=866, Invalid=5140, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 18:24:02,043 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 256 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2594 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:02,043 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 0 Invalid, 2675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2594 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:24:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-04-13 18:24:02,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 730. [2025-04-13 18:24:02,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 3.4362139917695473) internal successors, (2505), 729 states have internal predecessors, (2505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:02,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 2505 transitions. [2025-04-13 18:24:02,055 INFO L79 Accepts]: Start accepts. Automaton has 730 states and 2505 transitions. Word has length 28 [2025-04-13 18:24:02,055 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:02,055 INFO L485 AbstractCegarLoop]: Abstraction has 730 states and 2505 transitions. [2025-04-13 18:24:02,055 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:02,055 INFO L278 IsEmpty]: Start isEmpty. Operand 730 states and 2505 transitions. [2025-04-13 18:24:02,056 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:24:02,056 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:02,056 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:02,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 18:24:02,256 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 18:24:02,257 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:24:02,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:02,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1425558689, now seen corresponding path program 9 times [2025-04-13 18:24:02,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:02,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13519488] [2025-04-13 18:24:02,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:24:02,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:02,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:24:02,277 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:24:02,277 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:24:02,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:24:03,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:03,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13519488] [2025-04-13 18:24:03,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13519488] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:24:03,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402899558] [2025-04-13 18:24:03,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:24:03,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:24:03,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:24:03,107 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:24:03,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 18:24:03,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:24:03,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:24:03,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:24:03,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:03,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 18:24:03,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:24:03,565 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:24:03,565 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:24:03,639 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:24:03,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:24:03,876 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:24:03,877 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 33 treesize of output 78 [2025-04-13 18:24:03,948 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:24:03,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402899558] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:24:03,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:24:03,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 11] total 37 [2025-04-13 18:24:03,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892526127] [2025-04-13 18:24:03,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:24:03,949 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:24:03,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:03,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:24:03,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1308, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:24:03,949 INFO L87 Difference]: Start difference. First operand 730 states and 2505 transitions. Second operand has 39 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:05,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:05,649 INFO L93 Difference]: Finished difference Result 932 states and 3156 transitions. [2025-04-13 18:24:05,649 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 18:24:05,650 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:24:05,650 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:05,652 INFO L225 Difference]: With dead ends: 932 [2025-04-13 18:24:05,652 INFO L226 Difference]: Without dead ends: 926 [2025-04-13 18:24:05,652 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=448, Invalid=3712, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 18:24:05,653 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 163 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2512 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:05,653 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 0 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2512 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:24:05,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-04-13 18:24:05,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 748. [2025-04-13 18:24:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.4484605087014724) internal successors, (2576), 747 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:05,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2576 transitions. [2025-04-13 18:24:05,665 INFO L79 Accepts]: Start accepts. Automaton has 748 states and 2576 transitions. Word has length 28 [2025-04-13 18:24:05,665 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:05,665 INFO L485 AbstractCegarLoop]: Abstraction has 748 states and 2576 transitions. [2025-04-13 18:24:05,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:05,665 INFO L278 IsEmpty]: Start isEmpty. Operand 748 states and 2576 transitions. [2025-04-13 18:24:05,666 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:24:05,666 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:05,666 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:05,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-13 18:24:05,867 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 18:24:05,867 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:24:05,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:05,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1711097173, now seen corresponding path program 10 times [2025-04-13 18:24:05,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:05,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693054347] [2025-04-13 18:24:05,868 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:24:05,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:05,874 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:24:05,881 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:24:05,881 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:24:05,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:06,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:06,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693054347] [2025-04-13 18:24:06,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693054347] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:24:06,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715880558] [2025-04-13 18:24:06,448 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:24:06,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:24:06,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:24:06,450 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:24:06,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-13 18:24:06,526 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:24:06,547 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:24:06,547 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:24:06,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:06,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 18:24:06,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:24:06,621 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:24:06,883 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:24:06,883 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:24:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:06,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:24:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:24:07,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715880558] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:24:07,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:24:07,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 37 [2025-04-13 18:24:07,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641168912] [2025-04-13 18:24:07,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:24:07,105 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:24:07,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:07,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:24:07,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1309, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:24:07,106 INFO L87 Difference]: Start difference. First operand 748 states and 2576 transitions. Second operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:08,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:08,910 INFO L93 Difference]: Finished difference Result 941 states and 3138 transitions. [2025-04-13 18:24:08,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 18:24:08,910 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:24:08,910 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:08,912 INFO L225 Difference]: With dead ends: 941 [2025-04-13 18:24:08,912 INFO L226 Difference]: Without dead ends: 930 [2025-04-13 18:24:08,913 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=407, Invalid=3133, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 18:24:08,913 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 177 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3109 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:08,913 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 0 Invalid, 3140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3109 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:24:08,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-04-13 18:24:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 774. [2025-04-13 18:24:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 3.428201811125485) internal successors, (2650), 773 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 2650 transitions. [2025-04-13 18:24:08,925 INFO L79 Accepts]: Start accepts. Automaton has 774 states and 2650 transitions. Word has length 28 [2025-04-13 18:24:08,925 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:08,925 INFO L485 AbstractCegarLoop]: Abstraction has 774 states and 2650 transitions. [2025-04-13 18:24:08,925 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:08,925 INFO L278 IsEmpty]: Start isEmpty. Operand 774 states and 2650 transitions. [2025-04-13 18:24:08,926 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:24:08,926 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:08,926 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:08,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-13 18:24:09,126 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 18:24:09,127 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:24:09,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:09,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1154989139, now seen corresponding path program 11 times [2025-04-13 18:24:09,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:09,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070610010] [2025-04-13 18:24:09,127 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:24:09,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:09,132 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:24:09,140 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:24:09,140 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:24:09,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:09,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:09,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070610010] [2025-04-13 18:24:09,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070610010] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:24:09,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493657820] [2025-04-13 18:24:09,855 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:24:09,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:24:09,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:24:09,857 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:24:09,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-13 18:24:09,934 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:24:09,955 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:24:09,956 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:24:09,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:09,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:24:09,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:24:10,328 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:24:10,328 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:24:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:24:10,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:24:10,720 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:24:10,721 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 65 treesize of output 330 [2025-04-13 18:24:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:24:30,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493657820] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:24:30,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:24:30,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 9] total 37 [2025-04-13 18:24:30,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143684598] [2025-04-13 18:24:30,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:24:30,842 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:24:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:30,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:24:30,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:24:30,843 INFO L87 Difference]: Start difference. First operand 774 states and 2650 transitions. Second operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:33,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:33,855 INFO L93 Difference]: Finished difference Result 1046 states and 3541 transitions. [2025-04-13 18:24:33,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-04-13 18:24:33,856 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 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 28 [2025-04-13 18:24:33,856 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:33,858 INFO L225 Difference]: With dead ends: 1046 [2025-04-13 18:24:33,858 INFO L226 Difference]: Without dead ends: 1040 [2025-04-13 18:24:33,859 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=688, Invalid=6118, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 18:24:33,859 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 215 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:33,859 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 0 Invalid, 3585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 3531 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 18:24:33,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2025-04-13 18:24:33,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 782. [2025-04-13 18:24:33,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 3.439180537772087) internal successors, (2686), 781 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 2686 transitions. [2025-04-13 18:24:33,871 INFO L79 Accepts]: Start accepts. Automaton has 782 states and 2686 transitions. Word has length 28 [2025-04-13 18:24:33,871 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:33,871 INFO L485 AbstractCegarLoop]: Abstraction has 782 states and 2686 transitions. [2025-04-13 18:24:33,872 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:33,872 INFO L278 IsEmpty]: Start isEmpty. Operand 782 states and 2686 transitions. [2025-04-13 18:24:33,873 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:24:33,873 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:33,873 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:33,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-13 18:24:34,073 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 18:24:34,073 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:24:34,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:34,074 INFO L85 PathProgramCache]: Analyzing trace with hash -760621025, now seen corresponding path program 12 times [2025-04-13 18:24:34,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:34,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049976180] [2025-04-13 18:24:34,074 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:24:34,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:34,079 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:24:34,084 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 18:24:34,084 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:24:34,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:24:34,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:34,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049976180] [2025-04-13 18:24:34,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049976180] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:34,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:34,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 18:24:34,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104240529] [2025-04-13 18:24:34,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:34,529 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:24:34,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:34,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:24:34,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:24:34,530 INFO L87 Difference]: Start difference. First operand 782 states and 2686 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:34,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:34,986 INFO L93 Difference]: Finished difference Result 900 states and 3056 transitions. [2025-04-13 18:24:34,987 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:24:34,987 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:24:34,987 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:34,989 INFO L225 Difference]: With dead ends: 900 [2025-04-13 18:24:34,989 INFO L226 Difference]: Without dead ends: 894 [2025-04-13 18:24:34,989 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:24:34,989 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:34,989 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:24:34,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-04-13 18:24:34,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 794. [2025-04-13 18:24:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 3.4350567465321564) internal successors, (2724), 793 states have internal predecessors, (2724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:35,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 2724 transitions. [2025-04-13 18:24:35,002 INFO L79 Accepts]: Start accepts. Automaton has 794 states and 2724 transitions. Word has length 28 [2025-04-13 18:24:35,002 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:35,002 INFO L485 AbstractCegarLoop]: Abstraction has 794 states and 2724 transitions. [2025-04-13 18:24:35,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:35,002 INFO L278 IsEmpty]: Start isEmpty. Operand 794 states and 2724 transitions. [2025-04-13 18:24:35,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:24:35,004 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:35,004 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:35,004 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-04-13 18:24:35,004 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:24:35,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:35,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1798949003, now seen corresponding path program 13 times [2025-04-13 18:24:35,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:35,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255704883] [2025-04-13 18:24:35,004 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:24:35,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:35,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:24:35,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:24:35,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:24:35,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:35,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:35,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255704883] [2025-04-13 18:24:35,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255704883] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:24:35,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680903761] [2025-04-13 18:24:35,682 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:24:35,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:24:35,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:24:35,684 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:24:35,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-13 18:24:35,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:24:35,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:24:35,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:24:35,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:35,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 18:24:35,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:24:35,792 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:24:35,832 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:24:35,854 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:24:35,854 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 11 treesize of output 11 [2025-04-13 18:24:35,876 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 18:24:35,897 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:24:36,172 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:24:36,172 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 15 [2025-04-13 18:24:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:24:36,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:24:36,459 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 18:24:36,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680903761] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:24:36,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:24:36,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 10] total 40 [2025-04-13 18:24:36,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161090981] [2025-04-13 18:24:36,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:24:36,460 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 18:24:36,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:36,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 18:24:36,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1571, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 18:24:36,460 INFO L87 Difference]: Start difference. First operand 794 states and 2724 transitions. Second operand has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:38,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:38,449 INFO L93 Difference]: Finished difference Result 1059 states and 3592 transitions. [2025-04-13 18:24:38,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 18:24:38,450 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:24:38,450 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:38,452 INFO L225 Difference]: With dead ends: 1059 [2025-04-13 18:24:38,452 INFO L226 Difference]: Without dead ends: 1053 [2025-04-13 18:24:38,452 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=504, Invalid=4898, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 18:24:38,453 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 199 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2861 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:38,453 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 0 Invalid, 2886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2861 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:24:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2025-04-13 18:24:38,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 798. [2025-04-13 18:24:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 3.4303638644918446) internal successors, (2734), 797 states have internal predecessors, (2734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2734 transitions. [2025-04-13 18:24:38,470 INFO L79 Accepts]: Start accepts. Automaton has 798 states and 2734 transitions. Word has length 28 [2025-04-13 18:24:38,470 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:38,470 INFO L485 AbstractCegarLoop]: Abstraction has 798 states and 2734 transitions. [2025-04-13 18:24:38,470 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:38,470 INFO L278 IsEmpty]: Start isEmpty. Operand 798 states and 2734 transitions. [2025-04-13 18:24:38,471 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:24:38,471 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:38,471 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:38,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-04-13 18:24:38,671 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,SelfDestructingSolverStorable66 [2025-04-13 18:24:38,672 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:24:38,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:38,672 INFO L85 PathProgramCache]: Analyzing trace with hash -490051475, now seen corresponding path program 14 times [2025-04-13 18:24:38,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:38,672 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204174814] [2025-04-13 18:24:38,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:24:38,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:38,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:24:38,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 18:24:38,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:24:38,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:24:39,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:39,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204174814] [2025-04-13 18:24:39,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204174814] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:39,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:39,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 18:24:39,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340098920] [2025-04-13 18:24:39,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:39,113 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:24:39,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:39,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:24:39,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:24:39,113 INFO L87 Difference]: Start difference. First operand 798 states and 2734 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:39,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:39,557 INFO L93 Difference]: Finished difference Result 898 states and 3054 transitions. [2025-04-13 18:24:39,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:24:39,557 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:24:39,557 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:39,559 INFO L225 Difference]: With dead ends: 898 [2025-04-13 18:24:39,559 INFO L226 Difference]: Without dead ends: 892 [2025-04-13 18:24:39,560 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:24:39,560 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:39,560 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:24:39,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2025-04-13 18:24:39,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 802. [2025-04-13 18:24:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 801 states have (on average 3.4257178526841447) internal successors, (2744), 801 states have internal predecessors, (2744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:39,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 2744 transitions. [2025-04-13 18:24:39,572 INFO L79 Accepts]: Start accepts. Automaton has 802 states and 2744 transitions. Word has length 28 [2025-04-13 18:24:39,572 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:39,572 INFO L485 AbstractCegarLoop]: Abstraction has 802 states and 2744 transitions. [2025-04-13 18:24:39,572 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:39,572 INFO L278 IsEmpty]: Start isEmpty. Operand 802 states and 2744 transitions. [2025-04-13 18:24:39,573 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:24:39,573 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:39,573 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:39,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-04-13 18:24:39,573 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:24:39,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:39,574 INFO L85 PathProgramCache]: Analyzing trace with hash 287312087, now seen corresponding path program 15 times [2025-04-13 18:24:39,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:39,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81621023] [2025-04-13 18:24:39,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:24:39,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:39,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:24:39,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 18:24:39,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:24:39,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:39,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:24:39,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:39,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81621023] [2025-04-13 18:24:39,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81621023] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:24:39,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:24:39,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 18:24:39,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175184302] [2025-04-13 18:24:39,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:24:39,975 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:24:39,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:39,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:24:39,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:24:39,975 INFO L87 Difference]: Start difference. First operand 802 states and 2744 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:40,407 INFO L93 Difference]: Finished difference Result 895 states and 3044 transitions. [2025-04-13 18:24:40,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:24:40,407 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:24:40,407 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:40,409 INFO L225 Difference]: With dead ends: 895 [2025-04-13 18:24:40,409 INFO L226 Difference]: Without dead ends: 889 [2025-04-13 18:24:40,410 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:24:40,410 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:40,410 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:24:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-04-13 18:24:40,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 800. [2025-04-13 18:24:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 3.4280350438047558) internal successors, (2739), 799 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 2739 transitions. [2025-04-13 18:24:40,420 INFO L79 Accepts]: Start accepts. Automaton has 800 states and 2739 transitions. Word has length 28 [2025-04-13 18:24:40,420 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:40,420 INFO L485 AbstractCegarLoop]: Abstraction has 800 states and 2739 transitions. [2025-04-13 18:24:40,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:40,421 INFO L278 IsEmpty]: Start isEmpty. Operand 800 states and 2739 transitions. [2025-04-13 18:24:40,422 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:24:40,422 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:40,422 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:40,422 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-04-13 18:24:40,422 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:24:40,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:40,422 INFO L85 PathProgramCache]: Analyzing trace with hash 27915875, now seen corresponding path program 16 times [2025-04-13 18:24:40,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:40,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154472419] [2025-04-13 18:24:40,422 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:24:40,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:40,427 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:24:40,436 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:24:40,437 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:24:40,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:41,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:41,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154472419] [2025-04-13 18:24:41,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154472419] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:24:41,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386500255] [2025-04-13 18:24:41,005 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:24:41,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:24:41,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:24:41,007 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:24:41,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-13 18:24:41,084 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:24:41,105 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:24:41,105 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:24:41,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:41,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 18:24:41,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:24:41,185 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:24:41,458 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:24:41,458 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:24:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:41,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:24:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:24:41,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386500255] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:24:41,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:24:41,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 37 [2025-04-13 18:24:41,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381202264] [2025-04-13 18:24:41,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:24:41,738 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:24:41,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:24:41,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:24:41,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1313, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:24:41,739 INFO L87 Difference]: Start difference. First operand 800 states and 2739 transitions. Second operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:24:43,079 INFO L93 Difference]: Finished difference Result 1005 states and 3372 transitions. [2025-04-13 18:24:43,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:24:43,079 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:24:43,079 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:24:43,081 INFO L225 Difference]: With dead ends: 1005 [2025-04-13 18:24:43,081 INFO L226 Difference]: Without dead ends: 994 [2025-04-13 18:24:43,082 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=346, Invalid=2846, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 18:24:43,082 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 215 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2047 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:24:43,082 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 0 Invalid, 2072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2047 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:24:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-04-13 18:24:43,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 812. [2025-04-13 18:24:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 3.4315659679408137) internal successors, (2783), 811 states have internal predecessors, (2783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:43,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2783 transitions. [2025-04-13 18:24:43,094 INFO L79 Accepts]: Start accepts. Automaton has 812 states and 2783 transitions. Word has length 28 [2025-04-13 18:24:43,094 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:24:43,094 INFO L485 AbstractCegarLoop]: Abstraction has 812 states and 2783 transitions. [2025-04-13 18:24:43,094 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:24:43,094 INFO L278 IsEmpty]: Start isEmpty. Operand 812 states and 2783 transitions. [2025-04-13 18:24:43,095 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:24:43,095 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:24:43,095 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:24:43,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2025-04-13 18:24:43,295 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,SelfDestructingSolverStorable69 [2025-04-13 18:24:43,296 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:24:43,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:24:43,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1618418175, now seen corresponding path program 17 times [2025-04-13 18:24:43,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:24:43,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30675985] [2025-04-13 18:24:43,296 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:24:43,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:24:43,301 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:24:43,309 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:24:43,309 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:24:43,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:24:43,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:24:43,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30675985] [2025-04-13 18:24:43,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30675985] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:24:43,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40267324] [2025-04-13 18:24:43,888 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:24:43,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:24:43,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:24:43,889 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:24:43,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-04-13 18:24:43,969 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:24:43,991 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:24:43,991 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:24:43,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:24:43,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:24:43,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:24:44,322 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:24:44,322 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:24:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:24:44,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:24:44,608 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:24:44,609 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 65 treesize of output 330 [2025-04-13 18:25:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:03,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40267324] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:25:03,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:25:03,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 9] total 35 [2025-04-13 18:25:03,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422698899] [2025-04-13 18:25:03,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:25:03,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 18:25:03,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:03,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 18:25:03,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1178, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:25:03,705 INFO L87 Difference]: Start difference. First operand 812 states and 2783 transitions. Second operand has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:05,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:05,467 INFO L93 Difference]: Finished difference Result 1009 states and 3373 transitions. [2025-04-13 18:25:05,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 18:25:05,467 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:25:05,467 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:05,470 INFO L225 Difference]: With dead ends: 1009 [2025-04-13 18:25:05,470 INFO L226 Difference]: Without dead ends: 1003 [2025-04-13 18:25:05,471 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=405, Invalid=3501, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 18:25:05,471 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 177 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2442 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:05,471 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 0 Invalid, 2484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2442 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:25:05,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-04-13 18:25:05,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 834. [2025-04-13 18:25:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 833 states have (on average 3.418967587034814) internal successors, (2848), 833 states have internal predecessors, (2848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:05,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 2848 transitions. [2025-04-13 18:25:05,486 INFO L79 Accepts]: Start accepts. Automaton has 834 states and 2848 transitions. Word has length 28 [2025-04-13 18:25:05,486 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:05,486 INFO L485 AbstractCegarLoop]: Abstraction has 834 states and 2848 transitions. [2025-04-13 18:25:05,486 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:05,487 INFO L278 IsEmpty]: Start isEmpty. Operand 834 states and 2848 transitions. [2025-04-13 18:25:05,488 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:25:05,488 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:05,488 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:05,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2025-04-13 18:25:05,688 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,SelfDestructingSolverStorable70 [2025-04-13 18:25:05,688 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:25:05,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:05,689 INFO L85 PathProgramCache]: Analyzing trace with hash 931453743, now seen corresponding path program 18 times [2025-04-13 18:25:05,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:05,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260206019] [2025-04-13 18:25:05,689 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:25:05,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:05,694 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:05,704 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:05,704 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:25:05,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:25:06,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:06,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260206019] [2025-04-13 18:25:06,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260206019] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:06,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096960182] [2025-04-13 18:25:06,406 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:25:06,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:06,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:06,407 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:25:06,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-04-13 18:25:06,490 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:06,511 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:06,512 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:25:06,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:06,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 18:25:06,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:06,895 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:25:06,895 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:25:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:06,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:25:07,190 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:25:07,190 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 33 treesize of output 78 [2025-04-13 18:25:07,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:07,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096960182] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:25:07,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:25:07,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 11] total 37 [2025-04-13 18:25:07,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671421612] [2025-04-13 18:25:07,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:25:07,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:25:07,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:07,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:25:07,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1311, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:25:07,294 INFO L87 Difference]: Start difference. First operand 834 states and 2848 transitions. Second operand has 39 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:08,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:08,968 INFO L93 Difference]: Finished difference Result 1072 states and 3621 transitions. [2025-04-13 18:25:08,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 18:25:08,968 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:25:08,968 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:08,971 INFO L225 Difference]: With dead ends: 1072 [2025-04-13 18:25:08,971 INFO L226 Difference]: Without dead ends: 1066 [2025-04-13 18:25:08,971 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=452, Invalid=3708, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 18:25:08,971 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 173 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2374 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:08,971 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 0 Invalid, 2409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2374 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:25:08,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-04-13 18:25:08,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 834. [2025-04-13 18:25:08,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 833 states have (on average 3.418967587034814) internal successors, (2848), 833 states have internal predecessors, (2848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:08,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 2848 transitions. [2025-04-13 18:25:08,983 INFO L79 Accepts]: Start accepts. Automaton has 834 states and 2848 transitions. Word has length 28 [2025-04-13 18:25:08,983 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:08,983 INFO L485 AbstractCegarLoop]: Abstraction has 834 states and 2848 transitions. [2025-04-13 18:25:08,983 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:08,984 INFO L278 IsEmpty]: Start isEmpty. Operand 834 states and 2848 transitions. [2025-04-13 18:25:08,985 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:25:08,985 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:08,985 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:08,991 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 18:25:09,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:09,185 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:25:09,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:09,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1059506561, now seen corresponding path program 19 times [2025-04-13 18:25:09,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:09,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321955879] [2025-04-13 18:25:09,186 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:25:09,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:09,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:25:09,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:09,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:09,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:25:09,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:09,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321955879] [2025-04-13 18:25:09,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321955879] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:09,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226987410] [2025-04-13 18:25:09,820 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:25:09,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:09,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:09,822 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:25:09,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-04-13 18:25:09,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:25:09,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:09,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:09,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:09,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 18:25:09,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:09,927 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:25:09,965 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:25:09,987 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:25:09,987 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 18:25:10,010 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 18:25:10,035 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:25:10,324 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:25:10,325 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 15 [2025-04-13 18:25:10,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:25:10,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:25:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:10,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226987410] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:25:10,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:25:10,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 10] total 40 [2025-04-13 18:25:10,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085665096] [2025-04-13 18:25:10,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:25:10,611 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 18:25:10,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:10,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 18:25:10,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1564, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 18:25:10,611 INFO L87 Difference]: Start difference. First operand 834 states and 2848 transitions. Second operand has 42 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:12,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:12,352 INFO L93 Difference]: Finished difference Result 1082 states and 3645 transitions. [2025-04-13 18:25:12,352 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 18:25:12,352 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 41 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 28 [2025-04-13 18:25:12,352 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:12,354 INFO L225 Difference]: With dead ends: 1082 [2025-04-13 18:25:12,354 INFO L226 Difference]: Without dead ends: 1076 [2025-04-13 18:25:12,355 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=452, Invalid=4378, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 18:25:12,355 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 194 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2610 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:12,355 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 0 Invalid, 2632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2610 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:25:12,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2025-04-13 18:25:12,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 844. [2025-04-13 18:25:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 3.4116251482799527) internal successors, (2876), 843 states have internal predecessors, (2876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:12,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 2876 transitions. [2025-04-13 18:25:12,367 INFO L79 Accepts]: Start accepts. Automaton has 844 states and 2876 transitions. Word has length 28 [2025-04-13 18:25:12,367 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:12,367 INFO L485 AbstractCegarLoop]: Abstraction has 844 states and 2876 transitions. [2025-04-13 18:25:12,367 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.7317073170731707) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:12,367 INFO L278 IsEmpty]: Start isEmpty. Operand 844 states and 2876 transitions. [2025-04-13 18:25:12,368 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:25:12,368 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:12,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:12,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2025-04-13 18:25:12,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:12,569 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:25:12,569 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:12,569 INFO L85 PathProgramCache]: Analyzing trace with hash -383203029, now seen corresponding path program 20 times [2025-04-13 18:25:12,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:12,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494065602] [2025-04-13 18:25:12,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:25:12,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:12,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:12,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:12,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:25:12,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:12,966 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 18:25:12,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:12,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494065602] [2025-04-13 18:25:12,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494065602] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:12,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596843714] [2025-04-13 18:25:12,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:25:12,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:12,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:12,968 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:25:12,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-04-13 18:25:13,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:13,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:13,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:25:13,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:13,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:25:13,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:13,405 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:25:13,405 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:25:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:25:13,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:25:13,671 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:25:13,671 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 33 treesize of output 78 [2025-04-13 18:25:13,747 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 18:25:13,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596843714] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:25:13,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:25:13,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 33 [2025-04-13 18:25:13,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545291310] [2025-04-13 18:25:13,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:25:13,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:25:13,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:13,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:25:13,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1034, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:25:13,748 INFO L87 Difference]: Start difference. First operand 844 states and 2876 transitions. Second operand has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:15,457 INFO L93 Difference]: Finished difference Result 1078 states and 3563 transitions. [2025-04-13 18:25:15,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 18:25:15,458 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:25:15,458 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:15,460 INFO L225 Difference]: With dead ends: 1078 [2025-04-13 18:25:15,460 INFO L226 Difference]: Without dead ends: 1072 [2025-04-13 18:25:15,460 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=432, Invalid=3350, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 18:25:15,461 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 195 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2641 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:15,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 0 Invalid, 2711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2641 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:25:15,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-04-13 18:25:15,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 862. [2025-04-13 18:25:15,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 861 states have (on average 3.4111498257839723) internal successors, (2937), 861 states have internal predecessors, (2937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:15,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 2937 transitions. [2025-04-13 18:25:15,473 INFO L79 Accepts]: Start accepts. Automaton has 862 states and 2937 transitions. Word has length 28 [2025-04-13 18:25:15,473 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:15,473 INFO L485 AbstractCegarLoop]: Abstraction has 862 states and 2937 transitions. [2025-04-13 18:25:15,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:15,473 INFO L278 IsEmpty]: Start isEmpty. Operand 862 states and 2937 transitions. [2025-04-13 18:25:15,475 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:25:15,475 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:15,475 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:15,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2025-04-13 18:25:15,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2025-04-13 18:25:15,675 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:25:15,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:15,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1770921969, now seen corresponding path program 21 times [2025-04-13 18:25:15,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:15,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790709339] [2025-04-13 18:25:15,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:25:15,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:15,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:15,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:15,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:25:15,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:25:16,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:16,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790709339] [2025-04-13 18:25:16,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790709339] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:16,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822544069] [2025-04-13 18:25:16,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:25:16,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:16,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:16,336 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:25:16,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-04-13 18:25:16,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:16,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:16,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:25:16,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:16,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 18:25:16,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:16,849 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:25:16,849 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:25:16,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:16,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:25:17,118 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:25:17,118 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 33 treesize of output 78 [2025-04-13 18:25:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:17,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822544069] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:25:17,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:25:17,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 11] total 38 [2025-04-13 18:25:17,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137307031] [2025-04-13 18:25:17,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:25:17,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 18:25:17,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:17,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 18:25:17,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1389, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 18:25:17,215 INFO L87 Difference]: Start difference. First operand 862 states and 2937 transitions. Second operand has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:18,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:18,645 INFO L93 Difference]: Finished difference Result 1002 states and 3336 transitions. [2025-04-13 18:25:18,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 18:25:18,646 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:25:18,646 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:18,648 INFO L225 Difference]: With dead ends: 1002 [2025-04-13 18:25:18,648 INFO L226 Difference]: Without dead ends: 996 [2025-04-13 18:25:18,648 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=365, Invalid=2941, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 18:25:18,648 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 144 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:18,649 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 0 Invalid, 2579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2559 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:25:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-04-13 18:25:18,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 866. [2025-04-13 18:25:18,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 865 states have (on average 3.4161849710982657) internal successors, (2955), 865 states have internal predecessors, (2955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:18,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 2955 transitions. [2025-04-13 18:25:18,660 INFO L79 Accepts]: Start accepts. Automaton has 866 states and 2955 transitions. Word has length 28 [2025-04-13 18:25:18,660 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:18,660 INFO L485 AbstractCegarLoop]: Abstraction has 866 states and 2955 transitions. [2025-04-13 18:25:18,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:18,660 INFO L278 IsEmpty]: Start isEmpty. Operand 866 states and 2955 transitions. [2025-04-13 18:25:18,661 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:25:18,661 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:18,661 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:18,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2025-04-13 18:25:18,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:18,862 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:25:18,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:18,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1526107021, now seen corresponding path program 22 times [2025-04-13 18:25:18,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:18,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994669744] [2025-04-13 18:25:18,862 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:25:18,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:18,867 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:18,877 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:18,877 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:25:18,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:25:19,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:19,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994669744] [2025-04-13 18:25:19,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994669744] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:19,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439460381] [2025-04-13 18:25:19,681 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:25:19,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:19,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:19,683 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:25:19,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-04-13 18:25:19,770 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:19,795 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:19,795 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:25:19,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:19,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 18:25:19,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:19,889 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:25:20,243 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:25:20,243 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:25:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:25:20,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:25:20,546 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 18:25:20,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439460381] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:25:20,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:25:20,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 9] total 40 [2025-04-13 18:25:20,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888859864] [2025-04-13 18:25:20,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:25:20,546 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 18:25:20,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:20,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 18:25:20,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1590, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 18:25:20,547 INFO L87 Difference]: Start difference. First operand 866 states and 2955 transitions. Second operand has 42 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 41 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:23,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:23,634 INFO L93 Difference]: Finished difference Result 1212 states and 3990 transitions. [2025-04-13 18:25:23,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 18:25:23,635 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 41 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:25:23,635 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:23,637 INFO L225 Difference]: With dead ends: 1212 [2025-04-13 18:25:23,637 INFO L226 Difference]: Without dead ends: 1206 [2025-04-13 18:25:23,638 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=598, Invalid=6374, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 18:25:23,638 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 270 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3541 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 3541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:23,638 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 0 Invalid, 3591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 3541 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 18:25:23,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2025-04-13 18:25:23,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 866. [2025-04-13 18:25:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 865 states have (on average 3.4161849710982657) internal successors, (2955), 865 states have internal predecessors, (2955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 2955 transitions. [2025-04-13 18:25:23,651 INFO L79 Accepts]: Start accepts. Automaton has 866 states and 2955 transitions. Word has length 28 [2025-04-13 18:25:23,651 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:23,651 INFO L485 AbstractCegarLoop]: Abstraction has 866 states and 2955 transitions. [2025-04-13 18:25:23,651 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 41 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:23,651 INFO L278 IsEmpty]: Start isEmpty. Operand 866 states and 2955 transitions. [2025-04-13 18:25:23,653 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:25:23,653 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:23,653 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:23,659 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 18:25:23,853 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,SelfDestructingSolverStorable75 [2025-04-13 18:25:23,853 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:25:23,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:23,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1593477577, now seen corresponding path program 23 times [2025-04-13 18:25:23,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:23,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565410735] [2025-04-13 18:25:23,854 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:25:23,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:23,859 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:23,867 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:23,867 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:25:23,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:24,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:25:24,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:24,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565410735] [2025-04-13 18:25:24,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565410735] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:24,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225212882] [2025-04-13 18:25:24,497 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:25:24,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:24,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:24,499 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:25:24,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-04-13 18:25:24,584 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:24,605 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:24,606 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:25:24,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:24,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 18:25:24,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:24,612 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:25:24,651 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:25:24,676 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:25:24,676 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 11 treesize of output 11 [2025-04-13 18:25:24,699 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 18:25:24,722 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:25:25,015 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:25:25,015 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 15 [2025-04-13 18:25:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:25:25,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:25:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:25,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225212882] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:25,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:25:25,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16, 16] total 39 [2025-04-13 18:25:25,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853976658] [2025-04-13 18:25:25,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:25,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:25:25,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:25,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:25:25,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1487, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 18:25:25,258 INFO L87 Difference]: Start difference. First operand 866 states and 2955 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:25,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:25,669 INFO L93 Difference]: Finished difference Result 928 states and 3108 transitions. [2025-04-13 18:25:25,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:25:25,669 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:25:25,669 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:25,671 INFO L225 Difference]: With dead ends: 928 [2025-04-13 18:25:25,672 INFO L226 Difference]: Without dead ends: 922 [2025-04-13 18:25:25,672 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=1802, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 18:25:25,672 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:25,672 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:25:25,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-04-13 18:25:25,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 878. [2025-04-13 18:25:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 3.403648802736602) internal successors, (2985), 877 states have internal predecessors, (2985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 2985 transitions. [2025-04-13 18:25:25,684 INFO L79 Accepts]: Start accepts. Automaton has 878 states and 2985 transitions. Word has length 28 [2025-04-13 18:25:25,684 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:25,684 INFO L485 AbstractCegarLoop]: Abstraction has 878 states and 2985 transitions. [2025-04-13 18:25:25,684 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:25,684 INFO L278 IsEmpty]: Start isEmpty. Operand 878 states and 2985 transitions. [2025-04-13 18:25:25,685 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:25:25,685 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:25,685 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:25,691 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 18:25:25,886 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:25,886 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:25:25,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:25,886 INFO L85 PathProgramCache]: Analyzing trace with hash 748160953, now seen corresponding path program 24 times [2025-04-13 18:25:25,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:25,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056063492] [2025-04-13 18:25:25,886 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:25:25,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:25,892 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:25,901 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:25,902 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:25:25,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:26,273 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 18:25:26,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:26,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056063492] [2025-04-13 18:25:26,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056063492] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:26,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29008139] [2025-04-13 18:25:26,274 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:25:26,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:26,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:26,276 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:25:26,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-04-13 18:25:26,365 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:26,385 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:26,385 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:25:26,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:26,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:25:26,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:26,728 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:25:26,729 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:25:26,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:25:26,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:25:27,024 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:25:27,024 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 33 treesize of output 78 [2025-04-13 18:25:27,116 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 18:25:27,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29008139] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:25:27,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:25:27,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 34 [2025-04-13 18:25:27,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827850490] [2025-04-13 18:25:27,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:25:27,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 18:25:27,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:27,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 18:25:27,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1082, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:25:27,117 INFO L87 Difference]: Start difference. First operand 878 states and 2985 transitions. Second operand has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:29,421 INFO L93 Difference]: Finished difference Result 1542 states and 5069 transitions. [2025-04-13 18:25:29,421 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 18:25:29,421 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:25:29,421 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:29,424 INFO L225 Difference]: With dead ends: 1542 [2025-04-13 18:25:29,425 INFO L226 Difference]: Without dead ends: 1536 [2025-04-13 18:25:29,425 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1806 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=787, Invalid=5065, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 18:25:29,425 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 298 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2583 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:29,425 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 0 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2583 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:25:29,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2025-04-13 18:25:29,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 914. [2025-04-13 18:25:29,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 913 states have (on average 3.4238773274917853) internal successors, (3126), 913 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:29,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 3126 transitions. [2025-04-13 18:25:29,441 INFO L79 Accepts]: Start accepts. Automaton has 914 states and 3126 transitions. Word has length 28 [2025-04-13 18:25:29,441 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:29,441 INFO L485 AbstractCegarLoop]: Abstraction has 914 states and 3126 transitions. [2025-04-13 18:25:29,441 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:29,441 INFO L278 IsEmpty]: Start isEmpty. Operand 914 states and 3126 transitions. [2025-04-13 18:25:29,442 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:25:29,442 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:29,442 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:29,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2025-04-13 18:25:29,643 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:29,643 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:25:29,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:29,643 INFO L85 PathProgramCache]: Analyzing trace with hash -30641233, now seen corresponding path program 25 times [2025-04-13 18:25:29,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:29,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488029472] [2025-04-13 18:25:29,644 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:25:29,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:29,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:25:29,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:29,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:29,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:25:30,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:30,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488029472] [2025-04-13 18:25:30,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488029472] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:30,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401699191] [2025-04-13 18:25:30,426 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:25:30,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:30,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:30,428 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:25:30,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2025-04-13 18:25:30,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:25:30,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:30,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:30,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:30,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 18:25:30,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:30,546 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:25:30,589 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:25:30,610 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:25:30,610 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 18:25:30,633 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 18:25:30,660 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:25:31,007 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:25:31,007 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 15 [2025-04-13 18:25:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:25:31,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:25:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:31,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401699191] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:31,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:25:31,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17, 16] total 41 [2025-04-13 18:25:31,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796833210] [2025-04-13 18:25:31,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:31,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:25:31,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:31,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:25:31,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1653, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:25:31,306 INFO L87 Difference]: Start difference. First operand 914 states and 3126 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:31,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:31,750 INFO L93 Difference]: Finished difference Result 968 states and 3259 transitions. [2025-04-13 18:25:31,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:25:31,751 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:25:31,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:31,753 INFO L225 Difference]: With dead ends: 968 [2025-04-13 18:25:31,753 INFO L226 Difference]: Without dead ends: 962 [2025-04-13 18:25:31,753 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=173, Invalid=1897, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 18:25:31,753 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:31,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:25:31,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-04-13 18:25:31,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 914. [2025-04-13 18:25:31,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 913 states have (on average 3.4238773274917853) internal successors, (3126), 913 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:31,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 3126 transitions. [2025-04-13 18:25:31,766 INFO L79 Accepts]: Start accepts. Automaton has 914 states and 3126 transitions. Word has length 28 [2025-04-13 18:25:31,766 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:31,766 INFO L485 AbstractCegarLoop]: Abstraction has 914 states and 3126 transitions. [2025-04-13 18:25:31,766 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:31,766 INFO L278 IsEmpty]: Start isEmpty. Operand 914 states and 3126 transitions. [2025-04-13 18:25:31,767 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:25:31,767 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:31,767 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:31,774 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 18:25:31,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2025-04-13 18:25:31,968 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:25:31,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:31,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1018730503, now seen corresponding path program 26 times [2025-04-13 18:25:31,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:31,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993718729] [2025-04-13 18:25:31,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:25:31,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:31,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:31,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:31,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:25:31,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:32,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:25:32,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:32,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993718729] [2025-04-13 18:25:32,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993718729] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:32,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334361444] [2025-04-13 18:25:32,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:25:32,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:32,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:32,560 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:25:32,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2025-04-13 18:25:32,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:32,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:32,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:25:32,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:32,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:25:32,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:33,073 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:25:33,073 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:25:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:25:33,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:25:33,351 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:25:33,351 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 33 treesize of output 78 [2025-04-13 18:25:33,460 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 18:25:33,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334361444] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:25:33,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:25:33,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 35 [2025-04-13 18:25:33,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184336364] [2025-04-13 18:25:33,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:25:33,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 18:25:33,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:33,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 18:25:33,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1159, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:25:33,461 INFO L87 Difference]: Start difference. First operand 914 states and 3126 transitions. Second operand has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 36 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:36,072 INFO L93 Difference]: Finished difference Result 1514 states and 4995 transitions. [2025-04-13 18:25:36,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 18:25:36,073 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 36 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:25:36,073 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:36,076 INFO L225 Difference]: With dead ends: 1514 [2025-04-13 18:25:36,076 INFO L226 Difference]: Without dead ends: 1508 [2025-04-13 18:25:36,076 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=864, Invalid=5616, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 18:25:36,076 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 326 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2448 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 2448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:36,076 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 0 Invalid, 2579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 2448 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:25:36,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-04-13 18:25:36,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 914. [2025-04-13 18:25:36,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 913 states have (on average 3.4238773274917853) internal successors, (3126), 913 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 3126 transitions. [2025-04-13 18:25:36,092 INFO L79 Accepts]: Start accepts. Automaton has 914 states and 3126 transitions. Word has length 28 [2025-04-13 18:25:36,092 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:36,092 INFO L485 AbstractCegarLoop]: Abstraction has 914 states and 3126 transitions. [2025-04-13 18:25:36,092 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 36 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:36,092 INFO L278 IsEmpty]: Start isEmpty. Operand 914 states and 3126 transitions. [2025-04-13 18:25:36,093 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:25:36,093 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:36,093 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:36,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2025-04-13 18:25:36,293 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,SelfDestructingSolverStorable79 [2025-04-13 18:25:36,294 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:25:36,294 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:36,294 INFO L85 PathProgramCache]: Analyzing trace with hash 333966653, now seen corresponding path program 27 times [2025-04-13 18:25:36,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:36,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324314408] [2025-04-13 18:25:36,294 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:25:36,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:36,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:36,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 18:25:36,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:25:36,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:36,758 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:36,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:36,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324314408] [2025-04-13 18:25:36,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324314408] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:36,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:36,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 18:25:36,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385013239] [2025-04-13 18:25:36,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:36,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:25:36,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:36,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:25:36,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:25:36,759 INFO L87 Difference]: Start difference. First operand 914 states and 3126 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:37,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:37,163 INFO L93 Difference]: Finished difference Result 978 states and 3312 transitions. [2025-04-13 18:25:37,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:25:37,163 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:25:37,163 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:37,166 INFO L225 Difference]: With dead ends: 978 [2025-04-13 18:25:37,166 INFO L226 Difference]: Without dead ends: 972 [2025-04-13 18:25:37,166 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:25:37,166 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:37,166 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:25:37,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2025-04-13 18:25:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 912. [2025-04-13 18:25:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 911 states have (on average 3.4193194291986826) internal successors, (3115), 911 states have internal predecessors, (3115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 3115 transitions. [2025-04-13 18:25:37,186 INFO L79 Accepts]: Start accepts. Automaton has 912 states and 3115 transitions. Word has length 28 [2025-04-13 18:25:37,186 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:37,186 INFO L485 AbstractCegarLoop]: Abstraction has 912 states and 3115 transitions. [2025-04-13 18:25:37,187 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:37,187 INFO L278 IsEmpty]: Start isEmpty. Operand 912 states and 3115 transitions. [2025-04-13 18:25:37,188 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:25:37,188 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:37,188 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:37,188 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-04-13 18:25:37,188 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:25:37,188 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:37,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1345497611, now seen corresponding path program 28 times [2025-04-13 18:25:37,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:37,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998025344] [2025-04-13 18:25:37,188 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:25:37,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:37,194 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:37,202 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:37,203 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:25:37,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:37,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:37,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:37,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998025344] [2025-04-13 18:25:37,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998025344] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:37,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340205916] [2025-04-13 18:25:37,608 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:25:37,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:37,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:37,610 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:25:37,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2025-04-13 18:25:37,703 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:37,726 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:37,727 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:25:37,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:37,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 18:25:37,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:37,794 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:25:38,079 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:25:38,079 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:25:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:25:38,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:25:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:38,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340205916] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:25:38,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:25:38,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 9] total 32 [2025-04-13 18:25:38,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802391628] [2025-04-13 18:25:38,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:25:38,334 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:25:38,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:38,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:25:38,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:25:38,334 INFO L87 Difference]: Start difference. First operand 912 states and 3115 transitions. Second operand has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:41,215 INFO L93 Difference]: Finished difference Result 1382 states and 4587 transitions. [2025-04-13 18:25:41,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-04-13 18:25:41,215 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:25:41,215 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:41,218 INFO L225 Difference]: With dead ends: 1382 [2025-04-13 18:25:41,218 INFO L226 Difference]: Without dead ends: 1376 [2025-04-13 18:25:41,219 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=618, Invalid=6188, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 18:25:41,219 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 287 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3510 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:41,219 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 0 Invalid, 3574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3510 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 18:25:41,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2025-04-13 18:25:41,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 966. [2025-04-13 18:25:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 3.4259067357512953) internal successors, (3306), 965 states have internal predecessors, (3306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 3306 transitions. [2025-04-13 18:25:41,233 INFO L79 Accepts]: Start accepts. Automaton has 966 states and 3306 transitions. Word has length 28 [2025-04-13 18:25:41,233 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:41,233 INFO L485 AbstractCegarLoop]: Abstraction has 966 states and 3306 transitions. [2025-04-13 18:25:41,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:41,233 INFO L278 IsEmpty]: Start isEmpty. Operand 966 states and 3306 transitions. [2025-04-13 18:25:41,235 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:25:41,235 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:41,235 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:41,242 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 18:25:41,435 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:41,435 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:25:41,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:41,436 INFO L85 PathProgramCache]: Analyzing trace with hash 507214345, now seen corresponding path program 29 times [2025-04-13 18:25:41,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:41,436 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23788595] [2025-04-13 18:25:41,436 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:25:41,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:41,441 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:41,450 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:41,450 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:25:41,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:25:41,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:41,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23788595] [2025-04-13 18:25:41,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23788595] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:41,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413551449] [2025-04-13 18:25:41,990 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:25:41,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:41,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:41,992 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:25:41,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-04-13 18:25:42,083 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:42,105 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:42,105 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:25:42,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:42,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 18:25:42,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:42,111 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:25:42,148 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:25:42,174 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:25:42,175 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 18:25:42,198 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 18:25:42,222 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:25:42,545 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:25:42,545 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 15 [2025-04-13 18:25:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:25:42,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:25:42,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:42,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413551449] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:42,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:25:42,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14, 16] total 37 [2025-04-13 18:25:42,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266349307] [2025-04-13 18:25:42,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:42,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:25:42,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:42,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:25:42,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:25:42,827 INFO L87 Difference]: Start difference. First operand 966 states and 3306 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:43,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:43,272 INFO L93 Difference]: Finished difference Result 1028 states and 3463 transitions. [2025-04-13 18:25:43,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:25:43,273 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:25:43,273 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:43,275 INFO L225 Difference]: With dead ends: 1028 [2025-04-13 18:25:43,275 INFO L226 Difference]: Without dead ends: 1022 [2025-04-13 18:25:43,275 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=1570, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 18:25:43,275 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:43,276 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:25:43,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2025-04-13 18:25:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 968. [2025-04-13 18:25:43,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 967 states have (on average 3.426059979317477) internal successors, (3313), 967 states have internal predecessors, (3313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:43,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 3313 transitions. [2025-04-13 18:25:43,288 INFO L79 Accepts]: Start accepts. Automaton has 968 states and 3313 transitions. Word has length 28 [2025-04-13 18:25:43,288 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:43,288 INFO L485 AbstractCegarLoop]: Abstraction has 968 states and 3313 transitions. [2025-04-13 18:25:43,288 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:43,288 INFO L278 IsEmpty]: Start isEmpty. Operand 968 states and 3313 transitions. [2025-04-13 18:25:43,289 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:25:43,289 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:43,289 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:43,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2025-04-13 18:25:43,490 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:43,490 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:25:43,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:43,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1981783199, now seen corresponding path program 30 times [2025-04-13 18:25:43,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:43,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272010480] [2025-04-13 18:25:43,490 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:25:43,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:43,496 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:43,507 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:43,507 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:25:43,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:43,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:43,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:43,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272010480] [2025-04-13 18:25:43,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272010480] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:43,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029537607] [2025-04-13 18:25:43,957 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:25:43,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:43,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:43,959 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:25:43,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-04-13 18:25:44,052 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:44,073 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:44,073 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:25:44,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:44,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:25:44,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:44,435 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:25:44,435 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:25:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:25:44,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:25:44,723 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:25:44,723 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 33 treesize of output 78 [2025-04-13 18:25:44,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:44,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029537607] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:25:44,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:25:44,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 33 [2025-04-13 18:25:44,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590205359] [2025-04-13 18:25:44,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:25:44,798 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:25:44,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:44,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:25:44,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:25:44,799 INFO L87 Difference]: Start difference. First operand 968 states and 3313 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:46,940 INFO L93 Difference]: Finished difference Result 1464 states and 4868 transitions. [2025-04-13 18:25:46,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-13 18:25:46,940 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:25:46,940 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:46,943 INFO L225 Difference]: With dead ends: 1464 [2025-04-13 18:25:46,943 INFO L226 Difference]: Without dead ends: 1458 [2025-04-13 18:25:46,944 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1785 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=810, Invalid=5196, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 18:25:46,944 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 295 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2163 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:46,944 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 0 Invalid, 2235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2163 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:25:46,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2025-04-13 18:25:46,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 990. [2025-04-13 18:25:46,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 989 states have (on average 3.429726996966633) internal successors, (3392), 989 states have internal predecessors, (3392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 3392 transitions. [2025-04-13 18:25:46,959 INFO L79 Accepts]: Start accepts. Automaton has 990 states and 3392 transitions. Word has length 28 [2025-04-13 18:25:46,960 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:46,960 INFO L485 AbstractCegarLoop]: Abstraction has 990 states and 3392 transitions. [2025-04-13 18:25:46,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:46,960 INFO L278 IsEmpty]: Start isEmpty. Operand 990 states and 3392 transitions. [2025-04-13 18:25:46,961 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:25:46,961 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:46,961 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:46,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2025-04-13 18:25:47,161 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,SelfDestructingSolverStorable83 [2025-04-13 18:25:47,162 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:25:47,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:47,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1927632291, now seen corresponding path program 31 times [2025-04-13 18:25:47,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:47,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316125805] [2025-04-13 18:25:47,162 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:25:47,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:47,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:25:47,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:47,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:47,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:25:47,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:47,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316125805] [2025-04-13 18:25:47,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316125805] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:47,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134535773] [2025-04-13 18:25:47,936 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:25:47,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:47,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:47,938 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:25:47,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-04-13 18:25:48,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:25:48,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:48,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:48,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:48,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 18:25:48,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:48,061 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:25:48,102 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:25:48,125 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:25:48,125 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 11 treesize of output 11 [2025-04-13 18:25:48,149 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 18:25:48,170 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:25:48,527 INFO L325 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2025-04-13 18:25:48,527 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 31 [2025-04-13 18:25:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:25:48,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:25:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:48,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134535773] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:25:48,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:25:48,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 10] total 41 [2025-04-13 18:25:48,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269372643] [2025-04-13 18:25:48,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:25:48,887 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 18:25:48,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:48,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 18:25:48,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1634, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:25:48,888 INFO L87 Difference]: Start difference. First operand 990 states and 3392 transitions. Second operand has 43 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 42 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:51,366 INFO L93 Difference]: Finished difference Result 1321 states and 4431 transitions. [2025-04-13 18:25:51,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 18:25:51,366 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 42 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:25:51,367 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:51,369 INFO L225 Difference]: With dead ends: 1321 [2025-04-13 18:25:51,369 INFO L226 Difference]: Without dead ends: 1315 [2025-04-13 18:25:51,370 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1441 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=542, Invalid=5938, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 18:25:51,370 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 229 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3077 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 3077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:51,370 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 0 Invalid, 3161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 3077 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 18:25:51,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2025-04-13 18:25:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1008. [2025-04-13 18:25:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1007 states have (on average 3.4409136047666338) internal successors, (3465), 1007 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 3465 transitions. [2025-04-13 18:25:51,385 INFO L79 Accepts]: Start accepts. Automaton has 1008 states and 3465 transitions. Word has length 28 [2025-04-13 18:25:51,385 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:51,385 INFO L485 AbstractCegarLoop]: Abstraction has 1008 states and 3465 transitions. [2025-04-13 18:25:51,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 42 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:51,385 INFO L278 IsEmpty]: Start isEmpty. Operand 1008 states and 3465 transitions. [2025-04-13 18:25:51,387 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:25:51,387 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:51,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:51,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2025-04-13 18:25:51,587 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:51,587 INFO L403 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:25:51,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:51,588 INFO L85 PathProgramCache]: Analyzing trace with hash -265223431, now seen corresponding path program 32 times [2025-04-13 18:25:51,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:51,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820027813] [2025-04-13 18:25:51,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:25:51,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:51,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:51,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:51,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:25:51,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:52,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:52,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820027813] [2025-04-13 18:25:52,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820027813] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:52,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140871909] [2025-04-13 18:25:52,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:25:52,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:52,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:52,030 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:25:52,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-04-13 18:25:52,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:52,148 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:52,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:25:52,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:52,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:25:52,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:52,583 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:25:52,583 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:25:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:25:52,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:25:52,947 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:25:52,947 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 33 treesize of output 78 [2025-04-13 18:25:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:53,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140871909] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:25:53,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:25:53,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 34 [2025-04-13 18:25:53,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510978579] [2025-04-13 18:25:53,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:25:53,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 18:25:53,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:53,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 18:25:53,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1087, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:25:53,024 INFO L87 Difference]: Start difference. First operand 1008 states and 3465 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:55,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:55,014 INFO L93 Difference]: Finished difference Result 1471 states and 4942 transitions. [2025-04-13 18:25:55,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 18:25:55,014 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:25:55,014 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:55,017 INFO L225 Difference]: With dead ends: 1471 [2025-04-13 18:25:55,017 INFO L226 Difference]: Without dead ends: 1465 [2025-04-13 18:25:55,018 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=776, Invalid=4194, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 18:25:55,018 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 262 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:55,018 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 0 Invalid, 2157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2068 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:25:55,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2025-04-13 18:25:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1008. [2025-04-13 18:25:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1007 states have (on average 3.434955312810328) internal successors, (3459), 1007 states have internal predecessors, (3459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:55,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 3459 transitions. [2025-04-13 18:25:55,033 INFO L79 Accepts]: Start accepts. Automaton has 1008 states and 3459 transitions. Word has length 28 [2025-04-13 18:25:55,034 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:55,034 INFO L485 AbstractCegarLoop]: Abstraction has 1008 states and 3459 transitions. [2025-04-13 18:25:55,034 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:55,034 INFO L278 IsEmpty]: Start isEmpty. Operand 1008 states and 3459 transitions. [2025-04-13 18:25:55,035 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:25:55,035 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:55,035 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:55,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2025-04-13 18:25:55,235 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:55,236 INFO L403 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:25:55,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:55,236 INFO L85 PathProgramCache]: Analyzing trace with hash -82674487, now seen corresponding path program 33 times [2025-04-13 18:25:55,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:55,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573156683] [2025-04-13 18:25:55,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:25:55,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:55,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:55,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 18:25:55,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:25:55,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:55,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:55,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:55,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573156683] [2025-04-13 18:25:55,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573156683] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:55,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:55,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 18:25:55,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026494604] [2025-04-13 18:25:55,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:55,638 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:25:55,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:55,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:25:55,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:25:55,639 INFO L87 Difference]: Start difference. First operand 1008 states and 3459 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:55,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:55,934 INFO L93 Difference]: Finished difference Result 1072 states and 3640 transitions. [2025-04-13 18:25:55,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:25:55,934 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:25:55,935 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:55,937 INFO L225 Difference]: With dead ends: 1072 [2025-04-13 18:25:55,937 INFO L226 Difference]: Without dead ends: 1066 [2025-04-13 18:25:55,937 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:25:55,937 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:55,937 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:25:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-04-13 18:25:55,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1004. [2025-04-13 18:25:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 1003 states have (on average 3.4307078763708874) internal successors, (3441), 1003 states have internal predecessors, (3441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 3441 transitions. [2025-04-13 18:25:55,952 INFO L79 Accepts]: Start accepts. Automaton has 1004 states and 3441 transitions. Word has length 28 [2025-04-13 18:25:55,952 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:55,952 INFO L485 AbstractCegarLoop]: Abstraction has 1004 states and 3441 transitions. [2025-04-13 18:25:55,952 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:55,952 INFO L278 IsEmpty]: Start isEmpty. Operand 1004 states and 3441 transitions. [2025-04-13 18:25:55,953 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:25:55,953 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:55,953 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:55,953 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-04-13 18:25:55,953 INFO L403 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:25:55,954 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:55,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1189416745, now seen corresponding path program 34 times [2025-04-13 18:25:55,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:55,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22220219] [2025-04-13 18:25:55,954 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:25:55,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:55,959 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:55,967 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:55,967 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:25:55,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:56,378 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:56,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:56,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22220219] [2025-04-13 18:25:56,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22220219] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:25:56,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425575255] [2025-04-13 18:25:56,379 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:25:56,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:56,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:56,380 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:25:56,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-04-13 18:25:56,484 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:56,510 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:56,511 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:25:56,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:56,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 18:25:56,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:25:56,582 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:25:56,852 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:25:56,852 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:25:56,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:25:56,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:25:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:25:57,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425575255] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:25:57,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:25:57,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 9] total 33 [2025-04-13 18:25:57,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591991343] [2025-04-13 18:25:57,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:25:57,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:25:57,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:57,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:25:57,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1059, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:25:57,084 INFO L87 Difference]: Start difference. First operand 1004 states and 3441 transitions. Second operand has 35 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:59,655 INFO L93 Difference]: Finished difference Result 1373 states and 4550 transitions. [2025-04-13 18:25:59,655 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 18:25:59,655 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:25:59,655 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:59,658 INFO L225 Difference]: With dead ends: 1373 [2025-04-13 18:25:59,658 INFO L226 Difference]: Without dead ends: 1362 [2025-04-13 18:25:59,658 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1626 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=581, Invalid=5425, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 18:25:59,659 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 257 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3263 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:59,659 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 0 Invalid, 3324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3263 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:25:59,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2025-04-13 18:25:59,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1006. [2025-04-13 18:25:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 1005 states have (on average 3.433830845771144) internal successors, (3451), 1005 states have internal predecessors, (3451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3451 transitions. [2025-04-13 18:25:59,673 INFO L79 Accepts]: Start accepts. Automaton has 1006 states and 3451 transitions. Word has length 28 [2025-04-13 18:25:59,673 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:59,673 INFO L485 AbstractCegarLoop]: Abstraction has 1006 states and 3451 transitions. [2025-04-13 18:25:59,673 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:59,673 INFO L278 IsEmpty]: Start isEmpty. Operand 1006 states and 3451 transitions. [2025-04-13 18:25:59,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:25:59,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:59,675 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:59,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2025-04-13 18:25:59,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:25:59,875 INFO L403 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:25:59,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:59,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1651195677, now seen corresponding path program 35 times [2025-04-13 18:25:59,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:59,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652325400] [2025-04-13 18:25:59,876 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:25:59,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:59,881 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:25:59,889 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:25:59,889 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:25:59,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:26:00,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:26:00,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652325400] [2025-04-13 18:26:00,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652325400] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:26:00,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337372073] [2025-04-13 18:26:00,593 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:26:00,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:26:00,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:26:00,595 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:26:00,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-04-13 18:26:00,689 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:26:00,711 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:26:00,711 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:26:00,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:00,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 18:26:00,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:26:00,715 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:26:00,755 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:26:00,775 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:26:00,775 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 11 treesize of output 11 [2025-04-13 18:26:00,796 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 18:26:00,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:26:01,131 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:26:01,131 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 15 [2025-04-13 18:26:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:26:01,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:26:01,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:26:01,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337372073] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:26:01,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:26:01,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15, 16] total 38 [2025-04-13 18:26:01,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879573307] [2025-04-13 18:26:01,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:26:01,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:26:01,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:26:01,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:26:01,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1428, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 18:26:01,402 INFO L87 Difference]: Start difference. First operand 1006 states and 3451 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:01,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:26:01,846 INFO L93 Difference]: Finished difference Result 1054 states and 3569 transitions. [2025-04-13 18:26:01,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:26:01,847 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:26:01,847 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:26:01,849 INFO L225 Difference]: With dead ends: 1054 [2025-04-13 18:26:01,849 INFO L226 Difference]: Without dead ends: 1048 [2025-04-13 18:26:01,849 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=159, Invalid=1733, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 18:26:01,850 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:26:01,850 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:26:01,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2025-04-13 18:26:01,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 990. [2025-04-13 18:26:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 989 states have (on average 3.4448938321536904) internal successors, (3407), 989 states have internal predecessors, (3407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 3407 transitions. [2025-04-13 18:26:01,862 INFO L79 Accepts]: Start accepts. Automaton has 990 states and 3407 transitions. Word has length 28 [2025-04-13 18:26:01,862 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:26:01,862 INFO L485 AbstractCegarLoop]: Abstraction has 990 states and 3407 transitions. [2025-04-13 18:26:01,862 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:01,862 INFO L278 IsEmpty]: Start isEmpty. Operand 990 states and 3407 transitions. [2025-04-13 18:26:01,864 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:26:01,864 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:26:01,864 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:26:01,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2025-04-13 18:26:02,064 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:26:02,064 INFO L403 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:26:02,064 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:26:02,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1458604709, now seen corresponding path program 36 times [2025-04-13 18:26:02,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:26:02,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237078414] [2025-04-13 18:26:02,065 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:26:02,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:26:02,070 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:26:02,080 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:26:02,080 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:26:02,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:26:02,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:26:02,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237078414] [2025-04-13 18:26:02,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237078414] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:26:02,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015539321] [2025-04-13 18:26:02,794 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:26:02,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:26:02,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:26:02,796 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:26:02,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-04-13 18:26:02,893 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:26:02,915 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:26:02,915 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:26:02,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:02,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 18:26:02,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:26:03,283 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:26:03,283 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:26:03,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:26:03,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:26:03,578 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:26:03,579 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 33 treesize of output 78 [2025-04-13 18:26:03,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:26:03,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015539321] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:26:03,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:26:03,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 10] total 35 [2025-04-13 18:26:03,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731467847] [2025-04-13 18:26:03,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:26:03,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 18:26:03,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:26:03,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 18:26:03,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1158, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:26:03,668 INFO L87 Difference]: Start difference. First operand 990 states and 3407 transitions. Second operand has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:26:06,419 INFO L93 Difference]: Finished difference Result 1301 states and 4347 transitions. [2025-04-13 18:26:06,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-04-13 18:26:06,419 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:26:06,419 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:26:06,422 INFO L225 Difference]: With dead ends: 1301 [2025-04-13 18:26:06,422 INFO L226 Difference]: Without dead ends: 1295 [2025-04-13 18:26:06,422 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=667, Invalid=4445, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 18:26:06,423 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 250 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3304 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:26:06,423 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 0 Invalid, 3360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3304 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:26:06,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2025-04-13 18:26:06,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 980. [2025-04-13 18:26:06,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.442288049029622) internal successors, (3370), 979 states have internal predecessors, (3370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3370 transitions. [2025-04-13 18:26:06,446 INFO L79 Accepts]: Start accepts. Automaton has 980 states and 3370 transitions. Word has length 28 [2025-04-13 18:26:06,446 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:26:06,446 INFO L485 AbstractCegarLoop]: Abstraction has 980 states and 3370 transitions. [2025-04-13 18:26:06,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:06,447 INFO L278 IsEmpty]: Start isEmpty. Operand 980 states and 3370 transitions. [2025-04-13 18:26:06,448 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:26:06,448 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:26:06,448 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:26:06,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2025-04-13 18:26:06,648 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2025-04-13 18:26:06,648 INFO L403 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:26:06,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:26:06,649 INFO L85 PathProgramCache]: Analyzing trace with hash -246231439, now seen corresponding path program 37 times [2025-04-13 18:26:06,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:26:06,649 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815717117] [2025-04-13 18:26:06,649 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:26:06,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:26:06,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:26:06,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:26:06,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:26:06,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:26:07,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:26:07,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815717117] [2025-04-13 18:26:07,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815717117] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:26:07,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341184891] [2025-04-13 18:26:07,430 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:26:07,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:26:07,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:26:07,432 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:26:07,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-04-13 18:26:07,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:26:07,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:26:07,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:26:07,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:07,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 18:26:07,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:26:07,562 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:26:07,606 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:26:07,627 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:26:07,627 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 11 treesize of output 11 [2025-04-13 18:26:07,652 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 18:26:07,673 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:26:08,001 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:26:08,001 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 15 [2025-04-13 18:26:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:26:08,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:26:08,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:26:08,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341184891] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:26:08,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:26:08,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 10] total 41 [2025-04-13 18:26:08,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165294276] [2025-04-13 18:26:08,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:26:08,300 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 18:26:08,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:26:08,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 18:26:08,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1640, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:26:08,301 INFO L87 Difference]: Start difference. First operand 980 states and 3370 transitions. Second operand has 43 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:26:10,604 INFO L93 Difference]: Finished difference Result 1484 states and 5049 transitions. [2025-04-13 18:26:10,605 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 18:26:10,605 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 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 28 [2025-04-13 18:26:10,605 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:26:10,608 INFO L225 Difference]: With dead ends: 1484 [2025-04-13 18:26:10,608 INFO L226 Difference]: Without dead ends: 1393 [2025-04-13 18:26:10,608 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=507, Invalid=4749, Unknown=0, NotChecked=0, Total=5256 [2025-04-13 18:26:10,608 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 289 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3447 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:26:10,609 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 0 Invalid, 3479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3447 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:26:10,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2025-04-13 18:26:10,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1034. [2025-04-13 18:26:10,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 3.447241045498548) internal successors, (3561), 1033 states have internal predecessors, (3561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:10,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 3561 transitions. [2025-04-13 18:26:10,623 INFO L79 Accepts]: Start accepts. Automaton has 1034 states and 3561 transitions. Word has length 28 [2025-04-13 18:26:10,624 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:26:10,624 INFO L485 AbstractCegarLoop]: Abstraction has 1034 states and 3561 transitions. [2025-04-13 18:26:10,624 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:10,624 INFO L278 IsEmpty]: Start isEmpty. Operand 1034 states and 3561 transitions. [2025-04-13 18:26:10,625 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:26:10,625 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:26:10,625 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:26:10,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2025-04-13 18:26:10,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:26:10,826 INFO L403 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:26:10,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:26:10,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1706819585, now seen corresponding path program 38 times [2025-04-13 18:26:10,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:26:10,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640653010] [2025-04-13 18:26:10,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:26:10,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:26:10,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:26:10,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:26:10,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:26:10,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:26:11,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:26:11,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640653010] [2025-04-13 18:26:11,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640653010] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:26:11,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240886088] [2025-04-13 18:26:11,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:26:11,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:26:11,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:26:11,225 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:26:11,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-04-13 18:26:11,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:26:11,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:26:11,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:26:11,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:11,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:26:11,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:26:11,689 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:26:11,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:26:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:26:11,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:26:11,937 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:26:11,937 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 33 treesize of output 78 [2025-04-13 18:26:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:26:12,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240886088] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:26:12,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:26:12,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 10] total 32 [2025-04-13 18:26:12,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396922125] [2025-04-13 18:26:12,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:26:12,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:26:12,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:26:12,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:26:12,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:26:12,006 INFO L87 Difference]: Start difference. First operand 1034 states and 3561 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:14,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:26:14,742 INFO L93 Difference]: Finished difference Result 1542 states and 5161 transitions. [2025-04-13 18:26:14,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-04-13 18:26:14,743 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:26:14,743 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:26:14,746 INFO L225 Difference]: With dead ends: 1542 [2025-04-13 18:26:14,746 INFO L226 Difference]: Without dead ends: 1536 [2025-04-13 18:26:14,747 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2464 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1067, Invalid=6765, Unknown=0, NotChecked=0, Total=7832 [2025-04-13 18:26:14,747 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 232 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2855 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:26:14,747 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 0 Invalid, 2939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2855 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:26:14,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2025-04-13 18:26:14,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1064. [2025-04-13 18:26:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 1063 states have (on average 3.448730009407338) internal successors, (3666), 1063 states have internal predecessors, (3666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:14,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 3666 transitions. [2025-04-13 18:26:14,764 INFO L79 Accepts]: Start accepts. Automaton has 1064 states and 3666 transitions. Word has length 28 [2025-04-13 18:26:14,765 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:26:14,765 INFO L485 AbstractCegarLoop]: Abstraction has 1064 states and 3666 transitions. [2025-04-13 18:26:14,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:14,765 INFO L278 IsEmpty]: Start isEmpty. Operand 1064 states and 3666 transitions. [2025-04-13 18:26:14,766 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:26:14,766 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:26:14,766 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:26:14,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2025-04-13 18:26:14,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:26:14,967 INFO L403 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:26:14,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:26:14,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1268624983, now seen corresponding path program 39 times [2025-04-13 18:26:14,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:26:14,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748172183] [2025-04-13 18:26:14,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:26:14,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:26:14,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:26:14,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:26:14,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:26:14,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:26:15,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:26:15,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748172183] [2025-04-13 18:26:15,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748172183] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:26:15,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59907269] [2025-04-13 18:26:15,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:26:15,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:26:15,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:26:15,397 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:26:15,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2025-04-13 18:26:15,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:26:15,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:26:15,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:26:15,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:15,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:26:15,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:26:15,895 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:26:15,895 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:26:15,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:26:15,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:26:16,130 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:26:16,130 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 33 treesize of output 78 [2025-04-13 18:26:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:26:16,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59907269] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:26:16,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:26:16,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 10] total 33 [2025-04-13 18:26:16,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938753476] [2025-04-13 18:26:16,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:26:16,203 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:26:16,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:26:16,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:26:16,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:26:16,203 INFO L87 Difference]: Start difference. First operand 1064 states and 3666 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:26:18,029 INFO L93 Difference]: Finished difference Result 1334 states and 4519 transitions. [2025-04-13 18:26:18,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-13 18:26:18,030 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:26:18,030 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:26:18,033 INFO L225 Difference]: With dead ends: 1334 [2025-04-13 18:26:18,033 INFO L226 Difference]: Without dead ends: 1328 [2025-04-13 18:26:18,033 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=576, Invalid=3714, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 18:26:18,033 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 243 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2115 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:26:18,034 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 0 Invalid, 2171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2115 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:26:18,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2025-04-13 18:26:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1052. [2025-04-13 18:26:18,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 3.4519505233111323) internal successors, (3628), 1051 states have internal predecessors, (3628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 3628 transitions. [2025-04-13 18:26:18,048 INFO L79 Accepts]: Start accepts. Automaton has 1052 states and 3628 transitions. Word has length 28 [2025-04-13 18:26:18,048 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:26:18,048 INFO L485 AbstractCegarLoop]: Abstraction has 1052 states and 3628 transitions. [2025-04-13 18:26:18,048 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:18,049 INFO L278 IsEmpty]: Start isEmpty. Operand 1052 states and 3628 transitions. [2025-04-13 18:26:18,050 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:26:18,050 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:26:18,050 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:26:18,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2025-04-13 18:26:18,250 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:26:18,251 INFO L403 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:26:18,251 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:26:18,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1748753231, now seen corresponding path program 40 times [2025-04-13 18:26:18,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:26:18,251 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502388440] [2025-04-13 18:26:18,251 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:26:18,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:26:18,257 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:26:18,265 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:26:18,265 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:26:18,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:18,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:26:18,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:26:18,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502388440] [2025-04-13 18:26:18,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502388440] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:26:18,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390256830] [2025-04-13 18:26:18,926 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:26:18,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:26:18,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:26:18,928 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:26:18,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-04-13 18:26:19,028 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:26:19,054 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:26:19,054 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:26:19,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:19,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 18:26:19,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:26:19,144 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:26:19,491 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:26:19,491 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:26:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:26:19,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:26:19,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:26:19,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390256830] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:26:19,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:26:19,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17, 15] total 39 [2025-04-13 18:26:19,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920029028] [2025-04-13 18:26:19,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:26:19,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:26:19,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:26:19,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:26:19,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1508, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 18:26:19,766 INFO L87 Difference]: Start difference. First operand 1052 states and 3628 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:20,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:26:20,262 INFO L93 Difference]: Finished difference Result 1118 states and 3787 transitions. [2025-04-13 18:26:20,262 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:26:20,262 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:26:20,262 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:26:20,265 INFO L225 Difference]: With dead ends: 1118 [2025-04-13 18:26:20,265 INFO L226 Difference]: Without dead ends: 1112 [2025-04-13 18:26:20,265 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=1825, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 18:26:20,265 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:26:20,265 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:26:20,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-04-13 18:26:20,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1052. [2025-04-13 18:26:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 3.4519505233111323) internal successors, (3628), 1051 states have internal predecessors, (3628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 3628 transitions. [2025-04-13 18:26:20,279 INFO L79 Accepts]: Start accepts. Automaton has 1052 states and 3628 transitions. Word has length 28 [2025-04-13 18:26:20,279 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:26:20,280 INFO L485 AbstractCegarLoop]: Abstraction has 1052 states and 3628 transitions. [2025-04-13 18:26:20,280 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:20,280 INFO L278 IsEmpty]: Start isEmpty. Operand 1052 states and 3628 transitions. [2025-04-13 18:26:20,281 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:26:20,281 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:26:20,281 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:26:20,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2025-04-13 18:26:20,481 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:26:20,482 INFO L403 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:26:20,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:26:20,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1288078749, now seen corresponding path program 41 times [2025-04-13 18:26:20,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:26:20,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619666482] [2025-04-13 18:26:20,482 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:26:20,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:26:20,488 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:26:20,496 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:26:20,496 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:26:20,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:26:21,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:26:21,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619666482] [2025-04-13 18:26:21,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619666482] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:26:21,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911300068] [2025-04-13 18:26:21,246 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:26:21,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:26:21,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:26:21,248 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:26:21,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2025-04-13 18:26:21,352 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:26:21,374 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:26:21,375 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:26:21,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:21,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:26:21,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:26:21,758 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:26:21,758 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:26:21,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:26:21,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:26:22,095 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:26:22,096 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 65 treesize of output 330 [2025-04-13 18:26:53,797 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 18:26:53,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911300068] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:26:53,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:26:53,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 9] total 37 [2025-04-13 18:26:53,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87117677] [2025-04-13 18:26:53,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:26:53,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:26:53,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:26:53,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:26:53,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1337, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:26:53,798 INFO L87 Difference]: Start difference. First operand 1052 states and 3628 transitions. Second operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:55,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:26:55,930 INFO L93 Difference]: Finished difference Result 1377 states and 4620 transitions. [2025-04-13 18:26:55,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 18:26:55,930 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 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 28 [2025-04-13 18:26:55,930 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:26:55,933 INFO L225 Difference]: With dead ends: 1377 [2025-04-13 18:26:55,933 INFO L226 Difference]: Without dead ends: 1371 [2025-04-13 18:26:55,934 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=450, Invalid=3710, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 18:26:55,934 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3354 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:26:55,934 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 0 Invalid, 3392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3354 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:26:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-04-13 18:26:55,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1052. [2025-04-13 18:26:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 3.457659372026641) internal successors, (3634), 1051 states have internal predecessors, (3634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 3634 transitions. [2025-04-13 18:26:55,949 INFO L79 Accepts]: Start accepts. Automaton has 1052 states and 3634 transitions. Word has length 28 [2025-04-13 18:26:55,949 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:26:55,949 INFO L485 AbstractCegarLoop]: Abstraction has 1052 states and 3634 transitions. [2025-04-13 18:26:55,949 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:55,949 INFO L278 IsEmpty]: Start isEmpty. Operand 1052 states and 3634 transitions. [2025-04-13 18:26:55,950 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:26:55,950 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:26:55,951 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:26:55,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2025-04-13 18:26:56,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:26:56,151 INFO L403 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:26:56,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:26:56,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1415907569, now seen corresponding path program 42 times [2025-04-13 18:26:56,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:26:56,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934372408] [2025-04-13 18:26:56,151 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:26:56,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:26:56,157 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:26:56,166 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:26:56,166 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:26:56,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:26:56,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:26:56,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934372408] [2025-04-13 18:26:56,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934372408] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:26:56,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437256757] [2025-04-13 18:26:56,644 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:26:56,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:26:56,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:26:56,646 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:26:56,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2025-04-13 18:26:56,750 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:26:56,771 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:26:56,771 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:26:56,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:56,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:26:56,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:26:57,190 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:26:57,190 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:26:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:26:57,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:26:57,475 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:26:57,475 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 33 treesize of output 78 [2025-04-13 18:26:57,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:26:57,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437256757] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:26:57,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:26:57,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 34 [2025-04-13 18:26:57,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623578198] [2025-04-13 18:26:57,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:26:57,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 18:26:57,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:26:57,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 18:26:57,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:26:57,584 INFO L87 Difference]: Start difference. First operand 1052 states and 3634 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:59,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:26:59,415 INFO L93 Difference]: Finished difference Result 1442 states and 4849 transitions. [2025-04-13 18:26:59,415 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 18:26:59,415 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:26:59,415 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:26:59,418 INFO L225 Difference]: With dead ends: 1442 [2025-04-13 18:26:59,418 INFO L226 Difference]: Without dead ends: 1436 [2025-04-13 18:26:59,418 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1412 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=587, Invalid=4243, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 18:26:59,419 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 238 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:26:59,419 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 0 Invalid, 1756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:26:59,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2025-04-13 18:26:59,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1062. [2025-04-13 18:26:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1061 states have (on average 3.473138548539114) internal successors, (3685), 1061 states have internal predecessors, (3685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:59,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 3685 transitions. [2025-04-13 18:26:59,433 INFO L79 Accepts]: Start accepts. Automaton has 1062 states and 3685 transitions. Word has length 28 [2025-04-13 18:26:59,433 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:26:59,433 INFO L485 AbstractCegarLoop]: Abstraction has 1062 states and 3685 transitions. [2025-04-13 18:26:59,433 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:59,433 INFO L278 IsEmpty]: Start isEmpty. Operand 1062 states and 3685 transitions. [2025-04-13 18:26:59,435 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:26:59,435 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:26:59,435 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:26:59,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2025-04-13 18:26:59,635 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable95 [2025-04-13 18:26:59,635 INFO L403 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:26:59,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:26:59,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1796675045, now seen corresponding path program 43 times [2025-04-13 18:26:59,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:26:59,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954888269] [2025-04-13 18:26:59,636 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:26:59,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:26:59,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:26:59,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:26:59,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:26:59,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:00,322 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:27:00,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:27:00,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954888269] [2025-04-13 18:27:00,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954888269] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:27:00,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108719467] [2025-04-13 18:27:00,323 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:27:00,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:27:00,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:27:00,325 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:27:00,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2025-04-13 18:27:00,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:27:00,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:27:00,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:27:00,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:00,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 18:27:00,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:27:00,461 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:27:00,504 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:27:00,526 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:27:00,526 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 11 treesize of output 11 [2025-04-13 18:27:00,547 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 18:27:00,569 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:27:00,904 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:27:00,904 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 15 [2025-04-13 18:27:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:27:00,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:27:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:27:01,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108719467] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:27:01,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:27:01,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 10] total 40 [2025-04-13 18:27:01,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433676611] [2025-04-13 18:27:01,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:27:01,239 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 18:27:01,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:27:01,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 18:27:01,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1578, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 18:27:01,239 INFO L87 Difference]: Start difference. First operand 1062 states and 3685 transitions. Second operand has 42 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:03,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:27:03,144 INFO L93 Difference]: Finished difference Result 1312 states and 4491 transitions. [2025-04-13 18:27:03,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 18:27:03,144 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:27:03,144 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:27:03,148 INFO L225 Difference]: With dead ends: 1312 [2025-04-13 18:27:03,148 INFO L226 Difference]: Without dead ends: 1306 [2025-04-13 18:27:03,149 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=374, Invalid=4048, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 18:27:03,149 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 183 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:27:03,149 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 0 Invalid, 2600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:27:03,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2025-04-13 18:27:03,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1058. [2025-04-13 18:27:03,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 1057 states have (on average 3.4730368968779564) internal successors, (3671), 1057 states have internal predecessors, (3671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 3671 transitions. [2025-04-13 18:27:03,166 INFO L79 Accepts]: Start accepts. Automaton has 1058 states and 3671 transitions. Word has length 28 [2025-04-13 18:27:03,166 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:27:03,166 INFO L485 AbstractCegarLoop]: Abstraction has 1058 states and 3671 transitions. [2025-04-13 18:27:03,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:03,167 INFO L278 IsEmpty]: Start isEmpty. Operand 1058 states and 3671 transitions. [2025-04-13 18:27:03,168 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:27:03,168 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:27:03,168 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:27:03,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2025-04-13 18:27:03,369 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:27:03,369 INFO L403 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:27:03,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:27:03,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1933227825, now seen corresponding path program 44 times [2025-04-13 18:27:03,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:27:03,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126946898] [2025-04-13 18:27:03,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:27:03,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:27:03,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:27:03,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:27:03,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:27:03,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:03,761 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 18:27:03,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:27:03,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126946898] [2025-04-13 18:27:03,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126946898] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:27:03,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904762186] [2025-04-13 18:27:03,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:27:03,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:27:03,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:27:03,763 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:27:03,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-04-13 18:27:03,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:27:03,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:27:03,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:27:03,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:03,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:27:03,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:27:04,242 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:27:04,242 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:27:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:27:04,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:27:04,612 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:27:04,613 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 71 treesize of output 374 [2025-04-13 18:27:38,875 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 18:27:38,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904762186] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:27:38,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:27:38,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 34 [2025-04-13 18:27:38,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886576009] [2025-04-13 18:27:38,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:27:38,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 18:27:38,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:27:38,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 18:27:38,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1113, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:27:38,876 INFO L87 Difference]: Start difference. First operand 1058 states and 3671 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:27:39,865 INFO L93 Difference]: Finished difference Result 1186 states and 4045 transitions. [2025-04-13 18:27:39,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:27:39,865 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:27:39,865 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:27:39,868 INFO L225 Difference]: With dead ends: 1186 [2025-04-13 18:27:39,868 INFO L226 Difference]: Without dead ends: 1180 [2025-04-13 18:27:39,868 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=262, Invalid=1994, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 18:27:39,868 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:27:39,868 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:27:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2025-04-13 18:27:39,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1068. [2025-04-13 18:27:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1067 states have (on average 3.477038425492034) internal successors, (3710), 1067 states have internal predecessors, (3710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 3710 transitions. [2025-04-13 18:27:39,881 INFO L79 Accepts]: Start accepts. Automaton has 1068 states and 3710 transitions. Word has length 28 [2025-04-13 18:27:39,881 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:27:39,881 INFO L485 AbstractCegarLoop]: Abstraction has 1068 states and 3710 transitions. [2025-04-13 18:27:39,881 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:39,881 INFO L278 IsEmpty]: Start isEmpty. Operand 1068 states and 3710 transitions. [2025-04-13 18:27:39,882 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:27:39,882 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:27:39,882 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:27:39,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2025-04-13 18:27:40,083 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable97 [2025-04-13 18:27:40,083 INFO L403 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:27:40,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:27:40,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1334517235, now seen corresponding path program 45 times [2025-04-13 18:27:40,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:27:40,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261876015] [2025-04-13 18:27:40,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:27:40,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:27:40,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:27:40,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:27:40,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:27:40,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:40,517 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 18:27:40,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:27:40,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261876015] [2025-04-13 18:27:40,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261876015] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:27:40,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607272963] [2025-04-13 18:27:40,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:27:40,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:27:40,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:27:40,519 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:27:40,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-04-13 18:27:40,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:27:40,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:27:40,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:27:40,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:40,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:27:40,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:27:41,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:27:41,031 INFO L325 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2025-04-13 18:27:41,031 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 55 treesize of output 55 [2025-04-13 18:27:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:27:41,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:27:41,294 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:27:41,294 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 41 treesize of output 86 [2025-04-13 18:27:41,417 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 18:27:41,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607272963] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:27:41,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:27:41,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 34 [2025-04-13 18:27:41,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515360970] [2025-04-13 18:27:41,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:27:41,418 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 18:27:41,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:27:41,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 18:27:41,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1118, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:27:41,419 INFO L87 Difference]: Start difference. First operand 1068 states and 3710 transitions. Second operand has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:27:42,516 INFO L93 Difference]: Finished difference Result 1222 states and 4175 transitions. [2025-04-13 18:27:42,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:27:42,516 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:27:42,516 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:27:42,519 INFO L225 Difference]: With dead ends: 1222 [2025-04-13 18:27:42,519 INFO L226 Difference]: Without dead ends: 1216 [2025-04-13 18:27:42,519 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=240, Invalid=1922, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 18:27:42,519 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 168 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2149 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:27:42,519 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 0 Invalid, 2175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2149 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:27:42,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-04-13 18:27:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1085. [2025-04-13 18:27:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 1084 states have (on average 3.4732472324723247) internal successors, (3765), 1084 states have internal predecessors, (3765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 3765 transitions. [2025-04-13 18:27:42,533 INFO L79 Accepts]: Start accepts. Automaton has 1085 states and 3765 transitions. Word has length 28 [2025-04-13 18:27:42,533 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:27:42,533 INFO L485 AbstractCegarLoop]: Abstraction has 1085 states and 3765 transitions. [2025-04-13 18:27:42,533 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:42,533 INFO L278 IsEmpty]: Start isEmpty. Operand 1085 states and 3765 transitions. [2025-04-13 18:27:42,535 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:27:42,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:27:42,535 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:27:42,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2025-04-13 18:27:42,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2025-04-13 18:27:42,736 INFO L403 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:27:42,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:27:42,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1868660765, now seen corresponding path program 46 times [2025-04-13 18:27:42,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:27:42,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884105383] [2025-04-13 18:27:42,736 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:27:42,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:27:42,742 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:27:42,750 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:27:42,750 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:27:42,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:43,191 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 18:27:43,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:27:43,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884105383] [2025-04-13 18:27:43,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884105383] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:27:43,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403138415] [2025-04-13 18:27:43,191 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:27:43,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:27:43,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:27:43,193 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:27:43,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2025-04-13 18:27:43,301 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:27:43,322 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:27:43,322 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:27:43,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:43,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 18:27:43,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:27:43,401 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:27:43,676 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:27:43,676 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:27:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:27:43,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:27:43,941 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 18:27:43,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403138415] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:27:43,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:27:43,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 9] total 33 [2025-04-13 18:27:43,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469039053] [2025-04-13 18:27:43,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:27:43,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:27:43,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:27:43,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:27:43,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:27:43,942 INFO L87 Difference]: Start difference. First operand 1085 states and 3765 transitions. Second operand has 35 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:27:45,591 INFO L93 Difference]: Finished difference Result 1279 states and 4377 transitions. [2025-04-13 18:27:45,591 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:27:45,591 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:27:45,591 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:27:45,594 INFO L225 Difference]: With dead ends: 1279 [2025-04-13 18:27:45,594 INFO L226 Difference]: Without dead ends: 1273 [2025-04-13 18:27:45,594 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=284, Invalid=2686, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 18:27:45,594 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 136 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2414 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:27:45,594 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 0 Invalid, 2435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2414 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:27:45,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2025-04-13 18:27:45,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1093. [2025-04-13 18:27:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1092 states have (on average 3.477106227106227) internal successors, (3797), 1092 states have internal predecessors, (3797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 3797 transitions. [2025-04-13 18:27:45,609 INFO L79 Accepts]: Start accepts. Automaton has 1093 states and 3797 transitions. Word has length 28 [2025-04-13 18:27:45,609 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:27:45,609 INFO L485 AbstractCegarLoop]: Abstraction has 1093 states and 3797 transitions. [2025-04-13 18:27:45,609 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:27:45,609 INFO L278 IsEmpty]: Start isEmpty. Operand 1093 states and 3797 transitions. [2025-04-13 18:27:45,611 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:27:45,611 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:27:45,611 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:27:45,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2025-04-13 18:27:45,811 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2025-04-13 18:27:45,811 INFO L403 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:27:45,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:27:45,812 INFO L85 PathProgramCache]: Analyzing trace with hash 646656515, now seen corresponding path program 47 times [2025-04-13 18:27:45,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:27:45,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436795391] [2025-04-13 18:27:45,812 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:27:45,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:27:45,818 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:27:45,825 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:27:45,826 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:27:45,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:27:46,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:27:46,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436795391] [2025-04-13 18:27:46,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436795391] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:27:46,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245687408] [2025-04-13 18:27:46,612 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:27:46,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:27:46,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:27:46,613 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:27:46,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-04-13 18:27:46,723 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:27:46,743 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:27:46,744 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:27:46,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:27:46,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:27:46,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:27:47,170 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:27:47,170 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:27:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:27:47,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:27:47,559 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:27:47,560 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 79 treesize of output 366 [2025-04-13 18:27:59,886 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 18:27:59,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245687408] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:27:59,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:27:59,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 9] total 37 [2025-04-13 18:27:59,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007052133] [2025-04-13 18:27:59,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:27:59,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:27:59,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:27:59,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:27:59,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1362, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:27:59,887 INFO L87 Difference]: Start difference. First operand 1093 states and 3797 transitions. Second operand has 39 states, 38 states have (on average 2.0) internal successors, (76), 38 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:01,710 INFO L93 Difference]: Finished difference Result 1256 states and 4344 transitions. [2025-04-13 18:28:01,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:28:01,711 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.0) internal successors, (76), 38 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:28:01,711 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:01,713 INFO L225 Difference]: With dead ends: 1256 [2025-04-13 18:28:01,713 INFO L226 Difference]: Without dead ends: 1250 [2025-04-13 18:28:01,714 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=301, Invalid=3121, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 18:28:01,714 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 199 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2940 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:01,714 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 0 Invalid, 2969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2940 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:28:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-04-13 18:28:01,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1098. [2025-04-13 18:28:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 1097 states have (on average 3.4767547857793986) internal successors, (3814), 1097 states have internal predecessors, (3814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:01,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 3814 transitions. [2025-04-13 18:28:01,729 INFO L79 Accepts]: Start accepts. Automaton has 1098 states and 3814 transitions. Word has length 28 [2025-04-13 18:28:01,729 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:01,729 INFO L485 AbstractCegarLoop]: Abstraction has 1098 states and 3814 transitions. [2025-04-13 18:28:01,729 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.0) internal successors, (76), 38 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:01,729 INFO L278 IsEmpty]: Start isEmpty. Operand 1098 states and 3814 transitions. [2025-04-13 18:28:01,730 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:28:01,730 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:01,730 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:01,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2025-04-13 18:28:01,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2025-04-13 18:28:01,931 INFO L403 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:28:01,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:01,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1143303231, now seen corresponding path program 48 times [2025-04-13 18:28:01,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:01,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652170001] [2025-04-13 18:28:01,931 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:28:01,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:01,940 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:28:01,949 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:28:01,950 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:28:01,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:02,349 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 18:28:02,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:02,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652170001] [2025-04-13 18:28:02,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652170001] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:02,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116592036] [2025-04-13 18:28:02,349 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:28:02,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:02,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:02,355 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:28:02,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2025-04-13 18:28:02,479 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:28:02,502 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:28:02,502 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:28:02,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:02,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:28:02,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:28:02,854 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:28:02,855 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:28:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:28:02,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:28:03,237 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:28:03,237 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 71 treesize of output 374 [2025-04-13 18:28:48,751 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 18:28:48,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116592036] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:28:48,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:28:48,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 33 [2025-04-13 18:28:48,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121193220] [2025-04-13 18:28:48,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:28:48,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:28:48,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:48,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:28:48,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:28:48,752 INFO L87 Difference]: Start difference. First operand 1098 states and 3814 transitions. Second operand has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:50,376 INFO L93 Difference]: Finished difference Result 1345 states and 4625 transitions. [2025-04-13 18:28:50,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 18:28:50,377 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:28:50,377 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:50,380 INFO L225 Difference]: With dead ends: 1345 [2025-04-13 18:28:50,380 INFO L226 Difference]: Without dead ends: 1339 [2025-04-13 18:28:50,380 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=446, Invalid=2746, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 18:28:50,381 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 136 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2342 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:50,381 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 0 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2342 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:28:50,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2025-04-13 18:28:50,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1116. [2025-04-13 18:28:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 3.48609865470852) internal successors, (3887), 1115 states have internal predecessors, (3887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:50,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 3887 transitions. [2025-04-13 18:28:50,399 INFO L79 Accepts]: Start accepts. Automaton has 1116 states and 3887 transitions. Word has length 28 [2025-04-13 18:28:50,399 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:50,399 INFO L485 AbstractCegarLoop]: Abstraction has 1116 states and 3887 transitions. [2025-04-13 18:28:50,399 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:50,399 INFO L278 IsEmpty]: Start isEmpty. Operand 1116 states and 3887 transitions. [2025-04-13 18:28:50,400 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:28:50,401 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:50,401 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:50,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2025-04-13 18:28:50,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:50,601 INFO L403 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:28:50,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:50,601 INFO L85 PathProgramCache]: Analyzing trace with hash 720241459, now seen corresponding path program 49 times [2025-04-13 18:28:50,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:50,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283299439] [2025-04-13 18:28:50,602 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:28:50,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:50,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:28:50,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:28:50,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:28:50,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:28:51,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:51,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283299439] [2025-04-13 18:28:51,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283299439] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:51,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961730175] [2025-04-13 18:28:51,120 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:28:51,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:51,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:51,122 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:28:51,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2025-04-13 18:28:51,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:28:51,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:28:51,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:28:51,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:51,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 18:28:51,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:28:51,260 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:28:51,296 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:28:51,317 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:28:51,317 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 11 treesize of output 11 [2025-04-13 18:28:51,343 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 18:28:51,367 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:28:51,677 INFO L325 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2025-04-13 18:28:51,677 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 31 [2025-04-13 18:28:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:28:51,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:28:52,014 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 18:28:52,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961730175] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:28:52,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:28:52,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 10] total 39 [2025-04-13 18:28:52,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897297353] [2025-04-13 18:28:52,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:28:52,015 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 18:28:52,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:28:52,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 18:28:52,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1464, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 18:28:52,015 INFO L87 Difference]: Start difference. First operand 1116 states and 3887 transitions. Second operand has 41 states, 40 states have (on average 1.875) internal successors, (75), 40 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:53,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:28:53,667 INFO L93 Difference]: Finished difference Result 1268 states and 4380 transitions. [2025-04-13 18:28:53,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:28:53,667 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.875) internal successors, (75), 40 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:28:53,667 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:28:53,670 INFO L225 Difference]: With dead ends: 1268 [2025-04-13 18:28:53,670 INFO L226 Difference]: Without dead ends: 1262 [2025-04-13 18:28:53,671 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=366, Invalid=3174, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 18:28:53,671 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 206 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2811 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:28:53,671 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 0 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2811 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:28:53,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2025-04-13 18:28:53,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1126. [2025-04-13 18:28:53,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1125 states have (on average 3.485333333333333) internal successors, (3921), 1125 states have internal predecessors, (3921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 3921 transitions. [2025-04-13 18:28:53,685 INFO L79 Accepts]: Start accepts. Automaton has 1126 states and 3921 transitions. Word has length 28 [2025-04-13 18:28:53,685 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:28:53,685 INFO L485 AbstractCegarLoop]: Abstraction has 1126 states and 3921 transitions. [2025-04-13 18:28:53,685 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.875) internal successors, (75), 40 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:28:53,685 INFO L278 IsEmpty]: Start isEmpty. Operand 1126 states and 3921 transitions. [2025-04-13 18:28:53,686 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:28:53,686 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:28:53,687 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:28:53,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2025-04-13 18:28:53,887 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2025-04-13 18:28:53,887 INFO L403 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:28:53,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:28:53,887 INFO L85 PathProgramCache]: Analyzing trace with hash -872733681, now seen corresponding path program 50 times [2025-04-13 18:28:53,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:28:53,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877014561] [2025-04-13 18:28:53,887 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:28:53,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:28:53,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:28:53,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:28:53,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:28:53,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:54,312 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 18:28:54,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:28:54,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877014561] [2025-04-13 18:28:54,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877014561] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:28:54,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844924466] [2025-04-13 18:28:54,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:28:54,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:28:54,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:28:54,314 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:28:54,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2025-04-13 18:28:54,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:28:54,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:28:54,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:28:54,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:28:54,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:28:54,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:28:54,803 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:28:54,803 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:28:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:28:54,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:28:55,202 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:28:55,202 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 71 treesize of output 374 [2025-04-13 18:29:29,838 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 18:29:29,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844924466] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:29:29,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:29:29,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 33 [2025-04-13 18:29:29,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019751707] [2025-04-13 18:29:29,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:29:29,839 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:29:29,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:29:29,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:29:29,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1023, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:29:29,839 INFO L87 Difference]: Start difference. First operand 1126 states and 3921 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:29:31,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:29:31,578 INFO L93 Difference]: Finished difference Result 1357 states and 4675 transitions. [2025-04-13 18:29:31,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 18:29:31,578 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:29:31,578 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:29:31,581 INFO L225 Difference]: With dead ends: 1357 [2025-04-13 18:29:31,581 INFO L226 Difference]: Without dead ends: 1351 [2025-04-13 18:29:31,582 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=490, Invalid=2932, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 18:29:31,582 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 153 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2292 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:29:31,582 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 0 Invalid, 2342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2292 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:29:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2025-04-13 18:29:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1118. [2025-04-13 18:29:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1117 states have (on average 3.476275738585497) internal successors, (3883), 1117 states have internal predecessors, (3883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:29:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 3883 transitions. [2025-04-13 18:29:31,596 INFO L79 Accepts]: Start accepts. Automaton has 1118 states and 3883 transitions. Word has length 28 [2025-04-13 18:29:31,596 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:29:31,596 INFO L485 AbstractCegarLoop]: Abstraction has 1118 states and 3883 transitions. [2025-04-13 18:29:31,596 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:29:31,596 INFO L278 IsEmpty]: Start isEmpty. Operand 1118 states and 3883 transitions. [2025-04-13 18:29:31,598 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:29:31,598 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:29:31,598 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:29:31,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2025-04-13 18:29:31,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2025-04-13 18:29:31,798 INFO L403 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:29:31,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:29:31,798 INFO L85 PathProgramCache]: Analyzing trace with hash 148617703, now seen corresponding path program 51 times [2025-04-13 18:29:31,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:29:31,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084206518] [2025-04-13 18:29:31,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:29:31,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:29:31,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:29:31,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:29:31,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:29:31,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:32,213 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 18:29:32,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:29:32,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084206518] [2025-04-13 18:29:32,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084206518] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:29:32,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859332959] [2025-04-13 18:29:32,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:29:32,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:29:32,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:29:32,215 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:29:32,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2025-04-13 18:29:32,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:29:32,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:29:32,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:29:32,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:32,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:29:32,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:29:32,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:29:32,800 INFO L325 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2025-04-13 18:29:32,801 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 55 treesize of output 55 [2025-04-13 18:29:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:29:32,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:29:33,068 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:29:33,069 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 41 treesize of output 86 [2025-04-13 18:29:33,221 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 18:29:33,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859332959] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:29:33,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:29:33,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 34 [2025-04-13 18:29:33,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585022867] [2025-04-13 18:29:33,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:29:33,222 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 18:29:33,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:29:33,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 18:29:33,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1113, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:29:33,223 INFO L87 Difference]: Start difference. First operand 1118 states and 3883 transitions. Second operand has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:29:34,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:29:34,411 INFO L93 Difference]: Finished difference Result 1387 states and 4703 transitions. [2025-04-13 18:29:34,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:29:34,412 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:29:34,412 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:29:34,415 INFO L225 Difference]: With dead ends: 1387 [2025-04-13 18:29:34,415 INFO L226 Difference]: Without dead ends: 1381 [2025-04-13 18:29:34,415 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=261, Invalid=1995, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 18:29:34,415 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 217 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:29:34,415 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 0 Invalid, 2095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2055 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:29:34,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-04-13 18:29:34,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1122. [2025-04-13 18:29:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 3.4826048171275645) internal successors, (3904), 1121 states have internal predecessors, (3904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:29:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 3904 transitions. [2025-04-13 18:29:34,431 INFO L79 Accepts]: Start accepts. Automaton has 1122 states and 3904 transitions. Word has length 28 [2025-04-13 18:29:34,431 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:29:34,431 INFO L485 AbstractCegarLoop]: Abstraction has 1122 states and 3904 transitions. [2025-04-13 18:29:34,431 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 35 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:29:34,431 INFO L278 IsEmpty]: Start isEmpty. Operand 1122 states and 3904 transitions. [2025-04-13 18:29:34,432 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:29:34,432 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:29:34,433 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:29:34,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2025-04-13 18:29:34,633 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable104 [2025-04-13 18:29:34,633 INFO L403 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:29:34,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:29:34,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1180171283, now seen corresponding path program 52 times [2025-04-13 18:29:34,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:29:34,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622665445] [2025-04-13 18:29:34,634 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:29:34,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:29:34,640 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:29:34,648 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:29:34,648 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:29:34,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:29:35,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:29:35,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622665445] [2025-04-13 18:29:35,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622665445] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:29:35,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206798339] [2025-04-13 18:29:35,328 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:29:35,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:29:35,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:29:35,330 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:29:35,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2025-04-13 18:29:35,447 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:29:35,467 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:29:35,468 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:29:35,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:35,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 18:29:35,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:29:35,562 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:29:35,872 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:29:35,872 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:29:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:29:35,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:29:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:29:36,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206798339] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:29:36,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:29:36,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 37 [2025-04-13 18:29:36,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615951694] [2025-04-13 18:29:36,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:29:36,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:29:36,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:29:36,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:29:36,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1323, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:29:36,216 INFO L87 Difference]: Start difference. First operand 1122 states and 3904 transitions. Second operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:29:38,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:29:38,233 INFO L93 Difference]: Finished difference Result 1288 states and 4434 transitions. [2025-04-13 18:29:38,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 18:29:38,233 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:29:38,233 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:29:38,236 INFO L225 Difference]: With dead ends: 1288 [2025-04-13 18:29:38,236 INFO L226 Difference]: Without dead ends: 1282 [2025-04-13 18:29:38,237 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=460, Invalid=3830, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 18:29:38,237 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 168 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2151 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:29:38,237 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 0 Invalid, 2190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2151 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:29:38,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2025-04-13 18:29:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1128. [2025-04-13 18:29:38,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1127 states have (on average 3.4809228039041704) internal successors, (3923), 1127 states have internal predecessors, (3923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:29:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 3923 transitions. [2025-04-13 18:29:38,253 INFO L79 Accepts]: Start accepts. Automaton has 1128 states and 3923 transitions. Word has length 28 [2025-04-13 18:29:38,253 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:29:38,253 INFO L485 AbstractCegarLoop]: Abstraction has 1128 states and 3923 transitions. [2025-04-13 18:29:38,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:29:38,253 INFO L278 IsEmpty]: Start isEmpty. Operand 1128 states and 3923 transitions. [2025-04-13 18:29:38,254 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:29:38,254 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:29:38,255 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:29:38,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2025-04-13 18:29:38,455 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:29:38,455 INFO L403 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:29:38,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:29:38,455 INFO L85 PathProgramCache]: Analyzing trace with hash 736363025, now seen corresponding path program 53 times [2025-04-13 18:29:38,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:29:38,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400126240] [2025-04-13 18:29:38,455 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:29:38,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:29:38,461 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:29:38,469 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:29:38,469 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:29:38,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:29:39,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:29:39,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400126240] [2025-04-13 18:29:39,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400126240] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:29:39,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658330305] [2025-04-13 18:29:39,034 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:29:39,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:29:39,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:29:39,036 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:29:39,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2025-04-13 18:29:39,153 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:29:39,174 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:29:39,174 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:29:39,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:29:39,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:29:39,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:29:39,580 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:29:39,580 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:29:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:29:39,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:29:39,908 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:29:39,909 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 79 treesize of output 366 [2025-04-13 18:30:06,953 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 18:30:06,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658330305] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:30:06,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:30:06,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 9] total 35 [2025-04-13 18:30:06,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113842530] [2025-04-13 18:30:06,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:30:06,954 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 18:30:06,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:30:06,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 18:30:06,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1216, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:30:06,954 INFO L87 Difference]: Start difference. First operand 1128 states and 3923 transitions. Second operand has 37 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:30:08,980 INFO L93 Difference]: Finished difference Result 1429 states and 4807 transitions. [2025-04-13 18:30:08,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 18:30:08,981 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 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 28 [2025-04-13 18:30:08,981 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:30:08,984 INFO L225 Difference]: With dead ends: 1429 [2025-04-13 18:30:08,984 INFO L226 Difference]: Without dead ends: 1423 [2025-04-13 18:30:08,984 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=353, Invalid=3553, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 18:30:08,984 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 251 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3164 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:30:08,984 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 0 Invalid, 3199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3164 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 18:30:08,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2025-04-13 18:30:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1128. [2025-04-13 18:30:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1127 states have (on average 3.4809228039041704) internal successors, (3923), 1127 states have internal predecessors, (3923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 3923 transitions. [2025-04-13 18:30:09,002 INFO L79 Accepts]: Start accepts. Automaton has 1128 states and 3923 transitions. Word has length 28 [2025-04-13 18:30:09,002 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:30:09,002 INFO L485 AbstractCegarLoop]: Abstraction has 1128 states and 3923 transitions. [2025-04-13 18:30:09,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:30:09,002 INFO L278 IsEmpty]: Start isEmpty. Operand 1128 states and 3923 transitions. [2025-04-13 18:30:09,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:30:09,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:30:09,004 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:30:09,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2025-04-13 18:30:09,204 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:09,204 INFO L403 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:30:09,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:30:09,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1497753453, now seen corresponding path program 54 times [2025-04-13 18:30:09,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:30:09,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432118188] [2025-04-13 18:30:09,204 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:30:09,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:30:09,210 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:30:09,220 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:30:09,220 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:30:09,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:30:09,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:30:09,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432118188] [2025-04-13 18:30:09,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432118188] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:30:09,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583934213] [2025-04-13 18:30:09,900 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:30:09,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:30:09,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:30:09,902 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:30:09,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2025-04-13 18:30:10,025 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:30:10,049 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:30:10,049 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:30:10,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:30:10,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 18:30:10,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:30:10,436 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:30:10,436 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:30:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:30:10,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:30:10,883 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:30:10,883 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 71 treesize of output 374 [2025-04-13 18:31:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:31:51,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583934213] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:31:51,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:31:51,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 11] total 37 [2025-04-13 18:31:51,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42964570] [2025-04-13 18:31:51,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:31:51,353 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:31:51,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:31:51,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:31:51,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1307, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:31:51,354 INFO L87 Difference]: Start difference. First operand 1128 states and 3923 transitions. Second operand has 39 states, 38 states have (on average 1.736842105263158) internal successors, (66), 38 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:53,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:31:53,328 INFO L93 Difference]: Finished difference Result 1358 states and 4641 transitions. [2025-04-13 18:31:53,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 18:31:53,328 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.736842105263158) internal successors, (66), 38 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:31:53,328 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:31:53,331 INFO L225 Difference]: With dead ends: 1358 [2025-04-13 18:31:53,331 INFO L226 Difference]: Without dead ends: 1352 [2025-04-13 18:31:53,331 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=501, Invalid=3921, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 18:31:53,331 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 211 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2345 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:31:53,331 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 0 Invalid, 2395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2345 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:31:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-04-13 18:31:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1132. [2025-04-13 18:31:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1131 states have (on average 3.4880636604774535) internal successors, (3945), 1131 states have internal predecessors, (3945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 3945 transitions. [2025-04-13 18:31:53,345 INFO L79 Accepts]: Start accepts. Automaton has 1132 states and 3945 transitions. Word has length 28 [2025-04-13 18:31:53,345 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:31:53,345 INFO L485 AbstractCegarLoop]: Abstraction has 1132 states and 3945 transitions. [2025-04-13 18:31:53,345 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.736842105263158) internal successors, (66), 38 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:53,345 INFO L278 IsEmpty]: Start isEmpty. Operand 1132 states and 3945 transitions. [2025-04-13 18:31:53,347 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:31:53,347 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:31:53,347 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:31:53,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2025-04-13 18:31:53,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2025-04-13 18:31:53,547 INFO L403 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:31:53,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:31:53,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1664668889, now seen corresponding path program 55 times [2025-04-13 18:31:53,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:31:53,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356552743] [2025-04-13 18:31:53,547 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:31:53,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:31:53,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:31:53,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:31:53,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:31:53,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:31:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:31:54,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:31:54,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356552743] [2025-04-13 18:31:54,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356552743] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:31:54,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070280590] [2025-04-13 18:31:54,252 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:31:54,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:31:54,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:31:54,254 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:31:54,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2025-04-13 18:31:54,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:31:54,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:31:54,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:31:54,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:31:54,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 18:31:54,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:31:54,396 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:31:54,437 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:31:54,457 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:31:54,457 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 11 treesize of output 11 [2025-04-13 18:31:54,478 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 18:31:54,499 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:31:54,846 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:31:54,846 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 15 [2025-04-13 18:31:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:31:54,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:31:55,189 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 18:31:55,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070280590] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:31:55,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:31:55,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 10] total 41 [2025-04-13 18:31:55,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643052490] [2025-04-13 18:31:55,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:31:55,190 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 18:31:55,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:31:55,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 18:31:55,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1644, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:31:55,190 INFO L87 Difference]: Start difference. First operand 1132 states and 3945 transitions. Second operand has 43 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 42 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 18:31:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:31:57,436 INFO L93 Difference]: Finished difference Result 1358 states and 4677 transitions. [2025-04-13 18:31:57,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:31:57,437 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 42 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 28 [2025-04-13 18:31:57,437 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:31:57,439 INFO L225 Difference]: With dead ends: 1358 [2025-04-13 18:31:57,439 INFO L226 Difference]: Without dead ends: 1352 [2025-04-13 18:31:57,440 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=397, Invalid=3893, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 18:31:57,440 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 219 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3356 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:31:57,440 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 0 Invalid, 3415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3356 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:31:57,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-04-13 18:31:57,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1134. [2025-04-13 18:31:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1133 states have (on average 3.491615180935569) internal successors, (3956), 1133 states have internal predecessors, (3956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:57,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 3956 transitions. [2025-04-13 18:31:57,453 INFO L79 Accepts]: Start accepts. Automaton has 1134 states and 3956 transitions. Word has length 28 [2025-04-13 18:31:57,453 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:31:57,454 INFO L485 AbstractCegarLoop]: Abstraction has 1134 states and 3956 transitions. [2025-04-13 18:31:57,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 42 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 18:31:57,454 INFO L278 IsEmpty]: Start isEmpty. Operand 1134 states and 3956 transitions. [2025-04-13 18:31:57,455 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:31:57,455 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:31:57,455 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:31:57,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2025-04-13 18:31:57,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:31:57,655 INFO L403 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:31:57,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:31:57,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1080654075, now seen corresponding path program 56 times [2025-04-13 18:31:57,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:31:57,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067382913] [2025-04-13 18:31:57,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:31:57,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:31:57,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:31:57,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 18:31:57,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:31:57,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:31:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:31:58,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:31:58,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067382913] [2025-04-13 18:31:58,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067382913] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:31:58,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:31:58,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 18:31:58,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933628348] [2025-04-13 18:31:58,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:31:58,072 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:31:58,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:31:58,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:31:58,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:31:58,072 INFO L87 Difference]: Start difference. First operand 1134 states and 3956 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:31:58,458 INFO L93 Difference]: Finished difference Result 1212 states and 4219 transitions. [2025-04-13 18:31:58,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:31:58,458 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:31:58,459 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:31:58,461 INFO L225 Difference]: With dead ends: 1212 [2025-04-13 18:31:58,461 INFO L226 Difference]: Without dead ends: 1206 [2025-04-13 18:31:58,461 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:31:58,461 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:31:58,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:31:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2025-04-13 18:31:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1150. [2025-04-13 18:31:58,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 3.5004351610095736) internal successors, (4022), 1149 states have internal predecessors, (4022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:58,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 4022 transitions. [2025-04-13 18:31:58,475 INFO L79 Accepts]: Start accepts. Automaton has 1150 states and 4022 transitions. Word has length 28 [2025-04-13 18:31:58,475 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:31:58,475 INFO L485 AbstractCegarLoop]: Abstraction has 1150 states and 4022 transitions. [2025-04-13 18:31:58,475 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:31:58,476 INFO L278 IsEmpty]: Start isEmpty. Operand 1150 states and 4022 transitions. [2025-04-13 18:31:58,477 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:31:58,477 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:31:58,477 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:31:58,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2025-04-13 18:31:58,477 INFO L403 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:31:58,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:31:58,477 INFO L85 PathProgramCache]: Analyzing trace with hash 606521965, now seen corresponding path program 57 times [2025-04-13 18:31:58,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:31:58,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875417274] [2025-04-13 18:31:58,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:31:58,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:31:58,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:31:58,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:31:58,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:31:58,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:31:58,913 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 18:31:58,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:31:58,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875417274] [2025-04-13 18:31:58,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875417274] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:31:58,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547278085] [2025-04-13 18:31:58,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:31:58,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:31:58,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:31:58,915 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:31:58,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2025-04-13 18:31:59,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:31:59,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:31:59,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:31:59,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:31:59,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:31:59,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:31:59,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:31:59,406 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:31:59,406 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 55 treesize of output 71 [2025-04-13 18:31:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:31:59,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:31:59,779 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:31:59,779 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 41 treesize of output 86 [2025-04-13 18:31:59,912 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 18:31:59,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547278085] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:31:59,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:31:59,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 34 [2025-04-13 18:31:59,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200267817] [2025-04-13 18:31:59,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:31:59,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 18:31:59,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:31:59,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 18:31:59,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:31:59,913 INFO L87 Difference]: Start difference. First operand 1150 states and 4022 transitions. Second operand has 36 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:01,731 INFO L93 Difference]: Finished difference Result 1526 states and 5247 transitions. [2025-04-13 18:32:01,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 18:32:01,731 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:32:01,731 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:01,734 INFO L225 Difference]: With dead ends: 1526 [2025-04-13 18:32:01,734 INFO L226 Difference]: Without dead ends: 1520 [2025-04-13 18:32:01,735 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=544, Invalid=3362, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 18:32:01,735 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 191 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2061 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:01,735 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 0 Invalid, 2183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2061 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:32:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2025-04-13 18:32:01,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1152. [2025-04-13 18:32:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 3.5056472632493483) internal successors, (4035), 1151 states have internal predecessors, (4035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 4035 transitions. [2025-04-13 18:32:01,749 INFO L79 Accepts]: Start accepts. Automaton has 1152 states and 4035 transitions. Word has length 28 [2025-04-13 18:32:01,749 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:01,749 INFO L485 AbstractCegarLoop]: Abstraction has 1152 states and 4035 transitions. [2025-04-13 18:32:01,749 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 35 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:01,749 INFO L278 IsEmpty]: Start isEmpty. Operand 1152 states and 4035 transitions. [2025-04-13 18:32:01,750 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:32:01,750 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:01,750 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:32:01,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2025-04-13 18:32:01,950 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:01,950 INFO L403 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:32:01,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:01,951 INFO L85 PathProgramCache]: Analyzing trace with hash -262215473, now seen corresponding path program 58 times [2025-04-13 18:32:01,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:01,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392084637] [2025-04-13 18:32:01,951 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:32:01,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:01,956 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:32:01,965 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:32:01,965 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:32:01,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:02,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:32:02,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:02,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392084637] [2025-04-13 18:32:02,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392084637] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:32:02,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997510930] [2025-04-13 18:32:02,512 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:32:02,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:02,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:32:02,514 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:32:02,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2025-04-13 18:32:02,650 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:32:02,674 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:32:02,674 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:32:02,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:02,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 18:32:02,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:32:02,753 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:32:03,065 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:03,065 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:32:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:32:03,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:32:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:32:03,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997510930] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:32:03,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:32:03,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 9] total 38 [2025-04-13 18:32:03,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170124712] [2025-04-13 18:32:03,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:32:03,325 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 18:32:03,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:03,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 18:32:03,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1406, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 18:32:03,325 INFO L87 Difference]: Start difference. First operand 1152 states and 4035 transitions. Second operand has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:05,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:05,400 INFO L93 Difference]: Finished difference Result 1332 states and 4544 transitions. [2025-04-13 18:32:05,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 18:32:05,400 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:32:05,401 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:05,403 INFO L225 Difference]: With dead ends: 1332 [2025-04-13 18:32:05,403 INFO L226 Difference]: Without dead ends: 1326 [2025-04-13 18:32:05,404 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=493, Invalid=4763, Unknown=0, NotChecked=0, Total=5256 [2025-04-13 18:32:05,404 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 175 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2938 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:05,404 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 0 Invalid, 2968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2938 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:32:05,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2025-04-13 18:32:05,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1162. [2025-04-13 18:32:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1161 states have (on average 3.503875968992248) internal successors, (4068), 1161 states have internal predecessors, (4068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 4068 transitions. [2025-04-13 18:32:05,419 INFO L79 Accepts]: Start accepts. Automaton has 1162 states and 4068 transitions. Word has length 28 [2025-04-13 18:32:05,419 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:05,419 INFO L485 AbstractCegarLoop]: Abstraction has 1162 states and 4068 transitions. [2025-04-13 18:32:05,419 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:05,419 INFO L278 IsEmpty]: Start isEmpty. Operand 1162 states and 4068 transitions. [2025-04-13 18:32:05,420 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:32:05,420 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:05,420 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:32:05,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2025-04-13 18:32:05,621 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:05,621 INFO L403 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:32:05,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:05,621 INFO L85 PathProgramCache]: Analyzing trace with hash 273459759, now seen corresponding path program 59 times [2025-04-13 18:32:05,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:05,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842050304] [2025-04-13 18:32:05,621 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:32:05,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:05,627 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:32:05,634 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:32:05,634 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:32:05,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:32:06,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:06,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842050304] [2025-04-13 18:32:06,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842050304] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:32:06,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432807795] [2025-04-13 18:32:06,342 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:32:06,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:06,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:32:06,344 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:32:06,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2025-04-13 18:32:06,461 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:32:06,481 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:32:06,481 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:32:06,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:06,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:32:06,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:32:06,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 18:32:06,843 INFO L325 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2025-04-13 18:32:06,843 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 55 [2025-04-13 18:32:06,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:32:06,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:32:07,196 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:07,196 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 79 treesize of output 366 [2025-04-13 18:32:18,566 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 18:32:18,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432807795] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:32:18,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:32:18,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 9] total 37 [2025-04-13 18:32:18,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408726909] [2025-04-13 18:32:18,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:32:18,567 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:32:18,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:18,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:32:18,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1333, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:32:18,568 INFO L87 Difference]: Start difference. First operand 1162 states and 4068 transitions. Second operand has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:20,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:20,755 INFO L93 Difference]: Finished difference Result 1644 states and 5672 transitions. [2025-04-13 18:32:20,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 18:32:20,755 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:32:20,755 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:20,758 INFO L225 Difference]: With dead ends: 1644 [2025-04-13 18:32:20,758 INFO L226 Difference]: Without dead ends: 1638 [2025-04-13 18:32:20,759 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=501, Invalid=3659, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 18:32:20,759 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 280 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2750 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:20,759 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 0 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2750 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:32:20,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2025-04-13 18:32:20,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1154. [2025-04-13 18:32:20,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 3.489158716392021) internal successors, (4023), 1153 states have internal predecessors, (4023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 4023 transitions. [2025-04-13 18:32:20,774 INFO L79 Accepts]: Start accepts. Automaton has 1154 states and 4023 transitions. Word has length 28 [2025-04-13 18:32:20,774 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:20,774 INFO L485 AbstractCegarLoop]: Abstraction has 1154 states and 4023 transitions. [2025-04-13 18:32:20,774 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:20,774 INFO L278 IsEmpty]: Start isEmpty. Operand 1154 states and 4023 transitions. [2025-04-13 18:32:20,775 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:32:20,775 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:20,775 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:32:20,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Ended with exit code 0 [2025-04-13 18:32:20,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2025-04-13 18:32:20,975 INFO L403 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:32:20,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:20,976 INFO L85 PathProgramCache]: Analyzing trace with hash 427293849, now seen corresponding path program 60 times [2025-04-13 18:32:20,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:20,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797032264] [2025-04-13 18:32:20,976 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:32:20,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:20,982 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:32:20,990 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:32:20,990 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:32:20,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:21,394 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 18:32:21,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:21,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797032264] [2025-04-13 18:32:21,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797032264] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:32:21,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828903355] [2025-04-13 18:32:21,394 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:32:21,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:21,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:32:21,396 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:32:21,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2025-04-13 18:32:21,519 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:32:21,539 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:32:21,539 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:32:21,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:21,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:32:21,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:32:21,890 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:32:21,891 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:32:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:32:21,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:32:22,276 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:22,276 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 71 treesize of output 374 [2025-04-13 18:32:46,451 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 18:32:46,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828903355] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:32:46,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:32:46,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 33 [2025-04-13 18:32:46,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43812059] [2025-04-13 18:32:46,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:32:46,451 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:32:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:46,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:32:46,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1032, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:32:46,452 INFO L87 Difference]: Start difference. First operand 1154 states and 4023 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:48,256 INFO L93 Difference]: Finished difference Result 1370 states and 4703 transitions. [2025-04-13 18:32:48,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 18:32:48,257 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:32:48,257 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:48,259 INFO L225 Difference]: With dead ends: 1370 [2025-04-13 18:32:48,259 INFO L226 Difference]: Without dead ends: 1364 [2025-04-13 18:32:48,260 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=458, Invalid=3324, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 18:32:48,260 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 144 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2148 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 2148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:48,260 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 0 Invalid, 2196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 2148 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:32:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-04-13 18:32:48,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1160. [2025-04-13 18:32:48,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1159 states have (on average 3.4961173425366696) internal successors, (4052), 1159 states have internal predecessors, (4052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 4052 transitions. [2025-04-13 18:32:48,275 INFO L79 Accepts]: Start accepts. Automaton has 1160 states and 4052 transitions. Word has length 28 [2025-04-13 18:32:48,275 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:48,275 INFO L485 AbstractCegarLoop]: Abstraction has 1160 states and 4052 transitions. [2025-04-13 18:32:48,275 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:48,275 INFO L278 IsEmpty]: Start isEmpty. Operand 1160 states and 4052 transitions. [2025-04-13 18:32:48,276 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:32:48,276 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:48,276 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:32:48,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2025-04-13 18:32:48,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2025-04-13 18:32:48,477 INFO L403 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:32:48,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:48,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1963810927, now seen corresponding path program 61 times [2025-04-13 18:32:48,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:48,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915002566] [2025-04-13 18:32:48,477 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:32:48,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:48,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:32:48,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:32:48,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:48,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:48,952 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:32:48,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:48,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915002566] [2025-04-13 18:32:48,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915002566] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:32:48,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117848718] [2025-04-13 18:32:48,952 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:32:48,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:48,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:32:48,954 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:32:48,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2025-04-13 18:32:49,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:32:49,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:32:49,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:32:49,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:49,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 18:32:49,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:32:49,100 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:32:49,139 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:32:49,157 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:32:49,158 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 11 treesize of output 11 [2025-04-13 18:32:49,178 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 18:32:49,199 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:32:49,522 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:49,522 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 15 [2025-04-13 18:32:49,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:32:49,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:32:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:32:49,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117848718] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:32:49,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:32:49,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 10] total 39 [2025-04-13 18:32:49,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213487193] [2025-04-13 18:32:49,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:32:49,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 18:32:49,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:32:49,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 18:32:49,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1486, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 18:32:49,836 INFO L87 Difference]: Start difference. First operand 1160 states and 4052 transitions. Second operand has 41 states, 40 states have (on average 1.9) internal successors, (76), 40 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:32:51,733 INFO L93 Difference]: Finished difference Result 1471 states and 4972 transitions. [2025-04-13 18:32:51,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 18:32:51,734 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.9) internal successors, (76), 40 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 18:32:51,734 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:32:51,736 INFO L225 Difference]: With dead ends: 1471 [2025-04-13 18:32:51,736 INFO L226 Difference]: Without dead ends: 1465 [2025-04-13 18:32:51,737 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=357, Invalid=3675, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 18:32:51,737 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 263 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3042 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:32:51,737 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 0 Invalid, 3063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3042 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:32:51,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2025-04-13 18:32:51,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1205. [2025-04-13 18:32:51,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1204 states have (on average 3.5240863787375414) internal successors, (4243), 1204 states have internal predecessors, (4243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 4243 transitions. [2025-04-13 18:32:51,751 INFO L79 Accepts]: Start accepts. Automaton has 1205 states and 4243 transitions. Word has length 28 [2025-04-13 18:32:51,752 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:32:51,752 INFO L485 AbstractCegarLoop]: Abstraction has 1205 states and 4243 transitions. [2025-04-13 18:32:51,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.9) internal successors, (76), 40 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:32:51,752 INFO L278 IsEmpty]: Start isEmpty. Operand 1205 states and 4243 transitions. [2025-04-13 18:32:51,753 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:32:51,753 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:32:51,753 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:32:51,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2025-04-13 18:32:51,953 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2025-04-13 18:32:51,953 INFO L403 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:32:51,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:32:51,954 INFO L85 PathProgramCache]: Analyzing trace with hash 2143853617, now seen corresponding path program 62 times [2025-04-13 18:32:51,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:32:51,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792995111] [2025-04-13 18:32:51,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:32:51,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:32:51,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:32:51,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:32:51,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:32:51,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:52,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:32:52,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:32:52,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792995111] [2025-04-13 18:32:52,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792995111] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:32:52,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974956513] [2025-04-13 18:32:52,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:32:52,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:32:52,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:32:52,368 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:32:52,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2025-04-13 18:32:52,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:32:52,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:32:52,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:32:52,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:32:52,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:32:52,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:32:52,898 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 18:32:52,898 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 18:32:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:32:52,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:32:53,291 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:32:53,292 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 71 treesize of output 374 [2025-04-13 18:33:02,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-13 18:33:02,375 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 18:33:02,376 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 18:33:02,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2025-04-13 18:33:02,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable115 [2025-04-13 18:33:02,577 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:583) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 61 more [2025-04-13 18:33:02,581 INFO L158 Benchmark]: Toolchain (without parser) took 626663.47ms. Allocated memory was 155.2MB in the beginning and 1.1GB in the end (delta: 952.1MB). Free memory was 109.3MB in the beginning and 781.3MB in the end (delta: -672.1MB). Peak memory consumption was 749.1MB. Max. memory is 8.0GB. [2025-04-13 18:33:02,581 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:33:02,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.57ms. Allocated memory is still 155.2MB. Free memory was 109.3MB in the beginning and 94.3MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 18:33:02,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.06ms. Allocated memory is still 155.2MB. Free memory was 94.1MB in the beginning and 91.7MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:33:02,581 INFO L158 Benchmark]: Boogie Preprocessor took 43.43ms. Allocated memory is still 155.2MB. Free memory was 91.7MB in the beginning and 88.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:33:02,581 INFO L158 Benchmark]: RCFGBuilder took 719.86ms. Allocated memory is still 155.2MB. Free memory was 88.3MB in the beginning and 65.4MB in the end (delta: 22.9MB). Peak memory consumption was 70.1MB. Max. memory is 8.0GB. [2025-04-13 18:33:02,581 INFO L158 Benchmark]: TraceAbstraction took 625610.32ms. Allocated memory was 155.2MB in the beginning and 1.1GB in the end (delta: 952.1MB). Free memory was 64.6MB in the beginning and 781.3MB in the end (delta: -716.8MB). Peak memory consumption was 704.1MB. Max. memory is 8.0GB. [2025-04-13 18:33:02,582 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.15ms. Allocated memory is still 155.2MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.57ms. Allocated memory is still 155.2MB. Free memory was 109.3MB in the beginning and 94.3MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.06ms. Allocated memory is still 155.2MB. Free memory was 94.1MB in the beginning and 91.7MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.43ms. Allocated memory is still 155.2MB. Free memory was 91.7MB in the beginning and 88.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 719.86ms. Allocated memory is still 155.2MB. Free memory was 88.3MB in the beginning and 65.4MB in the end (delta: 22.9MB). Peak memory consumption was 70.1MB. Max. memory is 8.0GB. * TraceAbstraction took 625610.32ms. Allocated memory was 155.2MB in the beginning and 1.1GB in the end (delta: 952.1MB). Free memory was 64.6MB in the beginning and 781.3MB in the end (delta: -716.8MB). Peak memory consumption was 704.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...