/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_01-simple_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:40:26,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:40:26,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:40:26,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:40:26,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:40:26,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:40:26,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:40:26,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:40:26,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:40:26,865 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:40:26,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:40:26,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:40:26,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:40:26,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:40:26,866 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:40:26,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:40:26,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:40:26,866 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:40:26,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:40:26,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:40:26,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:40:26,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:40:26,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:40:26,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:40:26,866 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:40:26,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:40:26,867 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:40:26,867 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:40:26,867 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:40:26,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:40:26,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:40:26,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:40:26,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:40:26,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:40:26,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:40:26,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:40:26,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:40:26,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:40:26,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:40:26,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:40:26,867 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:40:26,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:40:26,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:40:26,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:40:26,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:40:26,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:40:26,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:40:26,868 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:40:27,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:40:27,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:40:27,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:40:27,087 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:40:27,089 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:40:27,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_01-simple_racing.i [2025-04-13 19:40:28,412 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb1aabef3/18950868045042e8b026c26e223fd3ad/FLAG389e9a159 [2025-04-13 19:40:28,671 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:40:28,671 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_01-simple_racing.i [2025-04-13 19:40:28,687 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb1aabef3/18950868045042e8b026c26e223fd3ad/FLAG389e9a159 [2025-04-13 19:40:29,413 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb1aabef3/18950868045042e8b026c26e223fd3ad [2025-04-13 19:40:29,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:40:29,417 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:40:29,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:40:29,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:40:29,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:40:29,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:40:29" (1/1) ... [2025-04-13 19:40:29,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6146fcc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:29, skipping insertion in model container [2025-04-13 19:40:29,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:40:29" (1/1) ... [2025-04-13 19:40:29,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:40:29,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_01-simple_racing.i[30176,30189] [2025-04-13 19:40:29,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:40:29,735 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:40:29,783 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_01-simple_racing.i[30176,30189] [2025-04-13 19:40:29,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:40:29,824 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:40:29,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:29 WrapperNode [2025-04-13 19:40:29,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:40:29,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:40:29,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:40:29,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:40:29,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:29" (1/1) ... [2025-04-13 19:40:29,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:29" (1/1) ... [2025-04-13 19:40:29,864 INFO L138 Inliner]: procedures = 171, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2025-04-13 19:40:29,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:40:29,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:40:29,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:40:29,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:40:29,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:29" (1/1) ... [2025-04-13 19:40:29,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:29" (1/1) ... [2025-04-13 19:40:29,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:29" (1/1) ... [2025-04-13 19:40:29,885 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 5, 5, 2]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 0, 1]. [2025-04-13 19:40:29,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:29" (1/1) ... [2025-04-13 19:40:29,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:29" (1/1) ... [2025-04-13 19:40:29,889 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:29" (1/1) ... [2025-04-13 19:40:29,890 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:29" (1/1) ... [2025-04-13 19:40:29,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:29" (1/1) ... [2025-04-13 19:40:29,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:29" (1/1) ... [2025-04-13 19:40:29,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:29" (1/1) ... [2025-04-13 19:40:29,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:40:29,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:40:29,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:40:29,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:40:29,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:29" (1/1) ... [2025-04-13 19:40:29,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:40:29,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:40:29,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:40:29,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:40:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:40:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:40:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 19:40:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 19:40:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-04-13 19:40:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:40:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:40:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 19:40:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 19:40:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-04-13 19:40:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:40:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:40:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 19:40:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-13 19:40:29,951 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-13 19:40:29,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 19:40:29,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:40:29,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:40:29,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:40:29,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 19:40:29,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-04-13 19:40:29,951 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:40:29,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:40:29,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:40:29,952 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:40:30,066 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:40:30,067 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:40:30,211 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:40:30,211 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:40:30,212 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:40:30,360 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:40:30,364 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:40:30,367 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:40:30,373 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:40:30,375 INFO L313 CfgBuilder]: Removed 4 assume(true) statements. [2025-04-13 19:40:30,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:40:30 BoogieIcfgContainer [2025-04-13 19:40:30,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:40:30,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:40:30,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:40:30,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:40:30,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:40:29" (1/3) ... [2025-04-13 19:40:30,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71200a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:40:30, skipping insertion in model container [2025-04-13 19:40:30,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:29" (2/3) ... [2025-04-13 19:40:30,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71200a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:40:30, skipping insertion in model container [2025-04-13 19:40:30,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:40:30" (3/3) ... [2025-04-13 19:40:30,382 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2025-04-13 19:40:30,391 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:40:30,394 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_01-simple_racing.i that has 2 procedures, 29 locations, 40 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 19:40:30,394 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:40:30,428 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-13 19:40:30,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 41 transitions, 89 flow [2025-04-13 19:40:30,482 INFO L116 PetriNetUnfolderBase]: 13/53 cut-off events. [2025-04-13 19:40:30,483 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:40:30,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 53 events. 13/53 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 151 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2025-04-13 19:40:30,488 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 41 transitions, 89 flow [2025-04-13 19:40:30,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 38 transitions, 80 flow [2025-04-13 19:40:30,497 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:40:30,523 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;@9d2446e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:40:30,524 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-13 19:40:30,530 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:40:30,530 INFO L116 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-04-13 19:40:30,530 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:40:30,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:30,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:40:30,531 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:40:30,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:30,536 INFO L85 PathProgramCache]: Analyzing trace with hash 10980083, now seen corresponding path program 1 times [2025-04-13 19:40:30,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:30,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938387820] [2025-04-13 19:40:30,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:30,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:30,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:40:30,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:40:30,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:30,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:40:30,640 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:40:30,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:40:30,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:40:30,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:30,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:40:30,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:40:30,690 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:40:30,692 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-13 19:40:30,693 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-13 19:40:30,693 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:40:30,693 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 19:40:30,697 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:40:30,697 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 19:40:30,713 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 19:40:30,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 63 transitions, 142 flow [2025-04-13 19:40:30,736 INFO L116 PetriNetUnfolderBase]: 25/95 cut-off events. [2025-04-13 19:40:30,736 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-13 19:40:30,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 95 events. 25/95 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 351 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 58. Up to 6 conditions per place. [2025-04-13 19:40:30,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 63 transitions, 142 flow [2025-04-13 19:40:30,740 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 63 transitions, 142 flow [2025-04-13 19:40:30,741 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:40:30,741 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;@9d2446e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:40:30,741 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-13 19:40:30,744 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:40:30,745 INFO L116 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-04-13 19:40:30,745 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:40:30,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:30,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:40:30,745 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:40:30,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:30,745 INFO L85 PathProgramCache]: Analyzing trace with hash 398239685, now seen corresponding path program 1 times [2025-04-13 19:40:30,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:30,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282068906] [2025-04-13 19:40:30,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:30,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:30,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:40:30,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:40:30,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:30,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:40:30,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:30,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282068906] [2025-04-13 19:40:30,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282068906] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:30,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:30,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:40:30,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440324978] [2025-04-13 19:40:30,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:30,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:40:30,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:30,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:40:30,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:40:30,819 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 63 [2025-04-13 19:40:30,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 63 transitions, 142 flow. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:40:30,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:30,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 63 [2025-04-13 19:40:30,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:31,326 INFO L116 PetriNetUnfolderBase]: 3470/5554 cut-off events. [2025-04-13 19:40:31,327 INFO L117 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-04-13 19:40:31,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11168 conditions, 5554 events. 3470/5554 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 29449 event pairs, 3456 based on Foata normal form. 0/5157 useless extension candidates. Maximal degree in co-relation 9600. Up to 5542 conditions per place. [2025-04-13 19:40:31,350 INFO L140 encePairwiseOnDemand]: 45/63 looper letters, 32 selfloop transitions, 0 changer transitions 9/45 dead transitions. [2025-04-13 19:40:31,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 188 flow [2025-04-13 19:40:31,352 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:40:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:40:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2025-04-13 19:40:31,361 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5317460317460317 [2025-04-13 19:40:31,361 INFO L175 Difference]: Start difference. First operand has 48 places, 63 transitions, 142 flow. Second operand 2 states and 67 transitions. [2025-04-13 19:40:31,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 188 flow [2025-04-13 19:40:31,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:40:31,366 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 82 flow [2025-04-13 19:40:31,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2025-04-13 19:40:31,371 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2025-04-13 19:40:31,371 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 82 flow [2025-04-13 19:40:31,371 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:40:31,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:31,373 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-13 19:40:31,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:40:31,373 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:40:31,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:31,374 INFO L85 PathProgramCache]: Analyzing trace with hash -450783508, now seen corresponding path program 1 times [2025-04-13 19:40:31,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:31,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987330487] [2025-04-13 19:40:31,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:31,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:31,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:40:31,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:40:31,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:31,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:40:31,408 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:40:31,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:40:31,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:40:31,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:31,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:40:31,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:40:31,433 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:40:31,433 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-13 19:40:31,433 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-13 19:40:31,436 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:40:31,436 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:40:31,437 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:40:31,437 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 19:40:31,455 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 19:40:31,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 85 transitions, 197 flow [2025-04-13 19:40:31,468 INFO L116 PetriNetUnfolderBase]: 40/146 cut-off events. [2025-04-13 19:40:31,468 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-13 19:40:31,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 146 events. 40/146 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 584 event pairs, 1 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 106. Up to 12 conditions per place. [2025-04-13 19:40:31,468 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 85 transitions, 197 flow [2025-04-13 19:40:31,470 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 85 transitions, 197 flow [2025-04-13 19:40:31,471 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:40:31,471 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;@9d2446e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:40:31,471 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-13 19:40:31,473 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:40:31,473 INFO L116 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-04-13 19:40:31,473 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:40:31,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:31,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:40:31,473 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:40:31,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:31,473 INFO L85 PathProgramCache]: Analyzing trace with hash 479355610, now seen corresponding path program 1 times [2025-04-13 19:40:31,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:31,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321382991] [2025-04-13 19:40:31,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:31,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:31,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:40:31,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:40:31,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:31,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:40:31,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:31,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321382991] [2025-04-13 19:40:31,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321382991] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:31,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:31,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:40:31,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299344115] [2025-04-13 19:40:31,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:31,498 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:40:31,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:31,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:40:31,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:40:31,498 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 85 [2025-04-13 19:40:31,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 85 transitions, 197 flow. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:40:31,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:31,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 85 [2025-04-13 19:40:31,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:35,864 INFO L116 PetriNetUnfolderBase]: 71107/98785 cut-off events. [2025-04-13 19:40:35,864 INFO L117 PetriNetUnfolderBase]: For 1909/1909 co-relation queries the response was YES. [2025-04-13 19:40:35,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198831 conditions, 98785 events. 71107/98785 cut-off events. For 1909/1909 co-relation queries the response was YES. Maximal size of possible extension queue 1743. Compared 618444 event pairs, 70897 based on Foata normal form. 0/93454 useless extension candidates. Maximal degree in co-relation 130579. Up to 98737 conditions per place. [2025-04-13 19:40:36,169 INFO L140 encePairwiseOnDemand]: 60/85 looper letters, 45 selfloop transitions, 0 changer transitions 10/60 dead transitions. [2025-04-13 19:40:36,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 257 flow [2025-04-13 19:40:36,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:40:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:40:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions. [2025-04-13 19:40:36,171 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2025-04-13 19:40:36,171 INFO L175 Difference]: Start difference. First operand has 64 places, 85 transitions, 197 flow. Second operand 2 states and 90 transitions. [2025-04-13 19:40:36,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 257 flow [2025-04-13 19:40:36,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 257 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:40:36,177 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 118 flow [2025-04-13 19:40:36,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2025-04-13 19:40:36,179 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, 1 predicate places. [2025-04-13 19:40:36,179 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 118 flow [2025-04-13 19:40:36,179 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:40:36,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:36,179 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:36,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:40:36,179 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:40:36,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:36,180 INFO L85 PathProgramCache]: Analyzing trace with hash 123301206, now seen corresponding path program 1 times [2025-04-13 19:40:36,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:36,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384058456] [2025-04-13 19:40:36,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:36,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:36,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:40:36,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:40:36,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:36,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:40:36,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:36,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384058456] [2025-04-13 19:40:36,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384058456] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:36,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:36,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:40:36,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935979067] [2025-04-13 19:40:36,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:36,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:40:36,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:36,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:40:36,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:40:36,228 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 85 [2025-04-13 19:40:36,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:40:36,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:36,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 85 [2025-04-13 19:40:36,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:38,222 INFO L116 PetriNetUnfolderBase]: 36204/50597 cut-off events. [2025-04-13 19:40:38,223 INFO L117 PetriNetUnfolderBase]: For 1105/1105 co-relation queries the response was YES. [2025-04-13 19:40:38,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101747 conditions, 50597 events. 36204/50597 cut-off events. For 1105/1105 co-relation queries the response was YES. Maximal size of possible extension queue 1019. Compared 305554 event pairs, 23088 based on Foata normal form. 0/48153 useless extension candidates. Maximal degree in co-relation 101741. Up to 50414 conditions per place. [2025-04-13 19:40:38,439 INFO L140 encePairwiseOnDemand]: 82/85 looper letters, 56 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2025-04-13 19:40:38,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 260 flow [2025-04-13 19:40:38,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:40:38,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:40:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-04-13 19:40:38,443 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2901960784313726 [2025-04-13 19:40:38,443 INFO L175 Difference]: Start difference. First operand has 65 places, 50 transitions, 118 flow. Second operand 3 states and 74 transitions. [2025-04-13 19:40:38,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 260 flow [2025-04-13 19:40:38,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 63 transitions, 258 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-13 19:40:38,450 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 128 flow [2025-04-13 19:40:38,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2025-04-13 19:40:38,451 INFO L279 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2025-04-13 19:40:38,451 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 128 flow [2025-04-13 19:40:38,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:40:38,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:38,451 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1] [2025-04-13 19:40:38,451 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:40:38,451 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:40:38,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:38,452 INFO L85 PathProgramCache]: Analyzing trace with hash -364527538, now seen corresponding path program 1 times [2025-04-13 19:40:38,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:38,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137944958] [2025-04-13 19:40:38,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:38,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:38,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:40:38,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:40:38,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:38,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:40:38,470 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:40:38,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:40:38,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:40:38,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:38,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:40:38,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:40:38,497 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:40:38,498 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-13 19:40:38,498 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-13 19:40:38,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:40:38,498 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 19:40:38,502 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:40:38,503 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 19:40:38,524 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 19:40:38,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 107 transitions, 254 flow [2025-04-13 19:40:38,539 INFO L116 PetriNetUnfolderBase]: 63/217 cut-off events. [2025-04-13 19:40:38,539 INFO L117 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-04-13 19:40:38,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 217 events. 63/217 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 923 event pairs, 6 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 170. Up to 32 conditions per place. [2025-04-13 19:40:38,540 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 107 transitions, 254 flow [2025-04-13 19:40:38,541 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 107 transitions, 254 flow [2025-04-13 19:40:38,542 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:40:38,542 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;@9d2446e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:40:38,543 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-13 19:40:38,544 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:40:38,544 INFO L116 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-04-13 19:40:38,544 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:40:38,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:38,544 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:40:38,544 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:40:38,544 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:38,544 INFO L85 PathProgramCache]: Analyzing trace with hash 581466245, now seen corresponding path program 1 times [2025-04-13 19:40:38,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:38,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896225213] [2025-04-13 19:40:38,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:38,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:38,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:40:38,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:40:38,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:38,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:40:38,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:38,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896225213] [2025-04-13 19:40:38,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896225213] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:38,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:38,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:40:38,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656201491] [2025-04-13 19:40:38,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:38,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:40:38,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:38,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:40:38,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:40:38,558 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 107 [2025-04-13 19:40:38,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 107 transitions, 254 flow. Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:40:38,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:38,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 107 [2025-04-13 19:40:38,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand