/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -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-14 01:44:49,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:44:49,387 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-14 01:44:49,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:44:49,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:44:49,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:44:49,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:44:49,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:44:49,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:44:49,415 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:44:49,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:44:49,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:44:49,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:44:49,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:44:49,416 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:44:49,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:44:49,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:44:49,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:44:49,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:44:49,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:44:49,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:44:49,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:44:49,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:44:49,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:44:49,417 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:44:49,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:44:49,417 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:44:49,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:44:49,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:44:49,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:44:49,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:44:49,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:44:49,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:44:49,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:44:49,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:44:49,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:44:49,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:44:49,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:44:49,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:44:49,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:44:49,418 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:44:49,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:44:49,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:44:49,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:44:49,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:44:49,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:44:49,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:44:49,418 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:44:49,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:44:49,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:44:49,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:44:49,625 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:44:49,627 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:44:49,628 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-14 01:44:50,877 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74919902e/10e4a3316a444ebea1325904cfa5d1f9/FLAG32e04266c [2025-04-14 01:44:51,112 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:44:51,112 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i [2025-04-14 01:44:51,121 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74919902e/10e4a3316a444ebea1325904cfa5d1f9/FLAG32e04266c [2025-04-14 01:44:51,928 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74919902e/10e4a3316a444ebea1325904cfa5d1f9 [2025-04-14 01:44:51,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:44:51,931 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:44:51,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:44:51,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:44:51,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:44:51,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:44:51" (1/1) ... [2025-04-14 01:44:51,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec9ae33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:51, skipping insertion in model container [2025-04-14 01:44:51,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:44:51" (1/1) ... [2025-04-14 01:44:51,962 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:44:52,245 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-14 01:44:52,254 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-14 01:44:52,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:44:52,287 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:44:52,324 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-14 01:44:52,326 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-14 01:44:52,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:44:52,358 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:44:52,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:52 WrapperNode [2025-04-14 01:44:52,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:44:52,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:44:52,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:44:52,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:44:52,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:52" (1/1) ... [2025-04-14 01:44:52,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:52" (1/1) ... [2025-04-14 01:44:52,399 INFO L138 Inliner]: procedures = 168, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2025-04-14 01:44:52,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:44:52,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:44:52,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:44:52,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:44:52,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:52" (1/1) ... [2025-04-14 01:44:52,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:52" (1/1) ... [2025-04-14 01:44:52,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:52" (1/1) ... [2025-04-14 01:44:52,423 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-14 01:44:52,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:52" (1/1) ... [2025-04-14 01:44:52,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:52" (1/1) ... [2025-04-14 01:44:52,436 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:52" (1/1) ... [2025-04-14 01:44:52,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:52" (1/1) ... [2025-04-14 01:44:52,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:52" (1/1) ... [2025-04-14 01:44:52,438 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:52" (1/1) ... [2025-04-14 01:44:52,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:44:52,442 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:44:52,442 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:44:52,442 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:44:52,442 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:52" (1/1) ... [2025-04-14 01:44:52,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:44:52,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:44:52,468 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-14 01:44:52,470 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-14 01:44:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:44:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:44:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-14 01:44:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-14 01:44:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-14 01:44:52,486 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-14 01:44:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-14 01:44:52,487 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-14 01:44:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:44:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:44:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-14 01:44:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-14 01:44:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 01:44:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:44:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-14 01:44:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-14 01:44:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-14 01:44:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-04-14 01:44:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:44:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:44:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 01:44:52,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-14 01:44:52,488 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 01:44:52,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:44:52,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:44:52,489 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:44:52,585 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:44:52,587 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:44:52,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc removeLogElement_#t~mem2#1; [2025-04-14 01:44:52,782 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:44:52,783 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:44:52,783 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:44:53,041 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:44:53,042 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:44:53,047 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:44:53,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:44:53 BoogieIcfgContainer [2025-04-14 01:44:53,047 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:44:53,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:44:53,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:44:53,052 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:44:53,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:44:51" (1/3) ... [2025-04-14 01:44:53,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25613b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:44:53, skipping insertion in model container [2025-04-14 01:44:53,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:52" (2/3) ... [2025-04-14 01:44:53,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25613b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:44:53, skipping insertion in model container [2025-04-14 01:44:53,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:44:53" (3/3) ... [2025-04-14 01:44:53,054 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2025-04-14 01:44:53,062 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:44:53,064 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-14 01:44:53,064 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:44:53,107 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 01:44:53,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 66 flow [2025-04-14 01:44:53,154 INFO L116 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-04-14 01:44:53,155 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:44:53,157 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 41 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-14 01:44:53,157 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 66 flow [2025-04-14 01:44:53,159 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 22 transitions, 53 flow [2025-04-14 01:44:53,164 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:44:53,172 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;@6edd7cbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:44:53,173 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-14 01:44:53,176 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:44:53,177 INFO L116 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-04-14 01:44:53,178 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 01:44:53,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:53,178 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-14 01:44:53,178 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:44:53,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:53,182 INFO L85 PathProgramCache]: Analyzing trace with hash 317149082, now seen corresponding path program 1 times [2025-04-14 01:44:53,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:53,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395848619] [2025-04-14 01:44:53,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:53,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:53,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 01:44:53,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 01:44:53,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:53,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:53,610 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-14 01:44:53,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:53,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395848619] [2025-04-14 01:44:53,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395848619] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:44:53,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:44:53,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:44:53,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170624448] [2025-04-14 01:44:53,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:44:53,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 01:44:53,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:53,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 01:44:53,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 01:44:53,640 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-14 01:44:53,641 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-14 01:44:53,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:53,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-14 01:44:53,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:53,749 INFO L116 PetriNetUnfolderBase]: 146/250 cut-off events. [2025-04-14 01:44:53,751 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-14 01:44:53,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 250 events. 146/250 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 720 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-14 01:44:53,754 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 18 selfloop transitions, 0 changer transitions 1/19 dead transitions. [2025-04-14 01:44:53,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 19 transitions, 85 flow [2025-04-14 01:44:53,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 01:44:53,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 01:44:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2025-04-14 01:44:53,764 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 01:44:53,765 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 53 flow. Second operand 2 states and 26 transitions. [2025-04-14 01:44:53,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 19 transitions, 85 flow [2025-04-14 01:44:53,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 19 transitions, 80 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 01:44:53,770 INFO L231 Difference]: Finished difference. Result has 22 places, 18 transitions, 40 flow [2025-04-14 01:44:53,771 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-14 01:44:53,774 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -3 predicate places. [2025-04-14 01:44:53,774 INFO L485 AbstractCegarLoop]: Abstraction has has 22 places, 18 transitions, 40 flow [2025-04-14 01:44:53,774 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-14 01:44:53,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:53,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:53,775 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:44:53,775 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:44:53,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:53,775 INFO L85 PathProgramCache]: Analyzing trace with hash -172106586, now seen corresponding path program 1 times [2025-04-14 01:44:53,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:53,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744685262] [2025-04-14 01:44:53,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:53,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:53,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 01:44:53,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 01:44:53,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:53,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:53,874 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-14 01:44:53,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:53,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744685262] [2025-04-14 01:44:53,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744685262] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:44:53,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:44:53,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:44:53,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444024076] [2025-04-14 01:44:53,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:44:53,875 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:44:53,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:53,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:44:53,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:44:53,875 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-14 01:44:53,875 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-14 01:44:53,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:53,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-14 01:44:53,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:53,982 INFO L116 PetriNetUnfolderBase]: 158/271 cut-off events. [2025-04-14 01:44:53,982 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 01:44:53,984 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 844 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-14 01:44:53,985 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 26 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2025-04-14 01:44:53,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 28 transitions, 118 flow [2025-04-14 01:44:53,986 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:44:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:44:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2025-04-14 01:44:53,987 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2025-04-14 01:44:53,987 INFO L175 Difference]: Start difference. First operand has 22 places, 18 transitions, 40 flow. Second operand 3 states and 35 transitions. [2025-04-14 01:44:53,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 28 transitions, 118 flow [2025-04-14 01:44:53,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 28 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:44:53,989 INFO L231 Difference]: Finished difference. Result has 24 places, 19 transitions, 52 flow [2025-04-14 01:44:53,989 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-14 01:44:53,989 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2025-04-14 01:44:53,989 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 19 transitions, 52 flow [2025-04-14 01:44:53,989 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-14 01:44:53,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:53,989 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:53,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:44:53,990 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:44:53,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:53,990 INFO L85 PathProgramCache]: Analyzing trace with hash -988496496, now seen corresponding path program 1 times [2025-04-14 01:44:53,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:53,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993105346] [2025-04-14 01:44:53,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:53,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:54,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 01:44:54,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:44:54,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:54,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:54,128 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-14 01:44:54,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:54,128 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993105346] [2025-04-14 01:44:54,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993105346] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:44:54,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:44:54,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:44:54,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716923921] [2025-04-14 01:44:54,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:44:54,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:44:54,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:54,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:44:54,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:44:54,129 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-14 01:44:54,130 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-14 01:44:54,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:54,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-14 01:44:54,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:54,202 INFO L116 PetriNetUnfolderBase]: 118/215 cut-off events. [2025-04-14 01:44:54,202 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:44:54,203 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 14. Compared 685 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-14 01:44:54,205 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 24 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2025-04-14 01:44:54,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 129 flow [2025-04-14 01:44:54,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:44:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:44:54,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2025-04-14 01:44:54,206 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2025-04-14 01:44:54,206 INFO L175 Difference]: Start difference. First operand has 24 places, 19 transitions, 52 flow. Second operand 3 states and 35 transitions. [2025-04-14 01:44:54,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 129 flow [2025-04-14 01:44:54,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 127 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:44:54,207 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 58 flow [2025-04-14 01:44:54,207 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-14 01:44:54,208 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2025-04-14 01:44:54,208 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 58 flow [2025-04-14 01:44:54,208 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-14 01:44:54,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:54,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:54,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:44:54,208 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:44:54,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:54,209 INFO L85 PathProgramCache]: Analyzing trace with hash -582459195, now seen corresponding path program 1 times [2025-04-14 01:44:54,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:54,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977184969] [2025-04-14 01:44:54,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:54,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:54,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:44:54,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:44:54,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:54,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 01:44:54,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [539416570] [2025-04-14 01:44:54,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:54,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:44:54,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:44:54,270 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-14 01:44:54,271 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-14 01:44:54,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:44:54,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:44:54,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:54,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:54,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-14 01:44:54,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:44:54,606 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-14 01:44:54,676 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-14 01:44:54,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:44:54,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:54,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977184969] [2025-04-14 01:44:54,677 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 01:44:54,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539416570] [2025-04-14 01:44:54,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539416570] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:44:54,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:44:54,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:44:54,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249360291] [2025-04-14 01:44:54,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:44:54,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:44:54,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:54,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:44:54,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:44:54,678 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-14 01:44:54,678 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-14 01:44:54,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:54,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-14 01:44:54,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:54,880 INFO L116 PetriNetUnfolderBase]: 207/372 cut-off events. [2025-04-14 01:44:54,880 INFO L117 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-04-14 01:44:54,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 372 events. 207/372 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1348 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-14 01:44:54,884 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 50 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2025-04-14 01:44:54,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 59 transitions, 292 flow [2025-04-14 01:44:54,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:44:54,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:44:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2025-04-14 01:44:54,887 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2025-04-14 01:44:54,887 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 58 flow. Second operand 6 states and 72 transitions. [2025-04-14 01:44:54,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 59 transitions, 292 flow [2025-04-14 01:44:54,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 59 transitions, 277 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:44:54,888 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 110 flow [2025-04-14 01:44:54,889 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-14 01:44:54,889 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 6 predicate places. [2025-04-14 01:44:54,889 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 110 flow [2025-04-14 01:44:54,889 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-14 01:44:54,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:54,889 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:54,898 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-14 01:44:55,091 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-14 01:44:55,092 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:44:55,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash -476191127, now seen corresponding path program 2 times [2025-04-14 01:44:55,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:55,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58565270] [2025-04-14 01:44:55,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:44:55,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:55,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:44:55,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:44:55,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:44:55,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 01:44:55,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1767917347] [2025-04-14 01:44:55,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:44:55,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:44:55,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:44:55,138 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-14 01:44:55,138 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-14 01:44:55,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:44:55,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:44:55,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:44:55,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:55,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 01:44:55,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:44:55,369 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-14 01:44:55,397 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-14 01:44:55,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:44:55,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:55,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58565270] [2025-04-14 01:44:55,397 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 01:44:55,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767917347] [2025-04-14 01:44:55,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767917347] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:44:55,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:44:55,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:44:55,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822787910] [2025-04-14 01:44:55,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:44:55,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:44:55,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:55,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:44:55,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:44:55,398 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-14 01:44:55,398 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-14 01:44:55,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:55,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-14 01:44:55,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:55,586 INFO L116 PetriNetUnfolderBase]: 279/505 cut-off events. [2025-04-14 01:44:55,587 INFO L117 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2025-04-14 01:44:55,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 505 events. 279/505 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2039 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-14 01:44:55,589 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 48 selfloop transitions, 11 changer transitions 0/59 dead transitions. [2025-04-14 01:44:55,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 59 transitions, 345 flow [2025-04-14 01:44:55,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:44:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:44:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2025-04-14 01:44:55,590 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2025-04-14 01:44:55,590 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 110 flow. Second operand 6 states and 66 transitions. [2025-04-14 01:44:55,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 59 transitions, 345 flow [2025-04-14 01:44:55,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 59 transitions, 330 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-14 01:44:55,592 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 186 flow [2025-04-14 01:44:55,592 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-14 01:44:55,593 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 12 predicate places. [2025-04-14 01:44:55,593 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 186 flow [2025-04-14 01:44:55,593 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-14 01:44:55,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:55,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:55,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 01:44:55,797 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-14 01:44:55,797 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:44:55,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:55,798 INFO L85 PathProgramCache]: Analyzing trace with hash -578797785, now seen corresponding path program 3 times [2025-04-14 01:44:55,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:55,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042317742] [2025-04-14 01:44:55,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:44:55,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:55,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:44:55,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:44:55,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:44:55,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 01:44:55,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [388889623] [2025-04-14 01:44:55,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:44:55,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:44:55,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:44:55,823 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-14 01:44:55,825 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-14 01:44:55,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:44:55,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:44:55,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:44:55,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:55,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 01:44:55,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:44:56,055 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-14 01:44:56,090 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-14 01:44:56,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:44:56,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:56,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042317742] [2025-04-14 01:44:56,090 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 01:44:56,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388889623] [2025-04-14 01:44:56,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388889623] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:44:56,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:44:56,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:44:56,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330729447] [2025-04-14 01:44:56,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:44:56,091 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:44:56,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:56,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:44:56,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:44:56,091 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-14 01:44:56,091 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-14 01:44:56,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:56,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-14 01:44:56,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:56,285 INFO L116 PetriNetUnfolderBase]: 315/570 cut-off events. [2025-04-14 01:44:56,285 INFO L117 PetriNetUnfolderBase]: For 350/350 co-relation queries the response was YES. [2025-04-14 01:44:56,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1702 conditions, 570 events. 315/570 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2331 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-14 01:44:56,288 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 55 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2025-04-14 01:44:56,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 66 transitions, 432 flow [2025-04-14 01:44:56,289 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:44:56,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:44:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2025-04-14 01:44:56,289 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2025-04-14 01:44:56,289 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 186 flow. Second operand 6 states and 66 transitions. [2025-04-14 01:44:56,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 66 transitions, 432 flow [2025-04-14 01:44:56,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 66 transitions, 432 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:44:56,293 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 265 flow [2025-04-14 01:44:56,293 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-14 01:44:56,293 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 20 predicate places. [2025-04-14 01:44:56,293 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 265 flow [2025-04-14 01:44:56,293 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-14 01:44:56,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:56,293 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:56,302 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-14 01:44:56,499 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-14 01:44:56,500 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:44:56,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:56,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2138156540, now seen corresponding path program 1 times [2025-04-14 01:44:56,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:56,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11252929] [2025-04-14 01:44:56,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:56,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:56,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:44:56,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:44:56,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:56,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 01:44:56,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218120778] [2025-04-14 01:44:56,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:56,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:44:56,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:44:56,578 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-14 01:44:56,579 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-14 01:44:56,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:44:56,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:44:56,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:56,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:56,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-14 01:44:56,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:44:56,799 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-14 01:44:56,805 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-14 01:44:56,814 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-14 01:44:56,958 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-14 01:44:56,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:44:57,700 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-14 01:44:57,725 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-14 01:44:58,955 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 313 treesize of output 297 [2025-04-14 01:44:59,126 INFO L325 Elim1Store]: treesize reduction 185, result has 29.1 percent of original size [2025-04-14 01:44:59,126 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 297 treesize of output 468 [2025-04-14 01:45:02,652 INFO L325 Elim1Store]: treesize reduction 656, result has 25.7 percent of original size [2025-04-14 01:45:02,652 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 9 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 12 new quantified variables, introduced 47 case distinctions, treesize of input 1097 treesize of output 2144 [2025-04-14 01:45:10,012 INFO L325 Elim1Store]: treesize reduction 427, result has 6.8 percent of original size [2025-04-14 01:45:10,013 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 967 treesize of output 1132 [2025-04-14 01:45:18,349 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:45:18,349 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2170 treesize of output 1893 [2025-04-14 01:45:20,117 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-14 01:45:20,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:45:20,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11252929] [2025-04-14 01:45:20,118 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 01:45:20,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218120778] [2025-04-14 01:45:20,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218120778] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:45:20,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:45:20,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2025-04-14 01:45:20,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103231897] [2025-04-14 01:45:20,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-14 01:45:20,118 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:45:20,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:45:20,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:45:20,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:45:20,119 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-14 01:45:20,119 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-14 01:45:20,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:45:20,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-14 01:45:20,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:45:20,733 INFO L116 PetriNetUnfolderBase]: 438/781 cut-off events. [2025-04-14 01:45:20,734 INFO L117 PetriNetUnfolderBase]: For 845/845 co-relation queries the response was YES. [2025-04-14 01:45:20,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2468 conditions, 781 events. 438/781 cut-off events. For 845/845 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3310 event pairs, 32 based on Foata normal form. 7/721 useless extension candidates. Maximal degree in co-relation 2452. Up to 320 conditions per place. [2025-04-14 01:45:20,737 INFO L140 encePairwiseOnDemand]: 19/26 looper letters, 74 selfloop transitions, 24 changer transitions 0/98 dead transitions. [2025-04-14 01:45:20,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 98 transitions, 668 flow [2025-04-14 01:45:20,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:45:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:45:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2025-04-14 01:45:20,738 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2025-04-14 01:45:20,738 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 265 flow. Second operand 9 states and 99 transitions. [2025-04-14 01:45:20,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 98 transitions, 668 flow [2025-04-14 01:45:20,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 98 transitions, 648 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-14 01:45:20,742 INFO L231 Difference]: Finished difference. Result has 53 places, 52 transitions, 401 flow [2025-04-14 01:45:20,742 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=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=401, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2025-04-14 01:45:20,742 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 28 predicate places. [2025-04-14 01:45:20,742 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 401 flow [2025-04-14 01:45:20,742 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-14 01:45:20,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:45:20,742 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:45:20,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 01:45:20,943 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-14 01:45:20,943 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:45:20,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:45:20,944 INFO L85 PathProgramCache]: Analyzing trace with hash -315033114, now seen corresponding path program 1 times [2025-04-14 01:45:20,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:45:20,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63087366] [2025-04-14 01:45:20,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:45:20,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:45:20,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:45:20,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:45:20,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:45:20,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:21,125 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-14 01:45:21,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:45:21,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63087366] [2025-04-14 01:45:21,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63087366] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:45:21,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848932425] [2025-04-14 01:45:21,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:45:21,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:21,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:45:21,127 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-14 01:45:21,130 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-14 01:45:21,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:45:21,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:45:21,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:45:21,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:21,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-14 01:45:21,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:45:21,257 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-14 01:45:21,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:45:21,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848932425] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:45:21,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:45:21,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2025-04-14 01:45:21,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741938160] [2025-04-14 01:45:21,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:45:21,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:45:21,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:45:21,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:45:21,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:45:21,259 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-14 01:45:21,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 401 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-14 01:45:21,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:45:21,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-14 01:45:21,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:45:21,351 INFO L116 PetriNetUnfolderBase]: 450/809 cut-off events. [2025-04-14 01:45:21,351 INFO L117 PetriNetUnfolderBase]: For 1798/1798 co-relation queries the response was YES. [2025-04-14 01:45:21,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2769 conditions, 809 events. 450/809 cut-off events. For 1798/1798 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3509 event pairs, 123 based on Foata normal form. 14/759 useless extension candidates. Maximal degree in co-relation 2750. Up to 500 conditions per place. [2025-04-14 01:45:21,356 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 44 selfloop transitions, 15 changer transitions 2/61 dead transitions. [2025-04-14 01:45:21,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 554 flow [2025-04-14 01:45:21,356 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:45:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:45:21,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-14 01:45:21,357 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47435897435897434 [2025-04-14 01:45:21,358 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 401 flow. Second operand 3 states and 37 transitions. [2025-04-14 01:45:21,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 554 flow [2025-04-14 01:45:21,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 499 flow, removed 24 selfloop flow, removed 1 redundant places. [2025-04-14 01:45:21,368 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 422 flow [2025-04-14 01:45:21,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2025-04-14 01:45:21,370 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 31 predicate places. [2025-04-14 01:45:21,370 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 422 flow [2025-04-14 01:45:21,370 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-14 01:45:21,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:45:21,370 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:45:21,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-14 01:45:21,570 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-14 01:45:21,571 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:45:21,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:45:21,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1867107292, now seen corresponding path program 2 times [2025-04-14 01:45:21,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:45:21,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903536935] [2025-04-14 01:45:21,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:45:21,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:45:21,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:45:21,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:45:21,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:45:21,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 01:45:21,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [183908136] [2025-04-14 01:45:21,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:45:21,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:21,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:45:21,656 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-14 01:45:21,657 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-14 01:45:21,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:45:21,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:45:21,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:45:21,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:21,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-14 01:45:21,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:45:21,842 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-14 01:45:21,847 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-14 01:45:21,850 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-14 01:45:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:45:21,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:45:22,427 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-14 01:45:22,439 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-14 01:45:23,974 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 383 treesize of output 367 [2025-04-14 01:45:24,070 INFO L325 Elim1Store]: treesize reduction 185, result has 29.1 percent of original size [2025-04-14 01:45:24,071 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 367 treesize of output 538 [2025-04-14 01:45:29,356 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:45:29,357 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1346 treesize of output 1196 [2025-04-14 01:45:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:45:31,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:45:31,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903536935] [2025-04-14 01:45:31,951 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 01:45:31,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183908136] [2025-04-14 01:45:31,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183908136] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:45:31,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:45:31,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2025-04-14 01:45:31,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763813841] [2025-04-14 01:45:31,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-14 01:45:31,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:45:31,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:45:31,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:45:31,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:45:31,952 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-14 01:45:31,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 422 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-14 01:45:31,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:45:31,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-14 01:45:31,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:45:32,499 INFO L116 PetriNetUnfolderBase]: 531/957 cut-off events. [2025-04-14 01:45:32,499 INFO L117 PetriNetUnfolderBase]: For 2370/2370 co-relation queries the response was YES. [2025-04-14 01:45:32,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3255 conditions, 957 events. 531/957 cut-off events. For 2370/2370 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4399 event pairs, 73 based on Foata normal form. 7/886 useless extension candidates. Maximal degree in co-relation 3235. Up to 536 conditions per place. [2025-04-14 01:45:32,505 INFO L140 encePairwiseOnDemand]: 18/26 looper letters, 65 selfloop transitions, 42 changer transitions 6/113 dead transitions. [2025-04-14 01:45:32,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 113 transitions, 912 flow [2025-04-14 01:45:32,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:45:32,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:45:32,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 111 transitions. [2025-04-14 01:45:32,507 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3557692307692308 [2025-04-14 01:45:32,507 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 422 flow. Second operand 12 states and 111 transitions. [2025-04-14 01:45:32,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 113 transitions, 912 flow [2025-04-14 01:45:32,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 113 transitions, 866 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 01:45:32,516 INFO L231 Difference]: Finished difference. Result has 67 places, 69 transitions, 622 flow [2025-04-14 01:45:32,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=622, PETRI_PLACES=67, PETRI_TRANSITIONS=69} [2025-04-14 01:45:32,517 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 42 predicate places. [2025-04-14 01:45:32,517 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 622 flow [2025-04-14 01:45:32,517 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-14 01:45:32,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:45:32,517 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:45:32,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 01:45:32,718 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-14 01:45:32,718 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:45:32,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:45:32,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1967811174, now seen corresponding path program 3 times [2025-04-14 01:45:32,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:45:32,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377018557] [2025-04-14 01:45:32,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:45:32,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:45:32,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:45:32,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:45:32,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:45:32,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 01:45:32,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291165039] [2025-04-14 01:45:32,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:45:32,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:32,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:45:32,790 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:45:32,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 01:45:32,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:45:32,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:45:32,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:45:32,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:32,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-14 01:45:32,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:45:32,979 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-14 01:45:32,981 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-14 01:45:32,985 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-14 01:45:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:45:33,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:45:33,419 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-04-14 01:45:33,439 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-14 01:45:34,741 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 383 treesize of output 367 [2025-04-14 01:45:34,901 INFO L325 Elim1Store]: treesize reduction 185, result has 29.1 percent of original size [2025-04-14 01:45:34,901 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 367 treesize of output 538 [2025-04-14 01:45:39,555 INFO L325 Elim1Store]: treesize reduction 50, result has 51.0 percent of original size [2025-04-14 01:45:39,555 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1144 treesize of output 1075 [2025-04-14 01:45:42,843 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:45:42,844 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1090 treesize of output 990 [2025-04-14 01:45:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:45:46,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:45:46,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377018557] [2025-04-14 01:45:46,033 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 01:45:46,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291165039] [2025-04-14 01:45:46,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291165039] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:45:46,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:45:46,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2025-04-14 01:45:46,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46817528] [2025-04-14 01:45:46,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-14 01:45:46,034 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 01:45:46,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:45:46,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 01:45:46,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:45:46,034 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-14 01:45:46,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 69 transitions, 622 flow. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:45:46,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:45:46,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-14 01:45:46,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:45:47,219 INFO L116 PetriNetUnfolderBase]: 640/1152 cut-off events. [2025-04-14 01:45:47,219 INFO L117 PetriNetUnfolderBase]: For 3435/3435 co-relation queries the response was YES. [2025-04-14 01:45:47,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4128 conditions, 1152 events. 640/1152 cut-off events. For 3435/3435 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5357 event pairs, 91 based on Foata normal form. 11/1073 useless extension candidates. Maximal degree in co-relation 4106. Up to 640 conditions per place. [2025-04-14 01:45:47,224 INFO L140 encePairwiseOnDemand]: 16/26 looper letters, 83 selfloop transitions, 60 changer transitions 7/150 dead transitions. [2025-04-14 01:45:47,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 150 transitions, 1287 flow [2025-04-14 01:45:47,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 01:45:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 01:45:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 151 transitions. [2025-04-14 01:45:47,227 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3629807692307692 [2025-04-14 01:45:47,227 INFO L175 Difference]: Start difference. First operand has 67 places, 69 transitions, 622 flow. Second operand 16 states and 151 transitions. [2025-04-14 01:45:47,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 150 transitions, 1287 flow [2025-04-14 01:45:47,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 150 transitions, 1217 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-04-14 01:45:47,246 INFO L231 Difference]: Finished difference. Result has 83 places, 92 transitions, 930 flow [2025-04-14 01:45:47,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=930, PETRI_PLACES=83, PETRI_TRANSITIONS=92} [2025-04-14 01:45:47,246 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 58 predicate places. [2025-04-14 01:45:47,246 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 92 transitions, 930 flow [2025-04-14 01:45:47,246 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:45:47,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:45:47,246 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:45:47,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 01:45:47,447 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:47,448 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:45:47,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:45:47,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1725546200, now seen corresponding path program 2 times [2025-04-14 01:45:47,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:45:47,449 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203786141] [2025-04-14 01:45:47,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:45:47,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:45:47,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:45:47,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:45:47,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:45:47,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 01:45:47,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [580313974] [2025-04-14 01:45:47,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:45:47,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:47,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:45:47,499 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:45:47,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 01:45:47,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:45:47,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:45:47,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:45:47,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:45:47,618 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 01:45:47,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:45:47,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:45:47,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:45:47,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:45:47,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 01:45:47,692 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 01:45:47,692 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-14 01:45:47,694 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-14 01:45:47,694 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-14 01:45:47,694 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-14 01:45:47,694 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-14 01:45:47,694 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-14 01:45:47,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 01:45:47,894 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-14 01:45:47,895 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1] [2025-04-14 01:45:47,930 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:45:47,930 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:45:47,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:45:47 BasicIcfg [2025-04-14 01:45:47,933 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:45:47,933 INFO L158 Benchmark]: Toolchain (without parser) took 56002.83ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 101.5MB in the beginning and 377.2MB in the end (delta: -275.8MB). Peak memory consumption was 51.3MB. Max. memory is 8.0GB. [2025-04-14 01:45:47,934 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 163.6MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:45:47,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.19ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 77.4MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 01:45:47,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.96ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 74.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:45:47,934 INFO L158 Benchmark]: Boogie Preprocessor took 41.50ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 73.2MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:45:47,934 INFO L158 Benchmark]: IcfgBuilder took 605.44ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 66.3MB in the end (delta: 6.9MB). Peak memory consumption was 53.1MB. Max. memory is 8.0GB. [2025-04-14 01:45:47,934 INFO L158 Benchmark]: TraceAbstraction took 54884.82ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 65.6MB in the beginning and 377.2MB in the end (delta: -311.6MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. [2025-04-14 01:45:47,937 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.20ms. Allocated memory is still 163.6MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 427.19ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 77.4MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.96ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 74.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 41.50ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 73.2MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 605.44ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 66.3MB in the end (delta: 6.9MB). Peak memory consumption was 53.1MB. Max. memory is 8.0GB. * TraceAbstraction took 54884.82ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 65.6MB in the beginning and 377.2MB in the end (delta: -311.6MB). Peak memory consumption was 14.9MB. 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] [L723] 1 int i; [L724] 1 i=0 [L724] COND TRUE 1 i<7 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, id2=0, m={4:0}, next=0, receive=0, send=1] [L739] 2 int i; [L740] 2 i=0 [L740] COND TRUE 2 i<7 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L743] COND FALSE 2 !(\read(receive)) VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L740] 2 i++ [L740] COND TRUE 2 i<7 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 [L709] 1 buffer[next] = b [L710] 1 next = (next+1)%buffer_size [L712] COND TRUE 1 next 0 && first < buffer_size [L697] 2 first++ [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) [L746] 2 reach_error() VAL [\at(arg, Pre)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=1, m={4:0}, next=1, receive=1, send=0] - UnprovableResult [Line: 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: 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: 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: 54.8s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 305 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 305 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1754 IncrementalHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 0 mSDtfsCounter, 1754 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=930occurred in iteration=10, InterpolantAutomatonStates: 66, 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.9s SatisfiabilityAnalysisTime, 47.9s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 7135 SizeOfPredicates, 68 NumberOfNonLiveVariables, 1275 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 2/20 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-14 01:45:48,147 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-14 01:45:48,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...