/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/pthread-deagle/circular_buffer_bad.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:58:59,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:58:59,193 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:58:59,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:58:59,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:58:59,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:58:59,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:58:59,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:58:59,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:58:59,213 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:58:59,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:58:59,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:58:59,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:58:59,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:58:59,215 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:58:59,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:58:59,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:58:59,215 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:58:59,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:58:59,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:58:59,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:58:59,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:58:59,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:58:59,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:58:59,215 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:58:59,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:58:59,215 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:58:59,216 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:58:59,216 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:58:59,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:58:59,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:58:59,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:58:59,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:58:59,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:58:59,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:58:59,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:58:59,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:58:59,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:58:59,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:58:59,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:58:59,216 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:58:59,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:58:59,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:58:59,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:58:59,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:58:59,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:58:59,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:58:59,217 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:58:59,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:58:59,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:58:59,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:58:59,449 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:58:59,449 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:58:59,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i [2025-04-13 18:59:00,713 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f7f362b/5471c5c99fd14687937ba6d5e7cb794a/FLAGbcfbeedd1 [2025-04-13 18:59:00,930 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:59:00,931 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i [2025-04-13 18:59:00,943 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f7f362b/5471c5c99fd14687937ba6d5e7cb794a/FLAGbcfbeedd1 [2025-04-13 18:59:01,763 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f7f362b/5471c5c99fd14687937ba6d5e7cb794a [2025-04-13 18:59:01,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:59:01,766 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:59:01,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:59:01,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:59:01,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:59:01,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:59:01" (1/1) ... [2025-04-13 18:59:01,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ed93d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:59:01, skipping insertion in model container [2025-04-13 18:59:01,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:59:01" (1/1) ... [2025-04-13 18:59:01,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:59:02,061 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i[30440,30453] [2025-04-13 18:59:02,070 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i[30895,30908] [2025-04-13 18:59:02,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:59:02,091 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:59:02,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i[30440,30453] [2025-04-13 18:59:02,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i[30895,30908] [2025-04-13 18:59:02,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:59:02,170 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:59:02,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:59:02 WrapperNode [2025-04-13 18:59:02,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:59:02,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:59:02,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:59:02,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:59:02,174 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:59:02" (1/1) ... [2025-04-13 18:59:02,183 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:59:02" (1/1) ... [2025-04-13 18:59:02,198 INFO L138 Inliner]: procedures = 168, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2025-04-13 18:59:02,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:59:02,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:59:02,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:59:02,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:59:02,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:59:02" (1/1) ... [2025-04-13 18:59:02,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:59:02" (1/1) ... [2025-04-13 18:59:02,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:59:02" (1/1) ... [2025-04-13 18:59:02,232 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2025-04-13 18:59:02,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:59:02" (1/1) ... [2025-04-13 18:59:02,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:59:02" (1/1) ... [2025-04-13 18:59:02,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:59:02" (1/1) ... [2025-04-13 18:59:02,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:59:02" (1/1) ... [2025-04-13 18:59:02,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:59:02" (1/1) ... [2025-04-13 18:59:02,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:59:02" (1/1) ... [2025-04-13 18:59:02,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:59:02" (1/1) ... [2025-04-13 18:59:02,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:59:02,245 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:59:02,245 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:59:02,245 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:59:02,245 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:59:02" (1/1) ... [2025-04-13 18:59:02,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:59:02,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:59:02,267 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:59:02,270 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:59:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:59:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:59:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 18:59:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 18:59:02,286 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 18:59:02,287 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 18:59:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 18:59:02,287 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 18:59:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:59:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:59:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 18:59:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 18:59:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 18:59:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:59:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-13 18:59:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-13 18:59:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-13 18:59:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-04-13 18:59:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:59:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:59:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 18:59:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 18:59:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 18:59:02,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:59:02,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:59:02,288 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:59:02,399 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:59:02,400 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:59:02,573 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:59:02,574 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:59:02,574 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:59:02,845 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:59:02,846 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:59:02,849 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:59:02,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:59:02 BoogieIcfgContainer [2025-04-13 18:59:02,849 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:59:02,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:59:02,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:59:02,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:59:02,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:59:01" (1/3) ... [2025-04-13 18:59:02,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5587f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:59:02, skipping insertion in model container [2025-04-13 18:59:02,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:59:02" (2/3) ... [2025-04-13 18:59:02,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5587f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:59:02, skipping insertion in model container [2025-04-13 18:59:02,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:59:02" (3/3) ... [2025-04-13 18:59:02,857 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2025-04-13 18:59:02,866 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:59:02,867 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_bad.i that has 3 procedures, 23 locations, 24 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 18:59:02,867 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:59:02,911 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 18:59:02,933 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 26 transitions, 66 flow [2025-04-13 18:59:02,956 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 118 states, 115 states have (on average 2.6782608695652175) internal successors, (308), 117 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:02,977 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:59:02,986 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;@4985b80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:59:02,987 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 18:59:02,989 INFO L278 IsEmpty]: Start isEmpty. Operand has 118 states, 115 states have (on average 2.6782608695652175) internal successors, (308), 117 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:02,992 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 18:59:02,992 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:02,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 18:59:02,993 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 18:59:02,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:02,998 INFO L85 PathProgramCache]: Analyzing trace with hash 363357901, now seen corresponding path program 1 times [2025-04-13 18:59:03,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:03,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445870454] [2025-04-13 18:59:03,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:59:03,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:03,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 18:59:03,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 18:59:03,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:59:03,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:03,366 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:59:03,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:03,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445870454] [2025-04-13 18:59:03,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445870454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:03,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:03,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 18:59:03,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703671507] [2025-04-13 18:59:03,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:03,372 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 18:59:03,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:03,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 18:59:03,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 18:59:03,388 INFO L87 Difference]: Start difference. First operand has 118 states, 115 states have (on average 2.6782608695652175) internal successors, (308), 117 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:03,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:03,436 INFO L93 Difference]: Finished difference Result 148 states and 357 transitions. [2025-04-13 18:59:03,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 18:59:03,437 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-13 18:59:03,438 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:03,442 INFO L225 Difference]: With dead ends: 148 [2025-04-13 18:59:03,442 INFO L226 Difference]: Without dead ends: 92 [2025-04-13 18:59:03,444 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 18:59:03,446 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:03,446 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:59:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-13 18:59:03,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-04-13 18:59:03,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.3956043956043955) internal successors, (218), 91 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 218 transitions. [2025-04-13 18:59:03,471 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 218 transitions. Word has length 5 [2025-04-13 18:59:03,471 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:03,471 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 218 transitions. [2025-04-13 18:59:03,472 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 5.0) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:03,472 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 218 transitions. [2025-04-13 18:59:03,473 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 18:59:03,473 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:03,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:59:03,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:59:03,473 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 18:59:03,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:03,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1283109109, now seen corresponding path program 1 times [2025-04-13 18:59:03,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:03,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188527066] [2025-04-13 18:59:03,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:59:03,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:03,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 18:59:03,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 18:59:03,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:59:03,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:03,578 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:59:03,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:03,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188527066] [2025-04-13 18:59:03,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188527066] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:03,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:03,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 18:59:03,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103142629] [2025-04-13 18:59:03,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:03,580 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:59:03,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:03,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:59:03,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:59:03,580 INFO L87 Difference]: Start difference. First operand 92 states and 218 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:03,632 INFO L93 Difference]: Finished difference Result 127 states and 296 transitions. [2025-04-13 18:59:03,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:59:03,633 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-13 18:59:03,633 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:03,634 INFO L225 Difference]: With dead ends: 127 [2025-04-13 18:59:03,634 INFO L226 Difference]: Without dead ends: 114 [2025-04-13 18:59:03,635 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:59:03,635 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:03,635 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:59:03,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-04-13 18:59:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-04-13 18:59:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 2.398230088495575) internal successors, (271), 113 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 271 transitions. [2025-04-13 18:59:03,647 INFO L79 Accepts]: Start accepts. Automaton has 114 states and 271 transitions. Word has length 7 [2025-04-13 18:59:03,648 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:03,648 INFO L485 AbstractCegarLoop]: Abstraction has 114 states and 271 transitions. [2025-04-13 18:59:03,648 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:03,648 INFO L278 IsEmpty]: Start isEmpty. Operand 114 states and 271 transitions. [2025-04-13 18:59:03,650 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 18:59:03,650 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:03,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:59:03,650 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:59:03,650 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 18:59:03,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:03,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1719177504, now seen corresponding path program 1 times [2025-04-13 18:59:03,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:03,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325812178] [2025-04-13 18:59:03,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:59:03,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:03,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 18:59:03,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 18:59:03,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:59:03,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:03,791 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:59:03,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:03,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325812178] [2025-04-13 18:59:03,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325812178] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:03,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:03,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:59:03,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111439589] [2025-04-13 18:59:03,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:03,792 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:59:03,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:03,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:59:03,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:59:03,793 INFO L87 Difference]: Start difference. First operand 114 states and 271 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:03,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:03,845 INFO L93 Difference]: Finished difference Result 161 states and 386 transitions. [2025-04-13 18:59:03,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:59:03,847 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-13 18:59:03,847 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:03,848 INFO L225 Difference]: With dead ends: 161 [2025-04-13 18:59:03,848 INFO L226 Difference]: Without dead ends: 98 [2025-04-13 18:59:03,849 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:59:03,849 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:03,849 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:59:03,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-04-13 18:59:03,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2025-04-13 18:59:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 2.25) internal successors, (198), 89 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 198 transitions. [2025-04-13 18:59:03,855 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 198 transitions. Word has length 10 [2025-04-13 18:59:03,856 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:03,856 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 198 transitions. [2025-04-13 18:59:03,856 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:03,856 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 198 transitions. [2025-04-13 18:59:03,856 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 18:59:03,856 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:03,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:59:03,856 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:59:03,859 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 18:59:03,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:03,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1754986030, now seen corresponding path program 1 times [2025-04-13 18:59:03,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:03,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851550062] [2025-04-13 18:59:03,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:59:03,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:03,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 18:59:03,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 18:59:03,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:59:03,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 18:59:03,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [675299206] [2025-04-13 18:59:03,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:59:03,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:59:03,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:59:03,952 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:59:03,953 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:59:04,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 18:59:04,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 18:59:04,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:59:04,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:04,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 18:59:04,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:59:04,250 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 11 treesize of output 7 [2025-04-13 18:59:04,317 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:59:04,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:59:04,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:04,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851550062] [2025-04-13 18:59:04,318 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 18:59:04,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675299206] [2025-04-13 18:59:04,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675299206] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:04,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:04,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:59:04,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458337941] [2025-04-13 18:59:04,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:04,318 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:59:04,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:04,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:59:04,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:59:04,319 INFO L87 Difference]: Start difference. First operand 90 states and 198 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:04,447 INFO L93 Difference]: Finished difference Result 173 states and 387 transitions. [2025-04-13 18:59:04,447 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:59:04,448 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-13 18:59:04,448 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:04,449 INFO L225 Difference]: With dead ends: 173 [2025-04-13 18:59:04,449 INFO L226 Difference]: Without dead ends: 166 [2025-04-13 18:59:04,449 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:59:04,449 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:04,449 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:59:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-04-13 18:59:04,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 127. [2025-04-13 18:59:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 125 states have (on average 2.24) internal successors, (280), 126 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:04,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 280 transitions. [2025-04-13 18:59:04,462 INFO L79 Accepts]: Start accepts. Automaton has 127 states and 280 transitions. Word has length 11 [2025-04-13 18:59:04,462 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:04,462 INFO L485 AbstractCegarLoop]: Abstraction has 127 states and 280 transitions. [2025-04-13 18:59:04,462 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:04,462 INFO L278 IsEmpty]: Start isEmpty. Operand 127 states and 280 transitions. [2025-04-13 18:59:04,463 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 18:59:04,463 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:04,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:59:04,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 18:59:04,663 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:59:04,664 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 18:59:04,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:04,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1751324620, now seen corresponding path program 2 times [2025-04-13 18:59:04,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:04,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748273957] [2025-04-13 18:59:04,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:59:04,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:04,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 1 equivalence classes. [2025-04-13 18:59:04,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 18:59:04,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:59:04,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 18:59:04,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [328336270] [2025-04-13 18:59:04,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:59:04,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:59:04,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:59:04,709 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:59:04,726 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:59:04,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 1 equivalence classes. [2025-04-13 18:59:04,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 18:59:04,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:59:04,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:04,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 18:59:04,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:59:05,000 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 11 treesize of output 7 [2025-04-13 18:59:05,043 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:59:05,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:59:05,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:05,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748273957] [2025-04-13 18:59:05,044 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 18:59:05,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328336270] [2025-04-13 18:59:05,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328336270] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:05,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:05,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:59:05,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463005994] [2025-04-13 18:59:05,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:05,044 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:59:05,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:05,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:59:05,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:59:05,045 INFO L87 Difference]: Start difference. First operand 127 states and 280 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:05,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:05,163 INFO L93 Difference]: Finished difference Result 179 states and 392 transitions. [2025-04-13 18:59:05,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:59:05,164 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-13 18:59:05,164 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:05,165 INFO L225 Difference]: With dead ends: 179 [2025-04-13 18:59:05,165 INFO L226 Difference]: Without dead ends: 172 [2025-04-13 18:59:05,165 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:59:05,165 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:05,166 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:59:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-04-13 18:59:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 131. [2025-04-13 18:59:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 129 states have (on average 2.2325581395348837) internal successors, (288), 130 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 288 transitions. [2025-04-13 18:59:05,175 INFO L79 Accepts]: Start accepts. Automaton has 131 states and 288 transitions. Word has length 11 [2025-04-13 18:59:05,175 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:05,175 INFO L485 AbstractCegarLoop]: Abstraction has 131 states and 288 transitions. [2025-04-13 18:59:05,175 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:05,175 INFO L278 IsEmpty]: Start isEmpty. Operand 131 states and 288 transitions. [2025-04-13 18:59:05,179 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 18:59:05,179 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:05,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:59:05,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 18:59:05,380 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:59:05,380 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 18:59:05,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:05,381 INFO L85 PathProgramCache]: Analyzing trace with hash 741964664, now seen corresponding path program 3 times [2025-04-13 18:59:05,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:05,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388694462] [2025-04-13 18:59:05,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:59:05,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:05,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 1 equivalence classes. [2025-04-13 18:59:05,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 18:59:05,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:59:05,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 18:59:05,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1198807075] [2025-04-13 18:59:05,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:59:05,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:59:05,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:59:05,419 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:59:05,420 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:59:05,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 1 equivalence classes. [2025-04-13 18:59:05,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 18:59:05,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:59:05,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:05,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 18:59:05,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:59:05,819 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-13 18:59:05,897 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:59:05,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:59:05,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:05,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388694462] [2025-04-13 18:59:05,897 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 18:59:05,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198807075] [2025-04-13 18:59:05,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198807075] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:05,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:59:05,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:59:05,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141605640] [2025-04-13 18:59:05,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:05,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:59:05,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:05,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:59:05,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:59:05,898 INFO L87 Difference]: Start difference. First operand 131 states and 288 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:06,039 INFO L93 Difference]: Finished difference Result 199 states and 436 transitions. [2025-04-13 18:59:06,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:59:06,039 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-13 18:59:06,039 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:06,040 INFO L225 Difference]: With dead ends: 199 [2025-04-13 18:59:06,040 INFO L226 Difference]: Without dead ends: 192 [2025-04-13 18:59:06,041 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:59:06,041 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:06,041 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:59:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-04-13 18:59:06,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 133. [2025-04-13 18:59:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 131 states have (on average 2.236641221374046) internal successors, (293), 132 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:06,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 293 transitions. [2025-04-13 18:59:06,046 INFO L79 Accepts]: Start accepts. Automaton has 133 states and 293 transitions. Word has length 11 [2025-04-13 18:59:06,046 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:06,046 INFO L485 AbstractCegarLoop]: Abstraction has 133 states and 293 transitions. [2025-04-13 18:59:06,046 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:06,046 INFO L278 IsEmpty]: Start isEmpty. Operand 133 states and 293 transitions. [2025-04-13 18:59:06,046 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:59:06,046 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:06,046 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:59:06,053 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:59:06,251 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:59:06,251 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 18:59:06,251 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:06,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1880885045, now seen corresponding path program 1 times [2025-04-13 18:59:06,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:06,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898230873] [2025-04-13 18:59:06,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:59:06,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:06,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:59:06,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:59:06,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:59:06,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 18:59:06,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1610696735] [2025-04-13 18:59:06,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:59:06,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:59:06,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:59:06,334 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:59:06,336 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:59:06,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:59:06,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:59:06,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:59:06,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:06,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 18:59:06,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:59:06,571 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 8 treesize of output 1 [2025-04-13 18:59:06,578 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 8 treesize of output 1 [2025-04-13 18:59:06,584 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 11 treesize of output 7 [2025-04-13 18:59:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:59:06,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:59:07,377 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-13 18:59:07,383 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-04-13 18:59:08,351 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 313 treesize of output 297 [2025-04-13 18:59:08,445 INFO L325 Elim1Store]: treesize reduction 185, result has 29.1 percent of original size [2025-04-13 18:59:08,445 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 297 treesize of output 468 [2025-04-13 18:59:11,480 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:59:11,480 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 536 treesize of output 464 [2025-04-13 18:59:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:59:12,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:12,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898230873] [2025-04-13 18:59:12,220 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 18:59:12,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610696735] [2025-04-13 18:59:12,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610696735] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:59:12,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:59:12,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2025-04-13 18:59:12,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803663242] [2025-04-13 18:59:12,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-13 18:59:12,221 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:59:12,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:12,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:59:12,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:59:12,221 INFO L87 Difference]: Start difference. First operand 133 states and 293 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:13,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:13,044 INFO L93 Difference]: Finished difference Result 264 states and 604 transitions. [2025-04-13 18:59:13,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:59:13,045 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 18:59:13,045 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:13,046 INFO L225 Difference]: With dead ends: 264 [2025-04-13 18:59:13,046 INFO L226 Difference]: Without dead ends: 257 [2025-04-13 18:59:13,047 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:59:13,047 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:13,047 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:59:13,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-04-13 18:59:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 124. [2025-04-13 18:59:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 122 states have (on average 2.237704918032787) internal successors, (273), 123 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 273 transitions. [2025-04-13 18:59:13,055 INFO L79 Accepts]: Start accepts. Automaton has 124 states and 273 transitions. Word has length 15 [2025-04-13 18:59:13,055 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:13,055 INFO L485 AbstractCegarLoop]: Abstraction has 124 states and 273 transitions. [2025-04-13 18:59:13,055 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:13,055 INFO L278 IsEmpty]: Start isEmpty. Operand 124 states and 273 transitions. [2025-04-13 18:59:13,055 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:59:13,058 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:13,058 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:59:13,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 18:59:13,258 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:59:13,259 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 18:59:13,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:13,259 INFO L85 PathProgramCache]: Analyzing trace with hash -402409419, now seen corresponding path program 1 times [2025-04-13 18:59:13,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:13,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795725914] [2025-04-13 18:59:13,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:59:13,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:13,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:59:13,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:59:13,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:59:13,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:13,456 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:59:13,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:13,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795725914] [2025-04-13 18:59:13,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795725914] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:59:13,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793420133] [2025-04-13 18:59:13,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:59:13,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:59:13,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:59:13,458 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:59:13,460 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:59:13,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:59:13,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:59:13,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:59:13,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:13,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 18:59:13,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:59:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:59:13,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:59:13,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793420133] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:59:13,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:59:13,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2025-04-13 18:59:13,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850268108] [2025-04-13 18:59:13,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:59:13,596 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:59:13,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:13,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:59:13,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:59:13,597 INFO L87 Difference]: Start difference. First operand 124 states and 273 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:13,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:13,642 INFO L93 Difference]: Finished difference Result 156 states and 345 transitions. [2025-04-13 18:59:13,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:59:13,643 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 18:59:13,643 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:13,644 INFO L225 Difference]: With dead ends: 156 [2025-04-13 18:59:13,644 INFO L226 Difference]: Without dead ends: 126 [2025-04-13 18:59:13,644 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:59:13,645 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:13,645 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:59:13,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-04-13 18:59:13,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2025-04-13 18:59:13,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 2.2115384615384617) internal successors, (230), 105 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 230 transitions. [2025-04-13 18:59:13,649 INFO L79 Accepts]: Start accepts. Automaton has 106 states and 230 transitions. Word has length 15 [2025-04-13 18:59:13,649 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:13,649 INFO L485 AbstractCegarLoop]: Abstraction has 106 states and 230 transitions. [2025-04-13 18:59:13,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:13,650 INFO L278 IsEmpty]: Start isEmpty. Operand 106 states and 230 transitions. [2025-04-13 18:59:13,650 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:59:13,650 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:13,650 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:59:13,660 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:59:13,858 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:59:13,858 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 18:59:13,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:13,858 INFO L85 PathProgramCache]: Analyzing trace with hash 723324657, now seen corresponding path program 2 times [2025-04-13 18:59:13,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:13,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100985329] [2025-04-13 18:59:13,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:59:13,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:13,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:59:13,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:59:13,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:59:13,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 18:59:13,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1321070925] [2025-04-13 18:59:13,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:59:13,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:59:13,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:59:13,931 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:59:13,932 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:59:13,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:59:14,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:59:14,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:59:14,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:59:14,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 18:59:14,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:59:14,198 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-13 18:59:14,209 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 8 treesize of output 1 [2025-04-13 18:59:14,213 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 8 treesize of output 1 [2025-04-13 18:59:14,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:59:14,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:59:14,693 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-04-13 18:59:14,703 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-13 18:59:20,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:59:20,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:59:20,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100985329] [2025-04-13 18:59:20,879 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 18:59:20,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321070925] [2025-04-13 18:59:20,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321070925] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:59:20,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:59:20,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2025-04-13 18:59:20,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787306649] [2025-04-13 18:59:20,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-13 18:59:20,879 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:59:20,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:59:20,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:59:20,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:59:20,880 INFO L87 Difference]: Start difference. First operand 106 states and 230 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:23,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:59:23,307 INFO L93 Difference]: Finished difference Result 306 states and 675 transitions. [2025-04-13 18:59:23,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:59:23,308 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 18:59:23,308 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:59:23,309 INFO L225 Difference]: With dead ends: 306 [2025-04-13 18:59:23,309 INFO L226 Difference]: Without dead ends: 284 [2025-04-13 18:59:23,309 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:59:23,310 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:59:23,310 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:59:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-04-13 18:59:23,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 124. [2025-04-13 18:59:23,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 122 states have (on average 2.2295081967213113) internal successors, (272), 123 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:23,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 272 transitions. [2025-04-13 18:59:23,315 INFO L79 Accepts]: Start accepts. Automaton has 124 states and 272 transitions. Word has length 15 [2025-04-13 18:59:23,315 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:59:23,315 INFO L485 AbstractCegarLoop]: Abstraction has 124 states and 272 transitions. [2025-04-13 18:59:23,315 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:59:23,315 INFO L278 IsEmpty]: Start isEmpty. Operand 124 states and 272 transitions. [2025-04-13 18:59:23,316 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:59:23,316 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:59:23,316 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:59:23,324 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:59:23,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:59:23,516 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 18:59:23,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:59:23,517 INFO L85 PathProgramCache]: Analyzing trace with hash -242368987, now seen corresponding path program 2 times [2025-04-13 18:59:23,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:59:23,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953644984] [2025-04-13 18:59:23,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:59:23,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:59:23,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:59:23,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:59:23,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:59:23,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 18:59:23,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [613494950] [2025-04-13 18:59:23,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:59:23,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:59:23,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:59:23,567 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:59:23,568 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:59:23,624 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:59:23,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:59:23,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:59:23,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 18:59:23,755 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 18:59:23,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:59:23,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:59:23,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:59:23,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 18:59:23,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 18:59:23,830 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 18:59:23,830 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 18:59:23,831 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-13 18:59:23,832 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 18:59:23,832 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 18:59:23,832 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 18:59:23,832 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 18:59:23,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 18:59:24,032 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:59:24,035 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1] [2025-04-13 18:59:24,074 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:59:24,074 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:59:24,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:59:24 BasicIcfg [2025-04-13 18:59:24,076 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:59:24,076 INFO L158 Benchmark]: Toolchain (without parser) took 22310.48ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 99.9MB in the beginning and 181.4MB in the end (delta: -81.5MB). Peak memory consumption was 152.4MB. Max. memory is 8.0GB. [2025-04-13 18:59:24,076 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 159.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:59:24,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.97ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 75.5MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 18:59:24,076 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.72ms. Allocated memory is still 142.6MB. Free memory was 75.5MB in the beginning and 73.2MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:59:24,077 INFO L158 Benchmark]: Boogie Preprocessor took 45.22ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 70.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:59:24,077 INFO L158 Benchmark]: RCFGBuilder took 604.93ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 65.0MB in the end (delta: 5.8MB). Peak memory consumption was 52.9MB. Max. memory is 8.0GB. [2025-04-13 18:59:24,077 INFO L158 Benchmark]: TraceAbstraction took 21223.44ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 65.0MB in the beginning and 181.4MB in the end (delta: -116.4MB). Peak memory consumption was 116.3MB. Max. memory is 8.0GB. [2025-04-13 18:59:24,079 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.12ms. Allocated memory is still 159.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 403.97ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 75.5MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.72ms. Allocated memory is still 142.6MB. Free memory was 75.5MB in the beginning and 73.2MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.22ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 70.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 604.93ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 65.0MB in the end (delta: 5.8MB). Peak memory consumption was 52.9MB. Max. memory is 8.0GB. * TraceAbstraction took 21223.44ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 65.0MB in the beginning and 181.4MB in the end (delta: -116.4MB). Peak memory consumption was 116.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 746]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L683] 0 static unsigned int first; [L684] 0 static unsigned int next; [L685] 0 static int buffer_size; [L686] 0 _Bool send, receive; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L756] 0 pthread_t id1, id2; [L758] CALL 0 initLog(10) [L690] 0 buffer_size = max [L691] EXPR 0 next = 0 [L691] 0 first = next = 0 [L758] RET 0 initLog(10) [L759] 0 send=1 [L760] 0 receive=0 [L761] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, m={4:0}, next=0, receive=0, send=1] [L723] 1 int i; [L724] 1 i=0 [L724] COND TRUE 1 i<7 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, id2=0, m={4:0}, next=0, receive=0, send=1] [L739] 2 int i; [L740] 2 i=0 [L740] COND TRUE 2 i<7 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L743] COND FALSE 2 !(\read(receive)) VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L740] 2 i++ [L740] COND TRUE 2 i<7 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 [L709] 1 buffer[next] = b [L710] 1 next = (next+1)%buffer_size [L712] COND TRUE 1 next 0 && first < buffer_size [L697] 2 first++ [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) [L746] 2 reach_error() VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=1, m={4:0}, next=1, receive=1, send=0] - UnprovableResult [Line: 762]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 39 locations, 46 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 21.1s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 289 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 289 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1098 IncrementalHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 0 mSDtfsCounter, 1098 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=6, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 460 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 7514 SizeOfPredicates, 58 NumberOfNonLiveVariables, 1080 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 3/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 18:59:24,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...