/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_51-mutexptr_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:29:29,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:29:29,201 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 17:29:29,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:29:29,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:29:29,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:29:29,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:29:29,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:29:29,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:29:29,227 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:29:29,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:29:29,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:29:29,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:29:29,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:29:29,227 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:29:29,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:29:29,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:29:29,227 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:29:29,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:29:29,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:29:29,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:29:29,228 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:29:29,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:29:29,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:29:29,228 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:29:29,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:29:29,228 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:29:29,228 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:29:29,228 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:29:29,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:29:29,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:29:29,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:29:29,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:29:29,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:29:29,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:29:29,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:29:29,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:29:29,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:29:29,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:29:29,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:29:29,230 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:29:29,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:29:29,230 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:29:29,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:29:29,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:29:29,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:29:29,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:29:29,231 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 17:29:29,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:29:29,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:29:29,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:29:29,477 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:29:29,477 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:29:29,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_51-mutexptr_racefree.i [2025-04-13 17:29:30,778 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8848d43c5/263bde965331461dac6ab8d8514d57d0/FLAG31f87ec71 [2025-04-13 17:29:31,058 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:29:31,058 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_51-mutexptr_racefree.i [2025-04-13 17:29:31,075 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8848d43c5/263bde965331461dac6ab8d8514d57d0/FLAG31f87ec71 [2025-04-13 17:29:31,829 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8848d43c5/263bde965331461dac6ab8d8514d57d0 [2025-04-13 17:29:31,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:29:31,832 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:29:31,835 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:29:31,835 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:29:31,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:29:31,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:29:31" (1/1) ... [2025-04-13 17:29:31,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6876a661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:29:31, skipping insertion in model container [2025-04-13 17:29:31,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:29:31" (1/1) ... [2025-04-13 17:29:31,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:29:32,134 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_51-mutexptr_racefree.i[30176,30189] [2025-04-13 17:29:32,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:29:32,166 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:29:32,212 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_51-mutexptr_racefree.i[30176,30189] [2025-04-13 17:29:32,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:29:32,255 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:29:32,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:29:32 WrapperNode [2025-04-13 17:29:32,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:29:32,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:29:32,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:29:32,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:29:32,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:29:32" (1/1) ... [2025-04-13 17:29:32,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:29:32" (1/1) ... [2025-04-13 17:29:32,294 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 132 [2025-04-13 17:29:32,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:29:32,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:29:32,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:29:32,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:29:32,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:29:32" (1/1) ... [2025-04-13 17:29:32,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:29:32" (1/1) ... [2025-04-13 17:29:32,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:29:32" (1/1) ... [2025-04-13 17:29:32,319 INFO L175 MemorySlicer]: Split 20 memory accesses to 5 slices as follows [2, 5, 5, 2, 6]. 30 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 5, 0, 1]. The 3 writes are split as follows [0, 0, 0, 1, 2]. [2025-04-13 17:29:32,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:29:32" (1/1) ... [2025-04-13 17:29:32,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:29:32" (1/1) ... [2025-04-13 17:29:32,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:29:32" (1/1) ... [2025-04-13 17:29:32,325 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:29:32" (1/1) ... [2025-04-13 17:29:32,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:29:32" (1/1) ... [2025-04-13 17:29:32,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:29:32" (1/1) ... [2025-04-13 17:29:32,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:29:32" (1/1) ... [2025-04-13 17:29:32,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:29:32,332 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:29:32,332 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:29:32,332 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:29:32,332 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:29:32" (1/1) ... [2025-04-13 17:29:32,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:29:32,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:29:32,356 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 17:29:32,358 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 17:29:32,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 17:29:32,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 17:29:32,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 17:29:32,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 17:29:32,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-04-13 17:29:32,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 17:29:32,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 17:29:32,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 17:29:32,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 17:29:32,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-04-13 17:29:32,374 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 17:29:32,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:29:32,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 17:29:32,374 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-13 17:29:32,374 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-13 17:29:32,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 17:29:32,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:29:32,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 17:29:32,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 17:29:32,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 17:29:32,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-04-13 17:29:32,374 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 17:29:32,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:29:32,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:29:32,375 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 17:29:32,480 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:29:32,482 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:29:32,660 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:29:32,661 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:29:32,661 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:29:33,060 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:29:33,063 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:29:33,064 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:29:33,074 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:29:33,075 INFO L313 CfgBuilder]: Removed 4 assume(true) statements. [2025-04-13 17:29:33,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:29:33 BoogieIcfgContainer [2025-04-13 17:29:33,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:29:33,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:29:33,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:29:33,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:29:33,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:29:31" (1/3) ... [2025-04-13 17:29:33,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1a8dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:29:33, skipping insertion in model container [2025-04-13 17:29:33,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:29:32" (2/3) ... [2025-04-13 17:29:33,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1a8dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:29:33, skipping insertion in model container [2025-04-13 17:29:33,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:29:33" (3/3) ... [2025-04-13 17:29:33,082 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_51-mutexptr_racefree.i [2025-04-13 17:29:33,091 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:29:33,092 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_51-mutexptr_racefree.i that has 2 procedures, 29 locations, 40 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 17:29:33,092 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:29:33,124 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-13 17:29:33,143 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 41 transitions, 89 flow [2025-04-13 17:29:33,168 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 149 states, 146 states have (on average 2.3972602739726026) internal successors, (350), 148 states have internal predecessors, (350), 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 17:29:33,186 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:29:33,196 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@26d75c01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:29:33,196 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-13 17:29:33,200 INFO L278 IsEmpty]: Start isEmpty. Operand has 149 states, 146 states have (on average 2.3972602739726026) internal successors, (350), 148 states have internal predecessors, (350), 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 17:29:33,203 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-13 17:29:33,204 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:33,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-13 17:29:33,204 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:29:33,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:33,208 INFO L85 PathProgramCache]: Analyzing trace with hash 14654643, now seen corresponding path program 1 times [2025-04-13 17:29:33,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:33,214 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194028470] [2025-04-13 17:29:33,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:29:33,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:33,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 17:29:33,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 17:29:33,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:29:33,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:29:33,351 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:29:33,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 17:29:33,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 17:29:33,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:29:33,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:29:33,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:29:33,401 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:29:33,403 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-13 17:29:33,404 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-13 17:29:33,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:29:33,409 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 17:29:33,411 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:29:33,411 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 17:29:33,435 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 17:29:33,441 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 63 transitions, 142 flow [2025-04-13 17:29:33,562 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2095 states, 2091 states have (on average 3.7733142037302727) internal successors, (7890), 2094 states have internal predecessors, (7890), 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 17:29:33,565 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:29:33,566 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@26d75c01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:29:33,566 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-13 17:29:33,572 INFO L278 IsEmpty]: Start isEmpty. Operand has 2095 states, 2091 states have (on average 3.7733142037302727) internal successors, (7890), 2094 states have internal predecessors, (7890), 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 17:29:33,572 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 17:29:33,572 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:33,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 17:29:33,573 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:29:33,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:33,573 INFO L85 PathProgramCache]: Analyzing trace with hash 511979975, now seen corresponding path program 1 times [2025-04-13 17:29:33,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:33,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682907266] [2025-04-13 17:29:33,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:29:33,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:33,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 17:29:33,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 17:29:33,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:29:33,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:33,625 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 17:29:33,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:33,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682907266] [2025-04-13 17:29:33,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682907266] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:33,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:33,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:29:33,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256641472] [2025-04-13 17:29:33,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:33,629 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 17:29:33,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:33,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 17:29:33,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:29:33,647 INFO L87 Difference]: Start difference. First operand has 2095 states, 2091 states have (on average 3.7733142037302727) internal successors, (7890), 2094 states have internal predecessors, (7890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 1 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:33,800 INFO L93 Difference]: Finished difference Result 4124 states and 15574 transitions. [2025-04-13 17:29:33,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 17:29:33,802 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 1 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-13 17:29:33,802 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:33,829 INFO L225 Difference]: With dead ends: 4124 [2025-04-13 17:29:33,829 INFO L226 Difference]: Without dead ends: 1668 [2025-04-13 17:29:33,839 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:29:33,842 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:33,842 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:29:33,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2025-04-13 17:29:33,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1668. [2025-04-13 17:29:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1665 states have (on average 2.6876876876876876) internal successors, (4475), 1667 states have internal predecessors, (4475), 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 17:29:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 4475 transitions. [2025-04-13 17:29:33,958 INFO L79 Accepts]: Start accepts. Automaton has 1668 states and 4475 transitions. Word has length 5 [2025-04-13 17:29:33,958 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:33,958 INFO L485 AbstractCegarLoop]: Abstraction has 1668 states and 4475 transitions. [2025-04-13 17:29:33,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 1 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:33,959 INFO L278 IsEmpty]: Start isEmpty. Operand 1668 states and 4475 transitions. [2025-04-13 17:29:33,959 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 17:29:33,959 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:33,959 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-04-13 17:29:33,960 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:29:33,960 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:29:33,960 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:33,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1214494143, now seen corresponding path program 1 times [2025-04-13 17:29:33,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:33,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338803097] [2025-04-13 17:29:33,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:29:33,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:34,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 17:29:34,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 17:29:34,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:29:34,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:29:34,048 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:29:34,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 17:29:34,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 17:29:34,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:29:34,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:29:34,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:29:34,088 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:29:34,088 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-13 17:29:34,088 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-13 17:29:34,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:29:34,088 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 17:29:34,089 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:29:34,089 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 17:29:34,112 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 17:29:34,115 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 64 places, 85 transitions, 197 flow [2025-04-13 17:29:35,059 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 29339 states, 29334 states have (on average 5.194313765596236) internal successors, (152370), 29338 states have internal predecessors, (152370), 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 17:29:35,060 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:29:35,061 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@26d75c01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:29:35,061 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-13 17:29:35,117 INFO L278 IsEmpty]: Start isEmpty. Operand has 29339 states, 29334 states have (on average 5.194313765596236) internal successors, (152370), 29338 states have internal predecessors, (152370), 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 17:29:35,118 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 17:29:35,118 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:35,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 17:29:35,118 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:29:35,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:35,119 INFO L85 PathProgramCache]: Analyzing trace with hash 593095900, now seen corresponding path program 1 times [2025-04-13 17:29:35,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:35,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974432247] [2025-04-13 17:29:35,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:29:35,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:35,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 17:29:35,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 17:29:35,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:29:35,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:35,139 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 17:29:35,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:35,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974432247] [2025-04-13 17:29:35,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974432247] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:35,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:35,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:29:35,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601583361] [2025-04-13 17:29:35,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:35,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 17:29:35,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:35,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 17:29:35,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:29:35,203 INFO L87 Difference]: Start difference. First operand has 29339 states, 29334 states have (on average 5.194313765596236) internal successors, (152370), 29338 states have internal predecessors, (152370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 1 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:36,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:36,377 INFO L93 Difference]: Finished difference Result 58486 states and 303883 transitions. [2025-04-13 17:29:36,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 17:29:36,377 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 1 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-13 17:29:36,377 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:36,615 INFO L225 Difference]: With dead ends: 58486 [2025-04-13 17:29:36,619 INFO L226 Difference]: Without dead ends: 23424 [2025-04-13 17:29:36,681 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:29:36,682 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:36,682 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:29:36,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23424 states. [2025-04-13 17:29:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23424 to 23424. [2025-04-13 17:29:37,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23424 states, 23420 states have (on average 3.606789069171648) internal successors, (84471), 23423 states have internal predecessors, (84471), 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 17:29:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23424 states to 23424 states and 84471 transitions. [2025-04-13 17:29:37,671 INFO L79 Accepts]: Start accepts. Automaton has 23424 states and 84471 transitions. Word has length 5 [2025-04-13 17:29:37,672 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:37,672 INFO L485 AbstractCegarLoop]: Abstraction has 23424 states and 84471 transitions. [2025-04-13 17:29:37,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 1 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:29:37,672 INFO L278 IsEmpty]: Start isEmpty. Operand 23424 states and 84471 transitions. [2025-04-13 17:29:37,673 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 17:29:37,673 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:37,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:37,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:29:37,673 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:29:37,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:37,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2077063069, now seen corresponding path program 1 times [2025-04-13 17:29:37,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:37,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610135881] [2025-04-13 17:29:37,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:29:37,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:37,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 17:29:37,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 17:29:37,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:29:37,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:37,775 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 17:29:37,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:37,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610135881] [2025-04-13 17:29:37,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610135881] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:37,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:37,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:29:37,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109838263] [2025-04-13 17:29:37,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:37,776 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:29:37,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:37,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:29:37,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:29:37,776 INFO L87 Difference]: Start difference. First operand 23424 states and 84471 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) 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 17:29:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:38,320 INFO L93 Difference]: Finished difference Result 23424 states and 84471 transitions. [2025-04-13 17:29:38,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:29:38,321 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-13 17:29:38,321 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:38,552 INFO L225 Difference]: With dead ends: 23424 [2025-04-13 17:29:38,552 INFO L226 Difference]: Without dead ends: 23354 [2025-04-13 17:29:38,574 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:29:38,579 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 13 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:38,579 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:29:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23354 states. [2025-04-13 17:29:39,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23354 to 23354. [2025-04-13 17:29:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23354 states, 23351 states have (on average 3.6116654532996444) internal successors, (84336), 23353 states have internal predecessors, (84336), 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 17:29:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23354 states to 23354 states and 84336 transitions. [2025-04-13 17:29:39,697 INFO L79 Accepts]: Start accepts. Automaton has 23354 states and 84336 transitions. Word has length 7 [2025-04-13 17:29:39,698 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:39,698 INFO L485 AbstractCegarLoop]: Abstraction has 23354 states and 84336 transitions. [2025-04-13 17:29:39,698 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) 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 17:29:39,698 INFO L278 IsEmpty]: Start isEmpty. Operand 23354 states and 84336 transitions. [2025-04-13 17:29:39,698 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 17:29:39,698 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:39,698 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2025-04-13 17:29:39,699 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:29:39,699 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:29:39,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:39,699 INFO L85 PathProgramCache]: Analyzing trace with hash 148964344, now seen corresponding path program 1 times [2025-04-13 17:29:39,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:39,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924626896] [2025-04-13 17:29:39,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:29:39,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:39,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 17:29:39,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 17:29:39,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:29:39,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:29:39,734 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:29:39,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 17:29:39,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 17:29:39,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:29:39,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:29:39,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:29:39,765 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:29:39,765 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-13 17:29:39,765 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-13 17:29:39,765 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 17:29:39,766 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 17:29:39,766 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:29:39,766 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 17:29:39,787 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 17:29:39,788 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 107 transitions, 254 flow [2025-04-13 17:29:53,126 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 410755 states, 410749 states have (on average 6.621975951250033) internal successors, (2719970), 410754 states have internal predecessors, (2719970), 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 17:29:53,127 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:29:53,128 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@26d75c01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:29:53,128 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-13 17:29:53,979 INFO L278 IsEmpty]: Start isEmpty. Operand has 410755 states, 410749 states have (on average 6.621975951250033) internal successors, (2719970), 410754 states have internal predecessors, (2719970), 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 17:29:53,979 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 17:29:53,979 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:53,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 17:29:53,979 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:29:53,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:53,980 INFO L85 PathProgramCache]: Analyzing trace with hash 695206535, now seen corresponding path program 1 times [2025-04-13 17:29:53,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:53,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701646977] [2025-04-13 17:29:53,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:29:53,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:53,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 17:29:53,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 17:29:53,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:29:53,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:53,988 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 17:29:53,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:53,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701646977] [2025-04-13 17:29:53,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701646977] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:53,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:53,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:29:53,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520067654] [2025-04-13 17:29:53,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:53,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 17:29:53,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:53,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 17:29:53,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:29:54,779 INFO L87 Difference]: Start difference. First operand has 410755 states, 410749 states have (on average 6.621975951250033) internal successors, (2719970), 410754 states have internal predecessors, (2719970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 1 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:30:13,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:13,687 INFO L93 Difference]: Finished difference Result 820940 states and 5436626 transitions. [2025-04-13 17:30:13,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 17:30:13,688 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 1 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-13 17:30:13,688 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:18,067 INFO L225 Difference]: With dead ends: 820940 [2025-04-13 17:30:18,068 INFO L226 Difference]: Without dead ends: 328008 [2025-04-13 17:30:19,306 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:30:19,307 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:19,307 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:30:19,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328008 states.