/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 PETRI_NET -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 21:06:09,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:06:09,613 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 21:06:09,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:06:09,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:06:09,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:06:09,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:06:09,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:06:09,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:06:09,639 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:06:09,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:06:09,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:06:09,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:06:09,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:06:09,639 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:06:09,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:06:09,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:06:09,640 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:06:09,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:06:09,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:06:09,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:06:09,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:06:09,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:06:09,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:06:09,640 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:06:09,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:06:09,640 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:06:09,640 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:06:09,640 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:06:09,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:06:09,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:06:09,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:06:09,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:06:09,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:06:09,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:06:09,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:06:09,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:06:09,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:06:09,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:06:09,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:06:09,641 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:06:09,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:06:09,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:06:09,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:06:09,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:06:09,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:06:09,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:06:09,641 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 -> PETRI_NET [2025-04-13 21:06:09,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:06:09,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:06:09,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:06:09,863 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:06:09,863 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:06:09,865 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 21:06:11,153 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f2b76f98/377f518c3c9b47b58b0c5c92259260cc/FLAG4f48c452d [2025-04-13 21:06:11,393 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:06:11,394 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i [2025-04-13 21:06:11,402 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f2b76f98/377f518c3c9b47b58b0c5c92259260cc/FLAG4f48c452d [2025-04-13 21:06:12,355 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f2b76f98/377f518c3c9b47b58b0c5c92259260cc [2025-04-13 21:06:12,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:06:12,357 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:06:12,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:06:12,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:06:12,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:06:12,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34fa7e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12, skipping insertion in model container [2025-04-13 21:06:12,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,383 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:06:12,665 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 21:06:12,680 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 21:06:12,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:06:12,699 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:06:12,751 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 21:06:12,756 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 21:06:12,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:06:12,789 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:06:12,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12 WrapperNode [2025-04-13 21:06:12,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:06:12,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:06:12,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:06:12,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:06:12,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,829 INFO L138 Inliner]: procedures = 168, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2025-04-13 21:06:12,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:06:12,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:06:12,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:06:12,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:06:12,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,864 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 21:06:12,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,871 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:06:12,886 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 21:06:12,886 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 21:06:12,886 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 21:06:12,887 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (1/1) ... [2025-04-13 21:06:12,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:06:12,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:12,911 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 21:06:12,917 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 21:06:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 21:06:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 21:06:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 21:06:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 21:06:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 21:06:12,931 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 21:06:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 21:06:12,931 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 21:06:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 21:06:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 21:06:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 21:06:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 21:06:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 21:06:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:06:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-13 21:06:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-13 21:06:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-13 21:06:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-04-13 21:06:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:06:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:06:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 21:06:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 21:06:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 21:06:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:06:12,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:06:12,933 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 21:06:13,038 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 21:06:13,039 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:06:13,238 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:06:13,239 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:06:13,239 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 21:06:13,538 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:06:13,540 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:06:13,544 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:06:13,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:06:13 BoogieIcfgContainer [2025-04-13 21:06:13,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 21:06:13,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:06:13,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:06:13,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:06:13,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:06:12" (1/3) ... [2025-04-13 21:06:13,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53692d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:06:13, skipping insertion in model container [2025-04-13 21:06:13,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:12" (2/3) ... [2025-04-13 21:06:13,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53692d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:06:13, skipping insertion in model container [2025-04-13 21:06:13,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:06:13" (3/3) ... [2025-04-13 21:06:13,552 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2025-04-13 21:06:13,563 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:06:13,566 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 21:06:13,566 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:06:13,629 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:06:13,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 66 flow [2025-04-13 21:06:13,695 INFO L116 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-04-13 21:06:13,696 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:06:13,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 4/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-13 21:06:13,701 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 66 flow [2025-04-13 21:06:13,704 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 22 transitions, 53 flow [2025-04-13 21:06:13,712 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:06:13,724 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=PETRI_NET, 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;@1dd26841, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:06:13,724 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 21:06:13,729 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:06:13,729 INFO L116 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-04-13 21:06:13,729 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 21:06:13,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:13,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 21:06:13,730 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 21:06:13,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:13,734 INFO L85 PathProgramCache]: Analyzing trace with hash 363357901, now seen corresponding path program 1 times [2025-04-13 21:06:13,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:13,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957788674] [2025-04-13 21:06:13,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:13,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:13,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 21:06:13,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 21:06:13,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:13,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:14,133 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 21:06:14,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:14,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957788674] [2025-04-13 21:06:14,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957788674] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:06:14,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:06:14,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:06:14,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048045028] [2025-04-13 21:06:14,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:14,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:06:14,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:14,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:06:14,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:06:14,159 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 21:06:14,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 53 flow. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:14,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:14,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 21:06:14,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:14,237 INFO L116 PetriNetUnfolderBase]: 146/250 cut-off events. [2025-04-13 21:06:14,237 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-13 21:06:14,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 250 events. 146/250 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 716 event pairs, 117 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 480. Up to 251 conditions per place. [2025-04-13 21:06:14,243 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 18 selfloop transitions, 0 changer transitions 1/19 dead transitions. [2025-04-13 21:06:14,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 19 transitions, 85 flow [2025-04-13 21:06:14,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:06:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 21:06:14,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2025-04-13 21:06:14,254 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 21:06:14,255 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 53 flow. Second operand 2 states and 26 transitions. [2025-04-13 21:06:14,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 19 transitions, 85 flow [2025-04-13 21:06:14,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 19 transitions, 80 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 21:06:14,259 INFO L231 Difference]: Finished difference. Result has 22 places, 18 transitions, 40 flow [2025-04-13 21:06:14,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=22, PETRI_TRANSITIONS=18} [2025-04-13 21:06:14,263 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -3 predicate places. [2025-04-13 21:06:14,264 INFO L485 AbstractCegarLoop]: Abstraction has has 22 places, 18 transitions, 40 flow [2025-04-13 21:06:14,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:14,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:14,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:14,264 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:06:14,264 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 21:06:14,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:14,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1283109109, now seen corresponding path program 1 times [2025-04-13 21:06:14,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:14,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540796526] [2025-04-13 21:06:14,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:14,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:14,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:06:14,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:06:14,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:14,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:14,363 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 21:06:14,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:14,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540796526] [2025-04-13 21:06:14,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540796526] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:06:14,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:06:14,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:06:14,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213818742] [2025-04-13 21:06:14,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:14,364 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:06:14,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:14,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:06:14,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:06:14,365 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 21:06:14,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 18 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:14,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:14,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 21:06:14,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:14,484 INFO L116 PetriNetUnfolderBase]: 158/271 cut-off events. [2025-04-13 21:06:14,484 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 21:06:14,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 271 events. 158/271 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 883 event pairs, 43 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 559. Up to 195 conditions per place. [2025-04-13 21:06:14,486 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 26 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2025-04-13 21:06:14,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 28 transitions, 118 flow [2025-04-13 21:06:14,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:06:14,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:06:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2025-04-13 21:06:14,488 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2025-04-13 21:06:14,488 INFO L175 Difference]: Start difference. First operand has 22 places, 18 transitions, 40 flow. Second operand 3 states and 35 transitions. [2025-04-13 21:06:14,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 28 transitions, 118 flow [2025-04-13 21:06:14,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 28 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 21:06:14,490 INFO L231 Difference]: Finished difference. Result has 24 places, 19 transitions, 52 flow [2025-04-13 21:06:14,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=24, PETRI_TRANSITIONS=19} [2025-04-13 21:06:14,490 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2025-04-13 21:06:14,491 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 19 transitions, 52 flow [2025-04-13 21:06:14,491 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:14,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:14,491 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:14,491 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:06:14,491 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 21:06:14,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:14,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1717272666, now seen corresponding path program 1 times [2025-04-13 21:06:14,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:14,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633864968] [2025-04-13 21:06:14,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:14,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:14,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:06:14,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:06:14,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:14,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:14,656 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 21:06:14,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:14,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633864968] [2025-04-13 21:06:14,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633864968] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:06:14,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:06:14,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:06:14,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645318415] [2025-04-13 21:06:14,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:14,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:06:14,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:14,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:06:14,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:06:14,658 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 21:06:14,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 19 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:14,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:14,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 21:06:14,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:14,740 INFO L116 PetriNetUnfolderBase]: 118/215 cut-off events. [2025-04-13 21:06:14,740 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 21:06:14,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 215 events. 118/215 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 694 event pairs, 40 based on Foata normal form. 16/217 useless extension candidates. Maximal degree in co-relation 479. Up to 120 conditions per place. [2025-04-13 21:06:14,743 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 24 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2025-04-13 21:06:14,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 129 flow [2025-04-13 21:06:14,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:06:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:06:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2025-04-13 21:06:14,745 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2025-04-13 21:06:14,745 INFO L175 Difference]: Start difference. First operand has 24 places, 19 transitions, 52 flow. Second operand 3 states and 35 transitions. [2025-04-13 21:06:14,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 129 flow [2025-04-13 21:06:14,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 127 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:06:14,747 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 58 flow [2025-04-13 21:06:14,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2025-04-13 21:06:14,747 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2025-04-13 21:06:14,747 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 58 flow [2025-04-13 21:06:14,748 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:14,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:14,748 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:14,748 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:06:14,748 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 21:06:14,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2127780622, now seen corresponding path program 1 times [2025-04-13 21:06:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:14,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757115751] [2025-04-13 21:06:14,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:14,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:14,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:06:14,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:06:14,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:14,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 21:06:14,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [796498268] [2025-04-13 21:06:14,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:14,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:14,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:14,822 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 21:06:14,824 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 21:06:14,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:06:14,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:06:14,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:14,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:14,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 21:06:14,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:15,165 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 21:06:15,260 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 21:06:15,260 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 21:06:15,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:15,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757115751] [2025-04-13 21:06:15,261 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 21:06:15,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796498268] [2025-04-13 21:06:15,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796498268] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:06:15,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:06:15,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:06:15,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309032481] [2025-04-13 21:06:15,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:15,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:06:15,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:15,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:06:15,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:06:15,262 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 21:06:15,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 58 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:15,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:15,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 21:06:15,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:15,463 INFO L116 PetriNetUnfolderBase]: 207/372 cut-off events. [2025-04-13 21:06:15,463 INFO L117 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-04-13 21:06:15,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 372 events. 207/372 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1367 event pairs, 14 based on Foata normal form. 7/351 useless extension candidates. Maximal degree in co-relation 892. Up to 174 conditions per place. [2025-04-13 21:06:15,468 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 50 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2025-04-13 21:06:15,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 59 transitions, 292 flow [2025-04-13 21:06:15,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:06:15,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:06:15,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2025-04-13 21:06:15,471 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2025-04-13 21:06:15,471 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 58 flow. Second operand 6 states and 72 transitions. [2025-04-13 21:06:15,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 59 transitions, 292 flow [2025-04-13 21:06:15,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 59 transitions, 277 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:06:15,473 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 110 flow [2025-04-13 21:06:15,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2025-04-13 21:06:15,473 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 6 predicate places. [2025-04-13 21:06:15,473 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 110 flow [2025-04-13 21:06:15,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:15,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:15,474 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:15,481 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 21:06:15,675 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 21:06:15,676 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 21:06:15,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash 741964664, now seen corresponding path program 2 times [2025-04-13 21:06:15,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:15,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778814383] [2025-04-13 21:06:15,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:06:15,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:15,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:06:15,702 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:06:15,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:06:15,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 21:06:15,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [397856361] [2025-04-13 21:06:15,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:06:15,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:15,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:15,707 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 21:06:15,709 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 21:06:15,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:06:15,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:06:15,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:06:15,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:15,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 21:06:15,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:16,030 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 21:06:16,068 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 21:06:16,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 21:06:16,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:16,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778814383] [2025-04-13 21:06:16,069 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 21:06:16,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397856361] [2025-04-13 21:06:16,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397856361] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:06:16,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:06:16,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:06:16,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635785946] [2025-04-13 21:06:16,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:16,069 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:06:16,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:16,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:06:16,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:06:16,070 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 21:06:16,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 110 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:16,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:16,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 21:06:16,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:16,292 INFO L116 PetriNetUnfolderBase]: 279/505 cut-off events. [2025-04-13 21:06:16,293 INFO L117 PetriNetUnfolderBase]: For 241/241 co-relation queries the response was YES. [2025-04-13 21:06:16,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 505 events. 279/505 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2053 event pairs, 68 based on Foata normal form. 7/478 useless extension candidates. Maximal degree in co-relation 1345. Up to 334 conditions per place. [2025-04-13 21:06:16,296 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 48 selfloop transitions, 11 changer transitions 0/59 dead transitions. [2025-04-13 21:06:16,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 59 transitions, 345 flow [2025-04-13 21:06:16,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:06:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:06:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2025-04-13 21:06:16,299 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2025-04-13 21:06:16,299 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 110 flow. Second operand 6 states and 66 transitions. [2025-04-13 21:06:16,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 59 transitions, 345 flow [2025-04-13 21:06:16,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 59 transitions, 330 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 21:06:16,303 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 186 flow [2025-04-13 21:06:16,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-04-13 21:06:16,305 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 12 predicate places. [2025-04-13 21:06:16,305 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 186 flow [2025-04-13 21:06:16,305 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:16,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:16,305 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:16,312 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 21:06:16,508 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 21:06:16,508 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 21:06:16,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:16,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1071255302, now seen corresponding path program 3 times [2025-04-13 21:06:16,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:16,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998194712] [2025-04-13 21:06:16,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:06:16,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:16,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:06:16,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:06:16,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:06:16,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 21:06:16,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790422344] [2025-04-13 21:06:16,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:06:16,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:16,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:16,552 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 21:06:16,553 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 21:06:16,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:06:16,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:06:16,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:06:16,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:16,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 21:06:16,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:16,828 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 21:06:16,881 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 21:06:16,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 21:06:16,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:16,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998194712] [2025-04-13 21:06:16,882 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 21:06:16,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790422344] [2025-04-13 21:06:16,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790422344] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:06:16,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:06:16,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:06:16,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108192178] [2025-04-13 21:06:16,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:16,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:06:16,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:16,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:06:16,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:06:16,883 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 21:06:16,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:16,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:16,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 21:06:16,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:17,094 INFO L116 PetriNetUnfolderBase]: 315/570 cut-off events. [2025-04-13 21:06:17,094 INFO L117 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2025-04-13 21:06:17,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1702 conditions, 570 events. 315/570 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2333 event pairs, 57 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 1690. Up to 399 conditions per place. [2025-04-13 21:06:17,098 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 55 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2025-04-13 21:06:17,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 66 transitions, 432 flow [2025-04-13 21:06:17,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:06:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 21:06:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2025-04-13 21:06:17,099 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2025-04-13 21:06:17,099 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 186 flow. Second operand 6 states and 66 transitions. [2025-04-13 21:06:17,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 66 transitions, 432 flow [2025-04-13 21:06:17,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 66 transitions, 432 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 21:06:17,107 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 265 flow [2025-04-13 21:06:17,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=265, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-04-13 21:06:17,107 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 20 predicate places. [2025-04-13 21:06:17,107 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 265 flow [2025-04-13 21:06:17,107 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:17,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:17,107 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:17,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 21:06:17,308 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 21:06:17,308 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 21:06:17,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:17,309 INFO L85 PathProgramCache]: Analyzing trace with hash 924689355, now seen corresponding path program 1 times [2025-04-13 21:06:17,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:17,310 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41858154] [2025-04-13 21:06:17,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:17,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:17,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:06:17,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:06:17,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:17,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 21:06:17,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1918430699] [2025-04-13 21:06:17,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:17,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:17,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:17,385 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 21:06:17,386 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 21:06:17,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:06:17,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:06:17,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:17,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:17,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 21:06:17,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:17,679 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 21:06:17,690 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 21:06:17,718 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 21:06:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:18,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:06:18,778 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 21:06:18,784 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 21:06:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:23,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:23,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41858154] [2025-04-13 21:06:23,389 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 21:06:23,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918430699] [2025-04-13 21:06:23,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918430699] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:06:23,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-13 21:06:23,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2025-04-13 21:06:23,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93457440] [2025-04-13 21:06:23,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-13 21:06:23,390 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:06:23,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:23,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:06:23,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:06:23,390 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 21:06:23,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 265 flow. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:23,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:23,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 21:06:23,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:24,846 INFO L116 PetriNetUnfolderBase]: 454/808 cut-off events. [2025-04-13 21:06:24,846 INFO L117 PetriNetUnfolderBase]: For 906/906 co-relation queries the response was YES. [2025-04-13 21:06:24,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2550 conditions, 808 events. 454/808 cut-off events. For 906/906 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3355 event pairs, 14 based on Foata normal form. 7/746 useless extension candidates. Maximal degree in co-relation 2534. Up to 188 conditions per place. [2025-04-13 21:06:24,853 INFO L140 encePairwiseOnDemand]: 17/26 looper letters, 85 selfloop transitions, 44 changer transitions 0/129 dead transitions. [2025-04-13 21:06:24,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 129 transitions, 862 flow [2025-04-13 21:06:24,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 21:06:24,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 21:06:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 139 transitions. [2025-04-13 21:06:24,857 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41124260355029585 [2025-04-13 21:06:24,857 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 265 flow. Second operand 13 states and 139 transitions. [2025-04-13 21:06:24,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 129 transitions, 862 flow [2025-04-13 21:06:24,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 129 transitions, 836 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-13 21:06:24,864 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 570 flow [2025-04-13 21:06:24,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=570, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2025-04-13 21:06:24,865 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 37 predicate places. [2025-04-13 21:06:24,865 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 570 flow [2025-04-13 21:06:24,865 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:24,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:24,865 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:24,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 21:06:25,065 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 21:06:25,066 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 21:06:25,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:25,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1528500299, now seen corresponding path program 1 times [2025-04-13 21:06:25,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:25,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177816788] [2025-04-13 21:06:25,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:25,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:25,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:06:25,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:06:25,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:25,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:25,275 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 21:06:25,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:25,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177816788] [2025-04-13 21:06:25,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177816788] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:06:25,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102386807] [2025-04-13 21:06:25,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:25,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:25,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:25,279 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 21:06:25,279 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 21:06:25,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:06:25,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:06:25,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:25,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:25,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 21:06:25,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:25,403 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 21:06:25,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 21:06:25,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102386807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:06:25,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 21:06:25,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2025-04-13 21:06:25,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562440597] [2025-04-13 21:06:25,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:25,404 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:06:25,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:25,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:06:25,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:06:25,405 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 21:06:25,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:25,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:25,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 21:06:25,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:25,505 INFO L116 PetriNetUnfolderBase]: 466/836 cut-off events. [2025-04-13 21:06:25,505 INFO L117 PetriNetUnfolderBase]: For 2818/2818 co-relation queries the response was YES. [2025-04-13 21:06:25,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3363 conditions, 836 events. 466/836 cut-off events. For 2818/2818 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3530 event pairs, 124 based on Foata normal form. 14/784 useless extension candidates. Maximal degree in co-relation 3340. Up to 527 conditions per place. [2025-04-13 21:06:25,509 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 52 selfloop transitions, 19 changer transitions 2/73 dead transitions. [2025-04-13 21:06:25,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 73 transitions, 755 flow [2025-04-13 21:06:25,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:06:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:06:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-13 21:06:25,510 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47435897435897434 [2025-04-13 21:06:25,510 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 570 flow. Second operand 3 states and 37 transitions. [2025-04-13 21:06:25,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 73 transitions, 755 flow [2025-04-13 21:06:25,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 663 flow, removed 26 selfloop flow, removed 7 redundant places. [2025-04-13 21:06:25,519 INFO L231 Difference]: Finished difference. Result has 59 places, 65 transitions, 570 flow [2025-04-13 21:06:25,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=59, PETRI_TRANSITIONS=65} [2025-04-13 21:06:25,520 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 34 predicate places. [2025-04-13 21:06:25,520 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 65 transitions, 570 flow [2025-04-13 21:06:25,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:25,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:25,520 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:25,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 21:06:25,720 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 21:06:25,721 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 21:06:25,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:25,721 INFO L85 PathProgramCache]: Analyzing trace with hash -79251749, now seen corresponding path program 2 times [2025-04-13 21:06:25,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:25,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726342193] [2025-04-13 21:06:25,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:06:25,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:25,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:06:25,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:06:25,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:06:25,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 21:06:25,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [309021405] [2025-04-13 21:06:25,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:06:25,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:25,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:25,769 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 21:06:25,771 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 21:06:25,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:06:25,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:06:25,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:06:25,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:06:25,932 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:06:25,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:06:25,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:06:25,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:25,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:06:25,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:06:25,991 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:06:25,992 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 21:06:25,993 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-13 21:06:25,993 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 21:06:25,993 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 21:06:25,993 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 21:06:25,993 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 21:06:26,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 21:06:26,194 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 21:06:26,194 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2025-04-13 21:06:26,237 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:06:26,237 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:06:26,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:06:26 BasicIcfg [2025-04-13 21:06:26,240 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:06:26,241 INFO L158 Benchmark]: Toolchain (without parser) took 13883.51ms. Allocated memory was 142.6MB in the beginning and 398.5MB in the end (delta: 255.9MB). Free memory was 97.9MB in the beginning and 130.4MB in the end (delta: -32.5MB). Peak memory consumption was 223.8MB. Max. memory is 8.0GB. [2025-04-13 21:06:26,241 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 167.8MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:06:26,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.43ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 73.9MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 21:06:26,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.93ms. Allocated memory is still 142.6MB. Free memory was 73.9MB in the beginning and 71.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:06:26,241 INFO L158 Benchmark]: Boogie Preprocessor took 56.25ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 69.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:06:26,242 INFO L158 Benchmark]: RCFGBuilder took 658.56ms. Allocated memory is still 142.6MB. Free memory was 69.0MB in the beginning and 64.3MB in the end (delta: 4.7MB). Peak memory consumption was 52.9MB. Max. memory is 8.0GB. [2025-04-13 21:06:26,242 INFO L158 Benchmark]: TraceAbstraction took 12693.90ms. Allocated memory was 142.6MB in the beginning and 398.5MB in the end (delta: 255.9MB). Free memory was 63.6MB in the beginning and 130.4MB in the end (delta: -66.8MB). Peak memory consumption was 187.6MB. Max. memory is 8.0GB. [2025-04-13 21:06:26,244 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.24ms. Allocated memory is still 167.8MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 433.43ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 73.9MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.93ms. Allocated memory is still 142.6MB. Free memory was 73.9MB in the beginning and 71.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 56.25ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 69.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 658.56ms. Allocated memory is still 142.6MB. Free memory was 69.0MB in the beginning and 64.3MB in the end (delta: 4.7MB). Peak memory consumption was 52.9MB. Max. memory is 8.0GB. * TraceAbstraction took 12693.90ms. Allocated memory was 142.6MB in the beginning and 398.5MB in the end (delta: 255.9MB). Free memory was 63.6MB in the beginning and 130.4MB in the end (delta: -66.8MB). Peak memory consumption was 187.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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] [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] [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] [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. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.5s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 196 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 196 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 825 IncrementalHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 0 mSDtfsCounter, 825 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=570occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 4502 SizeOfPredicates, 46 NumberOfNonLiveVariables, 885 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 2/6 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 21:06:26,288 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...