/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/ldv-races/race-2_5-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:11:18,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:11:18,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:11:18,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:11:18,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:11:18,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:11:18,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:11:18,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:11:18,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:11:18,146 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:11:18,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:11:18,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:11:18,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:11:18,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:11:18,147 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:11:18,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:11:18,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:11:18,147 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:11:18,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:11:18,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:11:18,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:11:18,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:11:18,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:11:18,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:11:18,147 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:11:18,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:11:18,148 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:11:18,148 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:11:18,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:11:18,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:11:18,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:11:18,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:11:18,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:11:18,148 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:11:18,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:11:18,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:11:18,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:11:18,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:11:18,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:11:18,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:11:18,150 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:11:18,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:11:18,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:11:18,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:11:18,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:11:18,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:11:18,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:11:18,151 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:11:18,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:11:18,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:11:18,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:11:18,402 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:11:18,402 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:11:18,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2025-04-14 00:11:19,807 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41cb21a84/f5a8c2ae6e4a424e81e269157de41494/FLAG2fcd669f5 [2025-04-14 00:11:20,127 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:11:20,127 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2025-04-14 00:11:20,155 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41cb21a84/f5a8c2ae6e4a424e81e269157de41494/FLAG2fcd669f5 [2025-04-14 00:11:20,864 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41cb21a84/f5a8c2ae6e4a424e81e269157de41494 [2025-04-14 00:11:20,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:11:20,868 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:11:20,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:11:20,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:11:20,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:11:20,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:11:20" (1/1) ... [2025-04-14 00:11:20,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9f35cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:20, skipping insertion in model container [2025-04-14 00:11:20,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:11:20" (1/1) ... [2025-04-14 00:11:20,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:11:21,236 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i[186287,186300] [2025-04-14 00:11:21,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:11:21,286 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:11:21,363 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i[186287,186300] [2025-04-14 00:11:21,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:11:21,426 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:11:21,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21 WrapperNode [2025-04-14 00:11:21,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:11:21,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:11:21,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:11:21,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:11:21,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21" (1/1) ... [2025-04-14 00:11:21,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21" (1/1) ... [2025-04-14 00:11:21,476 INFO L138 Inliner]: procedures = 248, calls = 55, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 136 [2025-04-14 00:11:21,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:11:21,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:11:21,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:11:21,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:11:21,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21" (1/1) ... [2025-04-14 00:11:21,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21" (1/1) ... [2025-04-14 00:11:21,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21" (1/1) ... [2025-04-14 00:11:21,505 INFO L175 MemorySlicer]: Split 19 memory accesses to 3 slices as follows [2, 2, 15]. 79 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 10 writes are split as follows [0, 2, 8]. [2025-04-14 00:11:21,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21" (1/1) ... [2025-04-14 00:11:21,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21" (1/1) ... [2025-04-14 00:11:21,517 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21" (1/1) ... [2025-04-14 00:11:21,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21" (1/1) ... [2025-04-14 00:11:21,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21" (1/1) ... [2025-04-14 00:11:21,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21" (1/1) ... [2025-04-14 00:11:21,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:11:21,532 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:11:21,533 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:11:21,533 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:11:21,533 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21" (1/1) ... [2025-04-14 00:11:21,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:11:21,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:11:21,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:11:21,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:11:21,581 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-04-14 00:11:21,581 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-04-14 00:11:21,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 00:11:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:11:21,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:11:21,583 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:11:21,800 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:11:21,802 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:11:22,043 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:11:22,044 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:11:22,044 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:11:22,291 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:22,319 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:22,354 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:11:22,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:11:22 BoogieIcfgContainer [2025-04-14 00:11:22,355 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:11:22,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:11:22,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:11:22,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:11:22,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:11:20" (1/3) ... [2025-04-14 00:11:22,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e1e5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:11:22, skipping insertion in model container [2025-04-14 00:11:22,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21" (2/3) ... [2025-04-14 00:11:22,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e1e5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:11:22, skipping insertion in model container [2025-04-14 00:11:22,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:11:22" (3/3) ... [2025-04-14 00:11:22,364 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2025-04-14 00:11:22,376 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:11:22,378 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_5-container_of.i that has 2 procedures, 29 locations, 34 edges, 1 initial locations, 0 loop locations, and 6 error locations. [2025-04-14 00:11:22,378 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:11:22,442 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 00:11:22,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 44 transitions, 102 flow [2025-04-14 00:11:22,512 INFO L116 PetriNetUnfolderBase]: 3/42 cut-off events. [2025-04-14 00:11:22,517 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:11:22,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 42 events. 3/42 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 56 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 22. Up to 3 conditions per place. [2025-04-14 00:11:22,518 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 44 transitions, 102 flow [2025-04-14 00:11:22,524 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 38 transitions, 88 flow [2025-04-14 00:11:22,534 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:11:22,546 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;@5890024a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:11:22,547 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-14 00:11:22,551 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:11:22,551 INFO L116 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-04-14 00:11:22,551 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:11:22,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:22,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1] [2025-04-14 00:11:22,552 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:22,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:22,556 INFO L85 PathProgramCache]: Analyzing trace with hash 435, now seen corresponding path program 1 times [2025-04-14 00:11:22,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:22,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967572736] [2025-04-14 00:11:22,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:22,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:22,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-14 00:11:22,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-14 00:11:22,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:22,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:23,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:23,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967572736] [2025-04-14 00:11:23,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967572736] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:23,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:23,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2025-04-14 00:11:23,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356955659] [2025-04-14 00:11:23,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:23,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 00:11:23,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:23,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 00:11:23,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 00:11:23,163 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2025-04-14 00:11:23,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:23,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:23,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2025-04-14 00:11:23,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:23,337 INFO L116 PetriNetUnfolderBase]: 231/453 cut-off events. [2025-04-14 00:11:23,337 INFO L117 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-04-14 00:11:23,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 453 events. 231/453 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1629 event pairs, 231 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 662. Up to 444 conditions per place. [2025-04-14 00:11:23,344 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 30 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2025-04-14 00:11:23,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 136 flow [2025-04-14 00:11:23,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 00:11:23,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 00:11:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2025-04-14 00:11:23,358 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 00:11:23,360 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 88 flow. Second operand 2 states and 44 transitions. [2025-04-14 00:11:23,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 136 flow [2025-04-14 00:11:23,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:11:23,366 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 68 flow [2025-04-14 00:11:23,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2025-04-14 00:11:23,372 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2025-04-14 00:11:23,372 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 68 flow [2025-04-14 00:11:23,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:23,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:23,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:23,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:11:23,373 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:23,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:23,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1747348037, now seen corresponding path program 1 times [2025-04-14 00:11:23,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:23,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605380297] [2025-04-14 00:11:23,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:23,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:23,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:11:23,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:11:23,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:23,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:23,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:23,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605380297] [2025-04-14 00:11:23,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605380297] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:23,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:23,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:11:23,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470241145] [2025-04-14 00:11:23,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:23,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:11:23,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:23,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:11:23,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:11:23,743 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2025-04-14 00:11:23,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:23,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:23,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2025-04-14 00:11:23,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:23,897 INFO L116 PetriNetUnfolderBase]: 245/490 cut-off events. [2025-04-14 00:11:23,897 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:11:23,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 490 events. 245/490 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1823 event pairs, 192 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 979. Up to 410 conditions per place. [2025-04-14 00:11:23,901 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 38 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2025-04-14 00:11:23,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 185 flow [2025-04-14 00:11:23,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:11:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:11:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-04-14 00:11:23,902 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-04-14 00:11:23,902 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 68 flow. Second operand 3 states and 57 transitions. [2025-04-14 00:11:23,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 185 flow [2025-04-14 00:11:23,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 185 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:11:23,904 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 114 flow [2025-04-14 00:11:23,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2025-04-14 00:11:23,907 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-04-14 00:11:23,909 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 114 flow [2025-04-14 00:11:23,909 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:23,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:23,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:23,909 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:11:23,909 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:23,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:23,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1666785272, now seen corresponding path program 1 times [2025-04-14 00:11:23,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:23,910 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104963960] [2025-04-14 00:11:23,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:23,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:23,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:11:23,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:11:23,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:23,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:24,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:24,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104963960] [2025-04-14 00:11:24,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104963960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:24,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:24,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:11:24,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087044525] [2025-04-14 00:11:24,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:24,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:11:24,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:24,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:11:24,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:11:24,112 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2025-04-14 00:11:24,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:24,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:24,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2025-04-14 00:11:24,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:24,265 INFO L116 PetriNetUnfolderBase]: 255/518 cut-off events. [2025-04-14 00:11:24,266 INFO L117 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-04-14 00:11:24,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 518 events. 255/518 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1962 event pairs, 206 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 1162. Up to 434 conditions per place. [2025-04-14 00:11:24,270 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 40 selfloop transitions, 9 changer transitions 0/51 dead transitions. [2025-04-14 00:11:24,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 261 flow [2025-04-14 00:11:24,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:11:24,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:11:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-04-14 00:11:24,275 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-04-14 00:11:24,275 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 114 flow. Second operand 3 states and 56 transitions. [2025-04-14 00:11:24,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 261 flow [2025-04-14 00:11:24,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:11:24,279 INFO L231 Difference]: Finished difference. Result has 42 places, 43 transitions, 174 flow [2025-04-14 00:11:24,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=42, PETRI_TRANSITIONS=43} [2025-04-14 00:11:24,281 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2025-04-14 00:11:24,282 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 174 flow [2025-04-14 00:11:24,282 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:24,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:24,282 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:24,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:11:24,282 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:24,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:24,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2004090671, now seen corresponding path program 1 times [2025-04-14 00:11:24,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:24,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69088729] [2025-04-14 00:11:24,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:24,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:24,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:11:24,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:11:24,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:24,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:25,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:25,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69088729] [2025-04-14 00:11:25,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69088729] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:25,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:25,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:11:25,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860510824] [2025-04-14 00:11:25,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:25,041 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:11:25,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:25,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:11:25,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:11:25,042 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2025-04-14 00:11:25,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 43 transitions, 174 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:25,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:25,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2025-04-14 00:11:25,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:25,405 INFO L116 PetriNetUnfolderBase]: 283/571 cut-off events. [2025-04-14 00:11:25,405 INFO L117 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-04-14 00:11:25,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 571 events. 283/571 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2373 event pairs, 43 based on Foata normal form. 8/566 useless extension candidates. Maximal degree in co-relation 1357. Up to 375 conditions per place. [2025-04-14 00:11:25,410 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 81 selfloop transitions, 18 changer transitions 0/101 dead transitions. [2025-04-14 00:11:25,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 101 transitions, 508 flow [2025-04-14 00:11:25,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:11:25,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:11:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2025-04-14 00:11:25,415 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29545454545454547 [2025-04-14 00:11:25,415 INFO L175 Difference]: Start difference. First operand has 42 places, 43 transitions, 174 flow. Second operand 10 states and 130 transitions. [2025-04-14 00:11:25,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 101 transitions, 508 flow [2025-04-14 00:11:25,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 101 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:11:25,420 INFO L231 Difference]: Finished difference. Result has 56 places, 59 transitions, 273 flow [2025-04-14 00:11:25,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=273, PETRI_PLACES=56, PETRI_TRANSITIONS=59} [2025-04-14 00:11:25,421 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2025-04-14 00:11:25,421 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 59 transitions, 273 flow [2025-04-14 00:11:25,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:25,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:25,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:25,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:11:25,423 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:25,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:25,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1951411939, now seen corresponding path program 2 times [2025-04-14 00:11:25,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:25,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278117985] [2025-04-14 00:11:25,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:11:25,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:25,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:11:25,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:11:25,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:11:25,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:25,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:25,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278117985] [2025-04-14 00:11:25,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278117985] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:25,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:25,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:11:25,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793469937] [2025-04-14 00:11:25,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:25,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:11:25,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:25,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:11:25,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:11:25,930 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2025-04-14 00:11:25,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 59 transitions, 273 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:25,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:25,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2025-04-14 00:11:25,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:26,388 INFO L116 PetriNetUnfolderBase]: 354/724 cut-off events. [2025-04-14 00:11:26,388 INFO L117 PetriNetUnfolderBase]: For 450/450 co-relation queries the response was YES. [2025-04-14 00:11:26,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2200 conditions, 724 events. 354/724 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3381 event pairs, 27 based on Foata normal form. 8/697 useless extension candidates. Maximal degree in co-relation 2187. Up to 307 conditions per place. [2025-04-14 00:11:26,394 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 117 selfloop transitions, 30 changer transitions 0/149 dead transitions. [2025-04-14 00:11:26,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 149 transitions, 910 flow [2025-04-14 00:11:26,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:11:26,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:11:26,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 158 transitions. [2025-04-14 00:11:26,396 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32644628099173556 [2025-04-14 00:11:26,396 INFO L175 Difference]: Start difference. First operand has 56 places, 59 transitions, 273 flow. Second operand 11 states and 158 transitions. [2025-04-14 00:11:26,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 149 transitions, 910 flow [2025-04-14 00:11:26,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 149 transitions, 908 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:11:26,403 INFO L231 Difference]: Finished difference. Result has 69 places, 77 transitions, 455 flow [2025-04-14 00:11:26,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=455, PETRI_PLACES=69, PETRI_TRANSITIONS=77} [2025-04-14 00:11:26,404 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2025-04-14 00:11:26,404 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 77 transitions, 455 flow [2025-04-14 00:11:26,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:26,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:26,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:26,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:11:26,404 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:26,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:26,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1364550727, now seen corresponding path program 3 times [2025-04-14 00:11:26,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:26,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403968373] [2025-04-14 00:11:26,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:11:26,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:26,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:11:26,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:11:26,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:11:26,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:11:26,440 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:11:26,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:11:26,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:11:26,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:26,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:11:26,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:11:26,493 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:11:26,496 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-04-14 00:11:26,497 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-04-14 00:11:26,497 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-14 00:11:26,497 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-14 00:11:26,497 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-14 00:11:26,498 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-14 00:11:26,498 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-04-14 00:11:26,498 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-04-14 00:11:26,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:11:26,498 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-04-14 00:11:26,557 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:11:26,557 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:11:26,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:11:26 BasicIcfg [2025-04-14 00:11:26,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:11:26,564 INFO L158 Benchmark]: Toolchain (without parser) took 5696.19ms. Allocated memory was 155.2MB in the beginning and 373.3MB in the end (delta: 218.1MB). Free memory was 104.7MB in the beginning and 192.3MB in the end (delta: -87.6MB). Peak memory consumption was 130.5MB. Max. memory is 8.0GB. [2025-04-14 00:11:26,564 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:11:26,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.71ms. Allocated memory is still 155.2MB. Free memory was 104.7MB in the beginning and 70.3MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-14 00:11:26,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.67ms. Allocated memory is still 155.2MB. Free memory was 70.3MB in the beginning and 68.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:11:26,565 INFO L158 Benchmark]: Boogie Preprocessor took 54.47ms. Allocated memory is still 155.2MB. Free memory was 68.0MB in the beginning and 64.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:11:26,567 INFO L158 Benchmark]: IcfgBuilder took 822.64ms. Allocated memory is still 155.2MB. Free memory was 64.6MB in the beginning and 77.2MB in the end (delta: -12.6MB). Peak memory consumption was 51.0MB. Max. memory is 8.0GB. [2025-04-14 00:11:26,567 INFO L158 Benchmark]: TraceAbstraction took 4204.50ms. Allocated memory was 155.2MB in the beginning and 373.3MB in the end (delta: 218.1MB). Free memory was 76.4MB in the beginning and 192.3MB in the end (delta: -115.9MB). Peak memory consumption was 100.4MB. Max. memory is 8.0GB. [2025-04-14 00:11:26,568 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 559.71ms. Allocated memory is still 155.2MB. Free memory was 104.7MB in the beginning and 70.3MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.67ms. Allocated memory is still 155.2MB. Free memory was 70.3MB in the beginning and 68.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 54.47ms. Allocated memory is still 155.2MB. Free memory was 68.0MB in the beginning and 64.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 822.64ms. Allocated memory is still 155.2MB. Free memory was 64.6MB in the beginning and 77.2MB in the end (delta: -12.6MB). Peak memory consumption was 51.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4204.50ms. Allocated memory was 155.2MB in the beginning and 373.3MB in the end (delta: 218.1MB). Free memory was 76.4MB in the beginning and 192.3MB in the end (delta: -115.9MB). Peak memory consumption was 100.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; [L3962] CALL, EXPR 0 my_drv_init() [L3956] 0 return 0; [L3962] RET, EXPR 0 my_drv_init() [L3962] 0 int ret = my_drv_init(); [L3963] COND TRUE 0 ret==0 [L3964] 0 int probe_ret; [L3965] 0 struct my_data data; [L3966] CALL, EXPR 0 my_drv_probe(&data) [L3919] 0 struct device *d = &data->dev; [L3923] 0 data->shared.a = 0 [L3924] 0 data->shared.b = 0 [L3925] 0 int res = __VERIFIER_nondet_int(); [L3926] COND FALSE 0 !(\read(res)) [L3929] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\at(arg, Pre)={6:24}, \at(data, Pre)={6:0}, d={6:24}, data={6:0}, res=0, t1=-1, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3907] 1 data->shared.a = 1 VAL [\at(arg, Pre)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1=-1, t2=0] [L3910] EXPR 1 data->shared.b [L3910] 1 int lb = data->shared.b; [L3913] 1 data->shared.b = lb + 1 VAL [\at(arg, Pre)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3916] 1 return 0; [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\at(arg, Pre)={6:24}, \at(data, Pre)={6:0}, \result={0:0}, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, res=0, t1=-1, t2=0] [L3902] 2 struct device *dev = (struct device*)arg; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3931] 0 return 0; [L3966] RET, EXPR 0 my_drv_probe(&data) [L3966] 0 probe_ret = my_drv_probe(&data) [L3967] COND TRUE 0 probe_ret==0 [L3968] CALL 0 my_drv_disconnect(&data) [L3937] 0 void *status; VAL [\at(arg, Pre)={6:24}, \at(data, Pre)={6:0}, \result={0:0}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1=-1, t2=0] [L3938] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\at(arg, Pre)={6:24}, \at(data, Pre)={6:0}, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1=-1, t2=0] [L3941] 0 data->shared.a = 3 VAL [\at(arg, Pre)={6:24}, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3907] 2 data->shared.a = 1 VAL [\at(arg, Pre)={6:24}, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3944] 0 data->shared.b = 3 VAL [\at(arg, Pre)={6:24}, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3947] EXPR 0 data->shared.a [L3947] CALL 0 ldv_assert(data->shared.a==3) [L3887] COND TRUE 0 !expression [L3887] 0 reach_error() VAL [\at(arg, Pre)={6:24}, \at(expression, Pre)=0, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, expression=0, lb=0, t1=-1, t2=0] - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3929]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3930]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 49 locations, 56 edges, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 241 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 661 IncrementalHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 0 mSDtfsCounter, 661 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=455occurred in iteration=5, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-14 00:11:26,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...