/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-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:11:18,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:11:18,492 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,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:11:18,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:11:18,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:11:18,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:11:18,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:11:18,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:11:18,517 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:11:18,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:11:18,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:11:18,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:11:18,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:11:18,517 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:11:18,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:11:18,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:11:18,518 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:11:18,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:11:18,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:11:18,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:11:18,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:11:18,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:11:18,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:11:18,518 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:11:18,518 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:11:18,518 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:11:18,518 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:11:18,518 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:11:18,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:11:18,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:11:18,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:11:18,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:11:18,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:11:18,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:11:18,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:11:18,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:11:18,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:11:18,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:11:18,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:11:18,519 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:11:18,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:11:18,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:11:18,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:11:18,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:11:18,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:11:18,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:11:18,519 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,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:11:18,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:11:18,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:11:18,766 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:11:18,768 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:11:18,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2025-04-14 00:11:20,104 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a2d09973/8b2adb51360540a3918d015a39563c94/FLAGe4a61a901 [2025-04-14 00:11:20,446 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:11:20,447 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2025-04-14 00:11:20,476 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a2d09973/8b2adb51360540a3918d015a39563c94/FLAGe4a61a901 [2025-04-14 00:11:21,105 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a2d09973/8b2adb51360540a3918d015a39563c94 [2025-04-14 00:11:21,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:11:21,109 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:11:21,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:11:21,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:11:21,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:11:21,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:11:21" (1/1) ... [2025-04-14 00:11:21,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b05d352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21, skipping insertion in model container [2025-04-14 00:11:21,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:11:21" (1/1) ... [2025-04-14 00:11:21,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:11:21,443 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-3_1-container_of-global.i[186210,186223] [2025-04-14 00:11:21,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:11:21,478 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:11:21,530 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-3_1-container_of-global.i[186210,186223] [2025-04-14 00:11:21,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:11:21,570 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:11:21,571 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,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:11:21,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:11:21,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:11:21,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:11:21,576 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,603 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,628 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 127 [2025-04-14 00:11:21,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:11:21,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:11:21,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:11:21,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:11:21,638 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,638 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,644 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,669 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 13, 2]. 76 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 6, 2]. [2025-04-14 00:11:21,670 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,671 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,713 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,719 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,725 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,730 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,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:11:21,746 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:11:21,746 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:11:21,746 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:11:21,751 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,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:11:21,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:11:21,781 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,785 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,802 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-04-14 00:11:21,802 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-04-14 00:11:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-14 00:11:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-14 00:11:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 00:11:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:11:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:11:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-14 00:11:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:11:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:11:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-14 00:11:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 00:11:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:11:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-14 00:11:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-14 00:11:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-14 00:11:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:11:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:11:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 00:11:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:11:21,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:11:21,804 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:22,023 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:11:22,025 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:11:22,235 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:11:22,236 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:11:22,236 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:11:22,453 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,480 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,515 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:11:22,515 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,515 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:11:22,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:11:22,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:11:22,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:11:22,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:11:21" (1/3) ... [2025-04-14 00:11:22,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d98c5 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,522 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,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d98c5 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,522 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,523 INFO L128 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2025-04-14 00:11:22,534 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:11:22,535 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-3_1-container_of-global.i that has 2 procedures, 22 locations, 27 edges, 1 initial locations, 0 loop locations, and 6 error locations. [2025-04-14 00:11:22,536 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:11:22,596 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 00:11:22,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 34 transitions, 82 flow [2025-04-14 00:11:22,680 INFO L116 PetriNetUnfolderBase]: 3/32 cut-off events. [2025-04-14 00:11:22,681 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:11:22,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 32 events. 3/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 59 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 13. Up to 3 conditions per place. [2025-04-14 00:11:22,683 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 34 transitions, 82 flow [2025-04-14 00:11:22,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 68 flow [2025-04-14 00:11:22,698 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:11:22,713 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;@278dd97c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:11:22,714 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-14 00:11:22,716 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:11:22,716 INFO L116 PetriNetUnfolderBase]: 0/0 cut-off events. [2025-04-14 00:11:22,716 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:11:22,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:22,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1] [2025-04-14 00:11:22,717 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:22,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:22,722 INFO L85 PathProgramCache]: Analyzing trace with hash 395, now seen corresponding path program 1 times [2025-04-14 00:11:22,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:22,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736136323] [2025-04-14 00:11:22,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:22,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:22,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-14 00:11:22,918 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,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:22,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:23,176 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,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:23,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736136323] [2025-04-14 00:11:23,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736136323] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:23,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:23,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2025-04-14 00:11:23,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549073146] [2025-04-14 00:11:23,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:23,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 00:11:23,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:23,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 00:11:23,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 00:11:23,205 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-14 00:11:23,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 68 flow. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-14 00:11:23,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:23,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-14 00:11:23,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:23,327 INFO L116 PetriNetUnfolderBase]: 105/205 cut-off events. [2025-04-14 00:11:23,327 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-14 00:11:23,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 205 events. 105/205 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 600 event pairs, 105 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 368. Up to 206 conditions per place. [2025-04-14 00:11:23,332 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 20 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2025-04-14 00:11:23,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 92 flow [2025-04-14 00:11:23,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 00:11:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 00:11:23,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2025-04-14 00:11:23,344 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-04-14 00:11:23,345 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 68 flow. Second operand 2 states and 32 transitions. [2025-04-14 00:11:23,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 92 flow [2025-04-14 00:11:23,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 20 transitions, 84 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:11:23,353 INFO L231 Difference]: Finished difference. Result has 24 places, 20 transitions, 44 flow [2025-04-14 00:11:23,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=24, PETRI_TRANSITIONS=20} [2025-04-14 00:11:23,363 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -7 predicate places. [2025-04-14 00:11:23,365 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 44 flow [2025-04-14 00:11:23,365 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-14 00:11:23,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:23,365 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,365 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:11:23,365 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:23,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:23,366 INFO L85 PathProgramCache]: Analyzing trace with hash 448520891, now seen corresponding path program 1 times [2025-04-14 00:11:23,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:23,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974376478] [2025-04-14 00:11:23,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:23,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:23,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:11:23,462 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,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:23,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:23,995 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,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:23,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974376478] [2025-04-14 00:11:23,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974376478] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:23,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:23,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:11:23,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828735358] [2025-04-14 00:11:23,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:23,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:11:23,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:23,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:11:23,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:11:23,998 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-14 00:11:23,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 44 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:23,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-14 00:11:23,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:24,177 INFO L116 PetriNetUnfolderBase]: 125/250 cut-off events. [2025-04-14 00:11:24,177 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-14 00:11:24,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 250 events. 125/250 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 842 event pairs, 15 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 507. Up to 115 conditions per place. [2025-04-14 00:11:24,181 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 35 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2025-04-14 00:11:24,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 40 transitions, 167 flow [2025-04-14 00:11:24,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:11:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:11:24,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2025-04-14 00:11:24,183 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3 [2025-04-14 00:11:24,183 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 44 flow. Second operand 5 states and 51 transitions. [2025-04-14 00:11:24,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 40 transitions, 167 flow [2025-04-14 00:11:24,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 40 transitions, 167 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:11:24,184 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 71 flow [2025-04-14 00:11:24,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=71, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2025-04-14 00:11:24,185 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2025-04-14 00:11:24,185 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 71 flow [2025-04-14 00:11:24,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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:24,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:24,186 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:24,186 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:11:24,187 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:24,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:24,187 INFO L85 PathProgramCache]: Analyzing trace with hash -2075672972, now seen corresponding path program 1 times [2025-04-14 00:11:24,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:24,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144096083] [2025-04-14 00:11:24,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:24,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:24,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:11:24,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:11:24,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:24,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:24,660 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,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:24,660 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144096083] [2025-04-14 00:11:24,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144096083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:24,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:24,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:11:24,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988466093] [2025-04-14 00:11:24,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:24,661 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:11:24,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:24,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:11:24,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:11:24,662 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-14 00:11:24,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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:24,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:24,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-14 00:11:24,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:24,841 INFO L116 PetriNetUnfolderBase]: 135/272 cut-off events. [2025-04-14 00:11:24,842 INFO L117 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2025-04-14 00:11:24,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 272 events. 135/272 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1000 event pairs, 17 based on Foata normal form. 4/276 useless extension candidates. Maximal degree in co-relation 628. Up to 187 conditions per place. [2025-04-14 00:11:24,844 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 37 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2025-04-14 00:11:24,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 43 transitions, 221 flow [2025-04-14 00:11:24,845 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:11:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:11:24,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-04-14 00:11:24,845 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3058823529411765 [2025-04-14 00:11:24,845 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 71 flow. Second operand 5 states and 52 transitions. [2025-04-14 00:11:24,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 43 transitions, 221 flow [2025-04-14 00:11:24,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 43 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:11:24,847 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 104 flow [2025-04-14 00:11:24,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2025-04-14 00:11:24,847 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2025-04-14 00:11:24,847 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 104 flow [2025-04-14 00:11:24,847 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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:24,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:24,848 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:24,848 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:11:24,848 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:24,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:24,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1360630992, now seen corresponding path program 2 times [2025-04-14 00:11:24,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:24,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906709162] [2025-04-14 00:11:24,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:11:24,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:24,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:11:24,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:11:24,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:11:24,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:25,656 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,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:25,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906709162] [2025-04-14 00:11:25,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906709162] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:25,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:25,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:11:25,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988614827] [2025-04-14 00:11:25,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:25,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:11:25,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:25,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:11:25,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:11:25,658 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-14 00:11:25,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 104 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:25,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-14 00:11:25,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:25,885 INFO L116 PetriNetUnfolderBase]: 176/359 cut-off events. [2025-04-14 00:11:25,885 INFO L117 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-04-14 00:11:25,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 359 events. 176/359 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1402 event pairs, 38 based on Foata normal form. 1/360 useless extension candidates. Maximal degree in co-relation 992. Up to 184 conditions per place. [2025-04-14 00:11:25,888 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 51 selfloop transitions, 9 changer transitions 0/60 dead transitions. [2025-04-14 00:11:25,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 60 transitions, 352 flow [2025-04-14 00:11:25,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:11:25,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:11:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2025-04-14 00:11:25,889 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27310924369747897 [2025-04-14 00:11:25,889 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 104 flow. Second operand 7 states and 65 transitions. [2025-04-14 00:11:25,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 60 transitions, 352 flow [2025-04-14 00:11:25,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 60 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:11:25,891 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 176 flow [2025-04-14 00:11:25,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=176, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2025-04-14 00:11:25,893 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2025-04-14 00:11:25,893 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 176 flow [2025-04-14 00:11:25,894 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:25,894 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:25,894 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:11:25,894 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:25,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:25,894 INFO L85 PathProgramCache]: Analyzing trace with hash 274232224, now seen corresponding path program 3 times [2025-04-14 00:11:25,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:25,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032122688] [2025-04-14 00:11:25,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:11:25,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:25,918 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:11:25,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:11:25,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:11:25,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:26,169 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:26,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:26,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032122688] [2025-04-14 00:11:26,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032122688] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:26,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:26,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:11:26,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432263320] [2025-04-14 00:11:26,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:26,170 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:11:26,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:26,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:11:26,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:11:26,170 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-14 00:11:26,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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:26,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:26,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-14 00:11:26,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:26,343 INFO L116 PetriNetUnfolderBase]: 226/477 cut-off events. [2025-04-14 00:11:26,343 INFO L117 PetriNetUnfolderBase]: For 457/457 co-relation queries the response was YES. [2025-04-14 00:11:26,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 477 events. 226/477 cut-off events. For 457/457 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2223 event pairs, 51 based on Foata normal form. 8/485 useless extension candidates. Maximal degree in co-relation 1427. Up to 321 conditions per place. [2025-04-14 00:11:26,347 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 53 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2025-04-14 00:11:26,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 439 flow [2025-04-14 00:11:26,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:11:26,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:11:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2025-04-14 00:11:26,348 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3588235294117647 [2025-04-14 00:11:26,349 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 176 flow. Second operand 5 states and 61 transitions. [2025-04-14 00:11:26,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 439 flow [2025-04-14 00:11:26,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 414 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-14 00:11:26,351 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 243 flow [2025-04-14 00:11:26,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2025-04-14 00:11:26,353 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2025-04-14 00:11:26,354 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 243 flow [2025-04-14 00:11:26,354 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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:26,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:26,354 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:26,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:11:26,354 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:26,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:26,354 INFO L85 PathProgramCache]: Analyzing trace with hash -383942924, now seen corresponding path program 4 times [2025-04-14 00:11:26,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:26,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563506366] [2025-04-14 00:11:26,355 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:11:26,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:26,371 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-14 00:11:26,395 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:11:26,396 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:11:26,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:26,758 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:26,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:26,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563506366] [2025-04-14 00:11:26,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563506366] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:26,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:26,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:11:26,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815534914] [2025-04-14 00:11:26,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:26,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:11:26,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:26,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:11:26,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:11:26,760 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-14 00:11:26,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 243 flow. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:26,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-14 00:11:26,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:26,942 INFO L116 PetriNetUnfolderBase]: 218/467 cut-off events. [2025-04-14 00:11:26,942 INFO L117 PetriNetUnfolderBase]: For 839/839 co-relation queries the response was YES. [2025-04-14 00:11:26,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 467 events. 218/467 cut-off events. For 839/839 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2126 event pairs, 55 based on Foata normal form. 6/473 useless extension candidates. Maximal degree in co-relation 1535. Up to 329 conditions per place. [2025-04-14 00:11:26,946 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 44 selfloop transitions, 15 changer transitions 0/59 dead transitions. [2025-04-14 00:11:26,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 477 flow [2025-04-14 00:11:26,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:11:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:11:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2025-04-14 00:11:26,949 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2647058823529412 [2025-04-14 00:11:26,949 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 243 flow. Second operand 6 states and 54 transitions. [2025-04-14 00:11:26,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 477 flow [2025-04-14 00:11:26,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 470 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:11:26,953 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 324 flow [2025-04-14 00:11:26,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2025-04-14 00:11:26,954 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 23 predicate places. [2025-04-14 00:11:26,954 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 324 flow [2025-04-14 00:11:26,954 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:26,954 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:26,954 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:11:26,954 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:26,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:26,955 INFO L85 PathProgramCache]: Analyzing trace with hash -542342884, now seen corresponding path program 5 times [2025-04-14 00:11:26,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:26,955 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714122124] [2025-04-14 00:11:26,955 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:11:26,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:26,973 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:11:26,985 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:11:26,986 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:11:26,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:27,503 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:27,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:27,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714122124] [2025-04-14 00:11:27,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714122124] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:27,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:27,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:11:27,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616152762] [2025-04-14 00:11:27,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:27,504 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:11:27,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:27,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:11:27,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:11:27,505 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-14 00:11:27,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 324 flow. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:27,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:27,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-14 00:11:27,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:27,774 INFO L116 PetriNetUnfolderBase]: 217/466 cut-off events. [2025-04-14 00:11:27,775 INFO L117 PetriNetUnfolderBase]: For 1105/1105 co-relation queries the response was YES. [2025-04-14 00:11:27,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1701 conditions, 466 events. 217/466 cut-off events. For 1105/1105 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2108 event pairs, 42 based on Foata normal form. 1/467 useless extension candidates. Maximal degree in co-relation 1684. Up to 269 conditions per place. [2025-04-14 00:11:27,778 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 61 selfloop transitions, 13 changer transitions 0/74 dead transitions. [2025-04-14 00:11:27,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 634 flow [2025-04-14 00:11:27,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:11:27,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:11:27,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2025-04-14 00:11:27,779 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3025210084033613 [2025-04-14 00:11:27,779 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 324 flow. Second operand 7 states and 72 transitions. [2025-04-14 00:11:27,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 634 flow [2025-04-14 00:11:27,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 623 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:11:27,784 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 379 flow [2025-04-14 00:11:27,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=379, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2025-04-14 00:11:27,784 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 29 predicate places. [2025-04-14 00:11:27,784 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 379 flow [2025-04-14 00:11:27,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:27,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:27,785 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:27,785 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:11:27,785 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:27,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:27,789 INFO L85 PathProgramCache]: Analyzing trace with hash 681325140, now seen corresponding path program 6 times [2025-04-14 00:11:27,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:27,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864957575] [2025-04-14 00:11:27,789 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:11:27,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:27,806 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:11:27,815 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:11:27,816 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:11:27,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:27,982 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:27,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:27,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864957575] [2025-04-14 00:11:27,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864957575] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:27,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:27,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:11:27,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210550310] [2025-04-14 00:11:27,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:27,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:11:27,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:27,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:11:27,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:11:27,984 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-14 00:11:27,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 379 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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:27,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:27,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-14 00:11:27,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:28,127 INFO L116 PetriNetUnfolderBase]: 164/373 cut-off events. [2025-04-14 00:11:28,127 INFO L117 PetriNetUnfolderBase]: For 1087/1087 co-relation queries the response was YES. [2025-04-14 00:11:28,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1408 conditions, 373 events. 164/373 cut-off events. For 1087/1087 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1615 event pairs, 45 based on Foata normal form. 8/381 useless extension candidates. Maximal degree in co-relation 1389. Up to 150 conditions per place. [2025-04-14 00:11:28,131 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 53 selfloop transitions, 13 changer transitions 0/66 dead transitions. [2025-04-14 00:11:28,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 593 flow [2025-04-14 00:11:28,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:11:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:11:28,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2025-04-14 00:11:28,133 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3588235294117647 [2025-04-14 00:11:28,133 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 379 flow. Second operand 5 states and 61 transitions. [2025-04-14 00:11:28,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 593 flow [2025-04-14 00:11:28,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 526 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-04-14 00:11:28,138 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 398 flow [2025-04-14 00:11:28,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=398, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2025-04-14 00:11:28,140 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 31 predicate places. [2025-04-14 00:11:28,140 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 398 flow [2025-04-14 00:11:28,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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:28,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:28,140 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:28,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:11:28,140 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:28,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:28,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1396367956, now seen corresponding path program 7 times [2025-04-14 00:11:28,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:28,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230436439] [2025-04-14 00:11:28,141 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:11:28,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:28,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:11:28,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:11:28,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:28,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:28,600 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:28,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:28,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230436439] [2025-04-14 00:11:28,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230436439] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:28,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:28,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:11:28,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65399571] [2025-04-14 00:11:28,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:28,601 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:11:28,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:28,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:11:28,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:11:28,602 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-14 00:11:28,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 398 flow. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:28,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:28,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-14 00:11:28,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:28,859 INFO L116 PetriNetUnfolderBase]: 163/372 cut-off events. [2025-04-14 00:11:28,860 INFO L117 PetriNetUnfolderBase]: For 1259/1259 co-relation queries the response was YES. [2025-04-14 00:11:28,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1364 conditions, 372 events. 163/372 cut-off events. For 1259/1259 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1600 event pairs, 38 based on Foata normal form. 1/373 useless extension candidates. Maximal degree in co-relation 1344. Up to 195 conditions per place. [2025-04-14 00:11:28,863 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 42 selfloop transitions, 14 changer transitions 15/71 dead transitions. [2025-04-14 00:11:28,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 655 flow [2025-04-14 00:11:28,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:11:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:11:28,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2025-04-14 00:11:28,864 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28991596638655465 [2025-04-14 00:11:28,864 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 398 flow. Second operand 7 states and 69 transitions. [2025-04-14 00:11:28,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 655 flow [2025-04-14 00:11:28,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 71 transitions, 624 flow, removed 13 selfloop flow, removed 1 redundant places. [2025-04-14 00:11:28,871 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 411 flow [2025-04-14 00:11:28,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=411, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2025-04-14 00:11:28,871 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 38 predicate places. [2025-04-14 00:11:28,871 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 46 transitions, 411 flow [2025-04-14 00:11:28,873 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:28,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:28,873 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:28,873 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:11:28,873 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:28,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:28,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1337651738, now seen corresponding path program 8 times [2025-04-14 00:11:28,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:28,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930536343] [2025-04-14 00:11:28,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:11:28,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:28,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:11:28,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:11:28,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:11:28,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:29,349 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:29,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:29,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930536343] [2025-04-14 00:11:29,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930536343] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:29,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:29,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:11:29,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171339688] [2025-04-14 00:11:29,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:29,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:11:29,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:29,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:11:29,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:11:29,351 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-14 00:11:29,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 46 transitions, 411 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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:29,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:29,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-14 00:11:29,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:29,560 INFO L116 PetriNetUnfolderBase]: 161/370 cut-off events. [2025-04-14 00:11:29,560 INFO L117 PetriNetUnfolderBase]: For 1093/1093 co-relation queries the response was YES. [2025-04-14 00:11:29,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 370 events. 161/370 cut-off events. For 1093/1093 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1603 event pairs, 38 based on Foata normal form. 1/371 useless extension candidates. Maximal degree in co-relation 1346. Up to 205 conditions per place. [2025-04-14 00:11:29,562 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 44 selfloop transitions, 9 changer transitions 21/74 dead transitions. [2025-04-14 00:11:29,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 74 transitions, 672 flow [2025-04-14 00:11:29,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:11:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:11:29,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2025-04-14 00:11:29,563 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28991596638655465 [2025-04-14 00:11:29,563 INFO L175 Difference]: Start difference. First operand has 69 places, 46 transitions, 411 flow. Second operand 7 states and 69 transitions. [2025-04-14 00:11:29,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 74 transitions, 672 flow [2025-04-14 00:11:29,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 74 transitions, 636 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-04-14 00:11:29,569 INFO L231 Difference]: Finished difference. Result has 69 places, 42 transitions, 352 flow [2025-04-14 00:11:29,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=352, PETRI_PLACES=69, PETRI_TRANSITIONS=42} [2025-04-14 00:11:29,570 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 38 predicate places. [2025-04-14 00:11:29,570 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 42 transitions, 352 flow [2025-04-14 00:11:29,570 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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:29,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:29,570 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:29,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:11:29,570 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:29,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:29,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1280446734, now seen corresponding path program 9 times [2025-04-14 00:11:29,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:29,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691503087] [2025-04-14 00:11:29,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:11:29,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:29,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:11:29,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:11:29,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:11:29,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:30,024 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:30,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:30,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691503087] [2025-04-14 00:11:30,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691503087] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:30,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:30,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:11:30,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019476474] [2025-04-14 00:11:30,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:30,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:11:30,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:30,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:11:30,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:11:30,026 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-14 00:11:30,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 42 transitions, 352 flow. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:30,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:30,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-14 00:11:30,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:30,218 INFO L116 PetriNetUnfolderBase]: 119/280 cut-off events. [2025-04-14 00:11:30,218 INFO L117 PetriNetUnfolderBase]: For 751/751 co-relation queries the response was YES. [2025-04-14 00:11:30,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 280 events. 119/280 cut-off events. For 751/751 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1092 event pairs, 36 based on Foata normal form. 1/281 useless extension candidates. Maximal degree in co-relation 1003. Up to 150 conditions per place. [2025-04-14 00:11:30,220 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 34 selfloop transitions, 9 changer transitions 19/62 dead transitions. [2025-04-14 00:11:30,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 62 transitions, 550 flow [2025-04-14 00:11:30,221 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:11:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:11:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2025-04-14 00:11:30,221 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2815126050420168 [2025-04-14 00:11:30,221 INFO L175 Difference]: Start difference. First operand has 69 places, 42 transitions, 352 flow. Second operand 7 states and 67 transitions. [2025-04-14 00:11:30,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 62 transitions, 550 flow [2025-04-14 00:11:30,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 62 transitions, 508 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-14 00:11:30,224 INFO L231 Difference]: Finished difference. Result has 66 places, 36 transitions, 277 flow [2025-04-14 00:11:30,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=277, PETRI_PLACES=66, PETRI_TRANSITIONS=36} [2025-04-14 00:11:30,225 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2025-04-14 00:11:30,225 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 36 transitions, 277 flow [2025-04-14 00:11:30,225 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:30,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:30,225 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:30,225 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:11:30,225 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:30,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:30,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1530847969, now seen corresponding path program 2 times [2025-04-14 00:11:30,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:30,226 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207049088] [2025-04-14 00:11:30,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:11:30,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:30,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:11:30,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:11:30,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:11:30,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:30,424 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:30,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:30,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207049088] [2025-04-14 00:11:30,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207049088] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:30,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:30,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:11:30,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956411252] [2025-04-14 00:11:30,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:30,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:11:30,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:30,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:11:30,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:11:30,425 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-14 00:11:30,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 36 transitions, 277 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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:30,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:30,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-14 00:11:30,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:30,504 INFO L116 PetriNetUnfolderBase]: 85/202 cut-off events. [2025-04-14 00:11:30,504 INFO L117 PetriNetUnfolderBase]: For 486/486 co-relation queries the response was YES. [2025-04-14 00:11:30,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 202 events. 85/202 cut-off events. For 486/486 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 693 event pairs, 9 based on Foata normal form. 3/205 useless extension candidates. Maximal degree in co-relation 707. Up to 94 conditions per place. [2025-04-14 00:11:30,505 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 21 selfloop transitions, 4 changer transitions 16/41 dead transitions. [2025-04-14 00:11:30,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 41 transitions, 368 flow [2025-04-14 00:11:30,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:11:30,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:11:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2025-04-14 00:11:30,506 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.23529411764705882 [2025-04-14 00:11:30,506 INFO L175 Difference]: Start difference. First operand has 66 places, 36 transitions, 277 flow. Second operand 5 states and 40 transitions. [2025-04-14 00:11:30,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 41 transitions, 368 flow [2025-04-14 00:11:30,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 41 transitions, 320 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-04-14 00:11:30,508 INFO L231 Difference]: Finished difference. Result has 56 places, 22 transitions, 130 flow [2025-04-14 00:11:30,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=56, PETRI_TRANSITIONS=22} [2025-04-14 00:11:30,509 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 25 predicate places. [2025-04-14 00:11:30,509 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 22 transitions, 130 flow [2025-04-14 00:11:30,509 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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:30,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:30,509 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:30,509 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:11:30,509 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:30,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:30,509 INFO L85 PathProgramCache]: Analyzing trace with hash 860606164, now seen corresponding path program 10 times [2025-04-14 00:11:30,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:30,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323034104] [2025-04-14 00:11:30,511 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:11:30,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:30,524 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-14 00:11:30,530 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:11:30,530 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:11:30,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:30,892 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:30,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:30,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323034104] [2025-04-14 00:11:30,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323034104] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:30,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:30,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:11:30,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809052994] [2025-04-14 00:11:30,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:30,893 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:11:30,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:30,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:11:30,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:11:30,893 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-14 00:11:30,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 22 transitions, 130 flow. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:30,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:30,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-14 00:11:30,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:30,999 INFO L116 PetriNetUnfolderBase]: 30/76 cut-off events. [2025-04-14 00:11:30,999 INFO L117 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2025-04-14 00:11:31,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 76 events. 30/76 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 137 event pairs, 2 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 250. Up to 31 conditions per place. [2025-04-14 00:11:31,000 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 0 selfloop transitions, 0 changer transitions 27/27 dead transitions. [2025-04-14 00:11:31,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 27 transitions, 196 flow [2025-04-14 00:11:31,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:11:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:11:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2025-04-14 00:11:31,001 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.16806722689075632 [2025-04-14 00:11:31,001 INFO L175 Difference]: Start difference. First operand has 56 places, 22 transitions, 130 flow. Second operand 7 states and 40 transitions. [2025-04-14 00:11:31,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 27 transitions, 196 flow [2025-04-14 00:11:31,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 27 transitions, 164 flow, removed 4 selfloop flow, removed 12 redundant places. [2025-04-14 00:11:31,002 INFO L231 Difference]: Finished difference. Result has 42 places, 0 transitions, 0 flow [2025-04-14 00:11:31,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=42, PETRI_TRANSITIONS=0} [2025-04-14 00:11:31,002 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2025-04-14 00:11:31,002 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 0 transitions, 0 flow [2025-04-14 00:11:31,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:31,004 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-04-14 00:11:31,005 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-04-14 00:11:31,005 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-14 00:11:31,005 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-14 00:11:31,005 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-14 00:11:31,005 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-14 00:11:31,005 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-04-14 00:11:31,005 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-04-14 00:11:31,005 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 00:11:31,005 INFO L422 BasicCegarLoop]: Path program histogram: [10, 2, 1] [2025-04-14 00:11:31,012 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:11:31,012 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:11:31,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:11:31 BasicIcfg [2025-04-14 00:11:31,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:11:31,021 INFO L158 Benchmark]: Toolchain (without parser) took 9911.75ms. Allocated memory was 125.8MB in the beginning and 444.6MB in the end (delta: 318.8MB). Free memory was 83.6MB in the beginning and 270.6MB in the end (delta: -187.0MB). Peak memory consumption was 138.0MB. Max. memory is 8.0GB. [2025-04-14 00:11:31,021 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 167.8MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:11:31,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.16ms. Allocated memory is still 125.8MB. Free memory was 83.6MB in the beginning and 50.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-14 00:11:31,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.31ms. Allocated memory is still 125.8MB. Free memory was 50.0MB in the beginning and 47.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:11:31,021 INFO L158 Benchmark]: Boogie Preprocessor took 115.26ms. Allocated memory is still 125.8MB. Free memory was 47.0MB in the beginning and 43.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:11:31,021 INFO L158 Benchmark]: IcfgBuilder took 769.41ms. Allocated memory is still 125.8MB. Free memory was 43.6MB in the beginning and 38.2MB in the end (delta: 5.4MB). Peak memory consumption was 33.0MB. Max. memory is 8.0GB. [2025-04-14 00:11:31,022 INFO L158 Benchmark]: TraceAbstraction took 8503.39ms. Allocated memory was 125.8MB in the beginning and 444.6MB in the end (delta: 318.8MB). Free memory was 38.0MB in the beginning and 270.6MB in the end (delta: -232.6MB). Peak memory consumption was 88.3MB. Max. memory is 8.0GB. [2025-04-14 00:11:31,022 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.22ms. Allocated memory is still 167.8MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 461.16ms. Allocated memory is still 125.8MB. Free memory was 83.6MB in the beginning and 50.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.31ms. Allocated memory is still 125.8MB. Free memory was 50.0MB in the beginning and 47.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 115.26ms. Allocated memory is still 125.8MB. Free memory was 47.0MB in the beginning and 43.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 769.41ms. Allocated memory is still 125.8MB. Free memory was 43.6MB in the beginning and 38.2MB in the end (delta: 5.4MB). Peak memory consumption was 33.0MB. Max. memory is 8.0GB. * TraceAbstraction took 8503.39ms. Allocated memory was 125.8MB in the beginning and 444.6MB in the end (delta: 318.8MB). Free memory was 38.0MB in the beginning and 270.6MB in the end (delta: -232.6MB). Peak memory consumption was 88.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 36 locations, 43 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: 8.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 345 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 345 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1901 IncrementalHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 0 mSDtfsCounter, 1901 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=411occurred in iteration=9, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 2475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 00:11:31,039 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...