/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-ext/02_inc_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:49:20,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:49:20,963 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 23:49:20,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:49:20,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:49:20,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:49:20,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:49:20,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:49:20,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:49:20,981 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:49:20,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:49:20,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:49:20,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:49:20,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:49:20,981 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:49:20,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:49:20,982 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:49:20,982 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:49:20,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:49:20,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:49:20,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:49:20,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:49:20,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:49:20,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:49:20,982 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:49:20,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:49:20,982 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:49:20,982 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:49:20,982 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:49:20,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:49:20,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:49:20,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:49:20,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:49:20,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:49:20,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:49:20,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:49:20,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:49:20,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:49:20,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:49:20,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:49:20,983 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:49:20,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:49:20,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:49:20,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:49:20,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:49:20,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:49:20,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:49:20,984 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-13 23:49:21,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:49:21,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:49:21,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:49:21,198 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:49:21,198 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:49:21,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2025-04-13 23:49:22,519 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1c30a08/91a0b8d359424ba18c5b4f46dcde51eb/FLAGdf212b794 [2025-04-13 23:49:22,726 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:49:22,727 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2025-04-13 23:49:22,738 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1c30a08/91a0b8d359424ba18c5b4f46dcde51eb/FLAGdf212b794 [2025-04-13 23:49:23,569 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1c30a08/91a0b8d359424ba18c5b4f46dcde51eb [2025-04-13 23:49:23,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:49:23,572 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:49:23,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:49:23,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:49:23,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:49:23,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:49:23" (1/1) ... [2025-04-13 23:49:23,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73458f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:23, skipping insertion in model container [2025-04-13 23:49:23,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:49:23" (1/1) ... [2025-04-13 23:49:23,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:49:23,832 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-ext/02_inc_cas.i[30873,30886] [2025-04-13 23:49:23,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:49:23,851 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:49:23,906 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-ext/02_inc_cas.i[30873,30886] [2025-04-13 23:49:23,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:49:23,928 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:49:23,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:23 WrapperNode [2025-04-13 23:49:23,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:49:23,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:49:23,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:49:23,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:49:23,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:23" (1/1) ... [2025-04-13 23:49:23,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:23" (1/1) ... [2025-04-13 23:49:23,956 INFO L138 Inliner]: procedures = 170, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2025-04-13 23:49:23,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:49:23,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:49:23,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:49:23,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:49:23,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:23" (1/1) ... [2025-04-13 23:49:23,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:23" (1/1) ... [2025-04-13 23:49:23,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:23" (1/1) ... [2025-04-13 23:49:23,970 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [3, 2, 5]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [0, 2, 1]. The 3 writes are split as follows [2, 0, 1]. [2025-04-13 23:49:23,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:23" (1/1) ... [2025-04-13 23:49:23,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:23" (1/1) ... [2025-04-13 23:49:23,974 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:23" (1/1) ... [2025-04-13 23:49:23,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:23" (1/1) ... [2025-04-13 23:49:23,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:23" (1/1) ... [2025-04-13 23:49:23,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:23" (1/1) ... [2025-04-13 23:49:23,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:49:23,978 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:49:23,982 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:49:23,983 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:49:23,983 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:23" (1/1) ... [2025-04-13 23:49:23,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:49:23,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:49:24,005 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 23:49:24,009 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 23:49:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:49:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:49:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 23:49:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 23:49:24,022 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 23:49:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:49:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:49:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 23:49:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:49:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:49:24,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 23:49:24,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 23:49:24,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:49:24,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:49:24,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 23:49:24,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:49:24,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:49:24,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:49:24,024 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:49:24,129 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:49:24,131 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:49:24,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: havoc ~#casret~0#1.base, ~#casret~0#1.offset; [2025-04-13 23:49:24,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: SUMMARY for call ULTIMATE.dealloc(~#casret~0#1.base, ~#casret~0#1.offset); srcloc: null [2025-04-13 23:49:24,238 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:49:24,238 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:49:24,238 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:49:24,334 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:49:24,338 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:49:24,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:49:24 BoogieIcfgContainer [2025-04-13 23:49:24,339 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:49:24,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:49:24,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:49:24,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:49:24,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:49:23" (1/3) ... [2025-04-13 23:49:24,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4572fdfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:49:24, skipping insertion in model container [2025-04-13 23:49:24,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:23" (2/3) ... [2025-04-13 23:49:24,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4572fdfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:49:24, skipping insertion in model container [2025-04-13 23:49:24,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:49:24" (3/3) ... [2025-04-13 23:49:24,346 INFO L128 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2025-04-13 23:49:24,355 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:49:24,356 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 02_inc_cas.i that has 2 procedures, 13 locations, 16 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 23:49:24,357 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:49:24,384 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:49:24,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 16 places, 17 transitions, 38 flow [2025-04-13 23:49:24,418 INFO L116 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-04-13 23:49:24,420 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:49:24,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21 conditions, 17 events. 3/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 13. Up to 2 conditions per place. [2025-04-13 23:49:24,424 INFO L82 GeneralOperation]: Start removeDead. Operand has 16 places, 17 transitions, 38 flow [2025-04-13 23:49:24,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 16 places, 16 transitions, 36 flow [2025-04-13 23:49:24,434 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:49:24,443 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;@3d41b27e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:49:24,443 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:49:24,447 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:49:24,447 INFO L116 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-04-13 23:49:24,448 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:49:24,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:24,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:49:24,448 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 23:49:24,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:24,452 INFO L85 PathProgramCache]: Analyzing trace with hash 5381800, now seen corresponding path program 1 times [2025-04-13 23:49:24,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:24,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953325593] [2025-04-13 23:49:24,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:24,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:24,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:49:24,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:49:24,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:24,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:24,531 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:49:24,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:49:24,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:49:24,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:24,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:24,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:49:24,558 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:49:24,559 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 23:49:24,561 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 23:49:24,561 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 23:49:24,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:49:24,561 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 23:49:24,563 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:49:24,563 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 23:49:24,589 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:49:24,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 29 transitions, 68 flow [2025-04-13 23:49:24,599 INFO L116 PetriNetUnfolderBase]: 6/31 cut-off events. [2025-04-13 23:49:24,599 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:49:24,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 31 events. 6/31 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 77 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 24. Up to 3 conditions per place. [2025-04-13 23:49:24,600 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 29 transitions, 68 flow [2025-04-13 23:49:24,601 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 28 transitions, 66 flow [2025-04-13 23:49:24,603 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:49:24,603 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;@3d41b27e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:49:24,603 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:49:24,617 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:49:24,617 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 23:49:24,617 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:49:24,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:24,618 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:49:24,618 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 23:49:24,618 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:24,618 INFO L85 PathProgramCache]: Analyzing trace with hash 194851042, now seen corresponding path program 1 times [2025-04-13 23:49:24,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:24,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851576869] [2025-04-13 23:49:24,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:24,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:24,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:49:24,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:49:24,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:24,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:24,666 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 23:49:24,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:24,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851576869] [2025-04-13 23:49:24,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851576869] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:49:24,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:49:24,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:49:24,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346184403] [2025-04-13 23:49:24,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:49:24,671 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:49:24,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:24,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:49:24,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:49:24,695 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2025-04-13 23:49:24,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 28 transitions, 66 flow. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:24,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:24,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2025-04-13 23:49:24,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:24,823 INFO L116 PetriNetUnfolderBase]: 300/484 cut-off events. [2025-04-13 23:49:24,824 INFO L117 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-04-13 23:49:24,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 484 events. 300/484 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1563 event pairs, 224 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 694. Up to 482 conditions per place. [2025-04-13 23:49:24,829 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 24 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2025-04-13 23:49:24,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 25 transitions, 108 flow [2025-04-13 23:49:24,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:49:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:49:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 29 transitions. [2025-04-13 23:49:24,838 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 23:49:24,839 INFO L175 Difference]: Start difference. First operand has 27 places, 28 transitions, 66 flow. Second operand 2 states and 29 transitions. [2025-04-13 23:49:24,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 25 transitions, 108 flow [2025-04-13 23:49:24,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 25 transitions, 108 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 23:49:24,846 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 60 flow [2025-04-13 23:49:24,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2025-04-13 23:49:24,850 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2025-04-13 23:49:24,850 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 60 flow [2025-04-13 23:49:24,850 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:24,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:24,851 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-13 23:49:24,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:49:24,851 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 23:49:24,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:24,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1745038968, now seen corresponding path program 1 times [2025-04-13 23:49:24,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:24,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813758737] [2025-04-13 23:49:24,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:24,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:24,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:49:24,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:49:24,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:24,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:24,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:49:24,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:49:24,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:49:24,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:24,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:24,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:49:24,886 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:49:24,886 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 23:49:24,886 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 23:49:24,886 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 23:49:24,886 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 23:49:24,887 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:49:24,887 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:49:24,887 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:49:24,887 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 23:49:24,916 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:49:24,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 41 transitions, 100 flow [2025-04-13 23:49:24,926 INFO L116 PetriNetUnfolderBase]: 9/45 cut-off events. [2025-04-13 23:49:24,926 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 23:49:24,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 9/45 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 38. Up to 4 conditions per place. [2025-04-13 23:49:24,927 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 41 transitions, 100 flow [2025-04-13 23:49:24,927 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 40 transitions, 98 flow [2025-04-13 23:49:24,928 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:49:24,928 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;@3d41b27e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:49:24,928 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 23:49:24,930 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:49:24,930 INFO L116 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-04-13 23:49:24,930 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 23:49:24,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:24,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:49:24,931 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 23:49:24,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:24,931 INFO L85 PathProgramCache]: Analyzing trace with hash 234305248, now seen corresponding path program 1 times [2025-04-13 23:49:24,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:24,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446257278] [2025-04-13 23:49:24,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:24,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:24,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:49:24,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:49:24,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:24,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:24,971 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 23:49:24,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:24,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446257278] [2025-04-13 23:49:24,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446257278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:49:24,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:49:24,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:49:24,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637024595] [2025-04-13 23:49:24,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:49:24,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:49:24,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:24,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:49:24,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:49:24,972 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2025-04-13 23:49:24,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 40 transitions, 98 flow. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:24,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:24,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2025-04-13 23:49:24,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:25,437 INFO L116 PetriNetUnfolderBase]: 4512/6163 cut-off events. [2025-04-13 23:49:25,437 INFO L117 PetriNetUnfolderBase]: For 536/536 co-relation queries the response was YES. [2025-04-13 23:49:25,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12672 conditions, 6163 events. 4512/6163 cut-off events. For 536/536 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 25258 event pairs, 3464 based on Foata normal form. 0/4591 useless extension candidates. Maximal degree in co-relation 4592. Up to 6152 conditions per place. [2025-04-13 23:49:25,471 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 35 selfloop transitions, 0 changer transitions 0/36 dead transitions. [2025-04-13 23:49:25,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 160 flow [2025-04-13 23:49:25,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:49:25,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:49:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2025-04-13 23:49:25,473 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 23:49:25,473 INFO L175 Difference]: Start difference. First operand has 38 places, 40 transitions, 98 flow. Second operand 2 states and 41 transitions. [2025-04-13 23:49:25,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 160 flow [2025-04-13 23:49:25,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 158 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-13 23:49:25,477 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 88 flow [2025-04-13 23:49:25,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2025-04-13 23:49:25,478 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2025-04-13 23:49:25,478 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 88 flow [2025-04-13 23:49:25,478 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:25,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:25,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:49:25,478 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:49:25,478 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 23:49:25,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:25,479 INFO L85 PathProgramCache]: Analyzing trace with hash 867015599, now seen corresponding path program 1 times [2025-04-13 23:49:25,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:25,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970462522] [2025-04-13 23:49:25,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:25,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:25,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:49:25,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:49:25,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:25,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:25,845 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 23:49:25,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:25,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970462522] [2025-04-13 23:49:25,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970462522] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:49:25,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:49:25,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:49:25,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865669826] [2025-04-13 23:49:25,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:49:25,846 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:49:25,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:25,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:49:25,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:49:25,847 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2025-04-13 23:49:25,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:25,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:25,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2025-04-13 23:49:25,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:26,731 INFO L116 PetriNetUnfolderBase]: 7631/10516 cut-off events. [2025-04-13 23:49:26,731 INFO L117 PetriNetUnfolderBase]: For 458/458 co-relation queries the response was YES. [2025-04-13 23:49:26,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21476 conditions, 10516 events. 7631/10516 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 50727 event pairs, 1585 based on Foata normal form. 0/7976 useless extension candidates. Maximal degree in co-relation 21470. Up to 4553 conditions per place. [2025-04-13 23:49:26,780 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 101 selfloop transitions, 9 changer transitions 0/111 dead transitions. [2025-04-13 23:49:26,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 111 transitions, 488 flow [2025-04-13 23:49:26,781 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:49:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 23:49:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-04-13 23:49:26,782 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5658536585365853 [2025-04-13 23:49:26,782 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 88 flow. Second operand 5 states and 116 transitions. [2025-04-13 23:49:26,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 111 transitions, 488 flow [2025-04-13 23:49:26,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 111 transitions, 488 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 23:49:26,786 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 142 flow [2025-04-13 23:49:26,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2025-04-13 23:49:26,788 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2025-04-13 23:49:26,789 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 142 flow [2025-04-13 23:49:26,789 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:26,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:26,789 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1] [2025-04-13 23:49:26,789 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:49:26,789 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 23:49:26,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:26,789 INFO L85 PathProgramCache]: Analyzing trace with hash 514633503, now seen corresponding path program 1 times [2025-04-13 23:49:26,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:26,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393984372] [2025-04-13 23:49:26,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:26,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:26,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:49:26,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:49:26,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:26,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:26,800 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:49:26,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:49:26,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:49:26,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:26,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:26,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:49:26,813 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:49:26,813 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 23:49:26,813 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 23:49:26,813 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 23:49:26,813 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 23:49:26,813 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 23:49:26,813 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:49:26,813 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 23:49:26,814 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:49:26,814 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 23:49:26,844 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:49:26,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 53 transitions, 134 flow [2025-04-13 23:49:26,850 INFO L116 PetriNetUnfolderBase]: 12/59 cut-off events. [2025-04-13 23:49:26,850 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 23:49:26,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 59 events. 12/59 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 169 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 57. Up to 5 conditions per place. [2025-04-13 23:49:26,851 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 53 transitions, 134 flow [2025-04-13 23:49:26,851 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 52 transitions, 132 flow [2025-04-13 23:49:26,852 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:49:26,855 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;@3d41b27e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:49:26,856 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 23:49:26,856 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:49:26,856 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-13 23:49:26,857 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:49:26,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:26,857 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:49:26,857 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:49:26,857 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:26,857 INFO L85 PathProgramCache]: Analyzing trace with hash 285222037, now seen corresponding path program 1 times [2025-04-13 23:49:26,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:26,857 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088880171] [2025-04-13 23:49:26,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:26,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:26,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:49:26,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:49:26,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:26,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:26,872 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 23:49:26,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:26,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088880171] [2025-04-13 23:49:26,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088880171] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:49:26,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:49:26,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:49:26,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428999184] [2025-04-13 23:49:26,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:49:26,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:49:26,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:26,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:49:26,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:49:26,873 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 53 [2025-04-13 23:49:26,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 52 transitions, 132 flow. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:26,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:26,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 53 [2025-04-13 23:49:26,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:30,281 INFO L116 PetriNetUnfolderBase]: 57000/71831 cut-off events. [2025-04-13 23:49:30,281 INFO L117 PetriNetUnfolderBase]: For 8175/8175 co-relation queries the response was YES. [2025-04-13 23:49:30,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147596 conditions, 71831 events. 57000/71831 cut-off events. For 8175/8175 co-relation queries the response was YES. Maximal size of possible extension queue 1374. Compared 331157 event pairs, 44288 based on Foata normal form. 0/52763 useless extension candidates. Maximal degree in co-relation 21324. Up to 71762 conditions per place. [2025-04-13 23:49:30,579 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 46 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2025-04-13 23:49:30,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 47 transitions, 214 flow [2025-04-13 23:49:30,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:49:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:49:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2025-04-13 23:49:30,583 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 23:49:30,583 INFO L175 Difference]: Start difference. First operand has 49 places, 52 transitions, 132 flow. Second operand 2 states and 53 transitions. [2025-04-13 23:49:30,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 47 transitions, 214 flow [2025-04-13 23:49:30,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 208 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-04-13 23:49:30,590 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 116 flow [2025-04-13 23:49:30,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=116, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2025-04-13 23:49:30,592 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2025-04-13 23:49:30,593 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 116 flow [2025-04-13 23:49:30,593 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:30,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:30,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:49:30,593 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:49:30,593 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:49:30,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:30,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1605684762, now seen corresponding path program 1 times [2025-04-13 23:49:30,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:30,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861394607] [2025-04-13 23:49:30,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:30,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:30,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:49:30,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:49:30,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:30,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:30,803 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 23:49:30,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:30,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861394607] [2025-04-13 23:49:30,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861394607] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:49:30,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:49:30,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:49:30,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36518457] [2025-04-13 23:49:30,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:49:30,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:49:30,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:30,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:49:30,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:49:30,805 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 53 [2025-04-13 23:49:30,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:30,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:30,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 53 [2025-04-13 23:49:30,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:36,154 INFO L116 PetriNetUnfolderBase]: 98303/124536 cut-off events. [2025-04-13 23:49:36,155 INFO L117 PetriNetUnfolderBase]: For 4532/4532 co-relation queries the response was YES. [2025-04-13 23:49:36,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253355 conditions, 124536 events. 98303/124536 cut-off events. For 4532/4532 co-relation queries the response was YES. Maximal size of possible extension queue 2670. Compared 648630 event pairs, 20073 based on Foata normal form. 0/92840 useless extension candidates. Maximal degree in co-relation 253348. Up to 55363 conditions per place. [2025-04-13 23:49:36,802 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 143 selfloop transitions, 11 changer transitions 0/155 dead transitions. [2025-04-13 23:49:36,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 155 transitions, 685 flow [2025-04-13 23:49:36,804 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:49:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 23:49:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2025-04-13 23:49:36,805 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6037735849056604 [2025-04-13 23:49:36,805 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 116 flow. Second operand 5 states and 160 transitions. [2025-04-13 23:49:36,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 155 transitions, 685 flow [2025-04-13 23:49:36,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 155 transitions, 685 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 23:49:36,813 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 184 flow [2025-04-13 23:49:36,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2025-04-13 23:49:36,814 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2025-04-13 23:49:36,814 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 184 flow [2025-04-13 23:49:36,814 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:36,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:36,814 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2025-04-13 23:49:36,814 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:49:36,814 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 23:49:36,816 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:36,816 INFO L85 PathProgramCache]: Analyzing trace with hash -473260899, now seen corresponding path program 1 times [2025-04-13 23:49:36,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:36,816 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435201212] [2025-04-13 23:49:36,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:36,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:36,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:49:36,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:49:36,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:36,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:36,830 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:49:36,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:49:36,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:49:36,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:36,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:36,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:49:36,838 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:49:36,839 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 23:49:36,839 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 23:49:36,839 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 23:49:36,839 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 23:49:36,839 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 23:49:36,839 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 23:49:36,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:49:36,839 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 23:49:36,840 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:49:36,840 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 23:49:36,872 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:49:36,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 65 transitions, 170 flow [2025-04-13 23:49:36,880 INFO L116 PetriNetUnfolderBase]: 15/73 cut-off events. [2025-04-13 23:49:36,880 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 23:49:36,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 73 events. 15/73 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 216 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 77. Up to 6 conditions per place. [2025-04-13 23:49:36,880 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 65 transitions, 170 flow [2025-04-13 23:49:36,881 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 64 transitions, 168 flow [2025-04-13 23:49:36,882 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:49:36,883 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;@3d41b27e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:49:36,883 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 23:49:36,884 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:49:36,884 INFO L116 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-04-13 23:49:36,884 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 23:49:36,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:36,884 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:49:36,884 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 23:49:36,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:36,885 INFO L85 PathProgramCache]: Analyzing trace with hash 347568640, now seen corresponding path program 1 times [2025-04-13 23:49:36,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:36,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441830357] [2025-04-13 23:49:36,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:36,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:36,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:49:36,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:49:36,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:36,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:36,896 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 23:49:36,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:36,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441830357] [2025-04-13 23:49:36,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441830357] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:49:36,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:49:36,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:49:36,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444502716] [2025-04-13 23:49:36,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:49:36,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:49:36,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:36,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:49:36,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:49:36,898 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 65 [2025-04-13 23:49:36,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 64 transitions, 168 flow. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:36,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:36,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 65 [2025-04-13 23:49:36,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand