/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:44:59,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:44:59,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 23:44:59,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:44:59,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:44:59,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:44:59,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:44:59,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:44:59,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:44:59,267 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:44:59,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:44:59,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:44:59,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:44:59,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:44:59,270 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:44:59,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:44:59,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:44:59,270 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:44:59,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:44:59,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:44:59,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:44:59,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:44:59,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:44:59,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:44:59,270 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:44:59,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:44:59,270 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:44:59,270 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:44:59,271 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:44:59,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:44:59,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:44:59,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:44:59,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:44:59,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:44:59,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:44:59,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:44:59,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:44:59,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:44:59,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:44:59,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:44:59,271 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:44:59,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:44:59,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:44:59,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:44:59,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:44:59,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:44:59,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:44:59,272 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:44:59,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:44:59,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:44:59,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:44:59,494 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:44:59,494 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:44:59,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2025-04-13 23:45:00,769 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10568e13e/9be6165a7156445a95565c19067ac152/FLAG17fe95f61 [2025-04-13 23:45:01,028 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:45:01,029 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2025-04-13 23:45:01,038 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10568e13e/9be6165a7156445a95565c19067ac152/FLAG17fe95f61 [2025-04-13 23:45:01,771 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10568e13e/9be6165a7156445a95565c19067ac152 [2025-04-13 23:45:01,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:45:01,773 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:45:01,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:45:01,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:45:01,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:45:01,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:45:01" (1/1) ... [2025-04-13 23:45:01,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@698b860a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:01, skipping insertion in model container [2025-04-13 23:45:01,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:45:01" (1/1) ... [2025-04-13 23:45:01,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:45:02,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2025-04-13 23:45:02,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2025-04-13 23:45:02,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2025-04-13 23:45:02,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:45:02,189 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:45:02,235 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2025-04-13 23:45:02,236 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2025-04-13 23:45:02,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2025-04-13 23:45:02,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:45:02,351 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:45:02,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:02 WrapperNode [2025-04-13 23:45:02,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:45:02,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:45:02,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:45:02,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:45:02,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:02" (1/1) ... [2025-04-13 23:45:02,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:02" (1/1) ... [2025-04-13 23:45:02,450 INFO L138 Inliner]: procedures = 274, calls = 1656, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 1834 [2025-04-13 23:45:02,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:45:02,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:45:02,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:45:02,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:45:02,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:02" (1/1) ... [2025-04-13 23:45:02,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:02" (1/1) ... [2025-04-13 23:45:02,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:02" (1/1) ... [2025-04-13 23:45:02,503 INFO L175 MemorySlicer]: Split 1644 memory accesses to 4 slices as follows [834, 2, 5, 803]. 51 percent of accesses are in the largest equivalence class. The 1610 initializations are split as follows [803, 2, 5, 800]. The 16 writes are split as follows [14, 0, 0, 2]. [2025-04-13 23:45:02,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:02" (1/1) ... [2025-04-13 23:45:02,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:02" (1/1) ... [2025-04-13 23:45:02,572 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:02" (1/1) ... [2025-04-13 23:45:02,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:02" (1/1) ... [2025-04-13 23:45:02,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:02" (1/1) ... [2025-04-13 23:45:02,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:02" (1/1) ... [2025-04-13 23:45:02,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:45:02,607 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:45:02,607 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:45:02,607 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:45:02,608 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:02" (1/1) ... [2025-04-13 23:45:02,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:45:02,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:45:02,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 23:45:02,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 23:45:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 23:45:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 23:45:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 23:45:02,654 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 23:45:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 23:45:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:45:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:45:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 23:45:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 23:45:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:45:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:45:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 23:45:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 23:45:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 23:45:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:45:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:45:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:45:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 23:45:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 23:45:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:45:02,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:45:02,656 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:45:02,772 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:45:02,774 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:45:04,214 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:45:04,215 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:45:04,215 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:45:42,384 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:45:42,385 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:45:42,386 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:45:42,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:45:42 BoogieIcfgContainer [2025-04-13 23:45:42,388 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:45:42,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:45:42,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:45:42,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:45:42,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:45:01" (1/3) ... [2025-04-13 23:45:42,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0d025e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:45:42, skipping insertion in model container [2025-04-13 23:45:42,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:02" (2/3) ... [2025-04-13 23:45:42,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0d025e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:45:42, skipping insertion in model container [2025-04-13 23:45:42,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:45:42" (3/3) ... [2025-04-13 23:45:42,395 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2025-04-13 23:45:42,405 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:45:42,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longest.i that has 3 procedures, 28 locations, 30 edges, 1 initial locations, 2 loop locations, and 3 error locations. [2025-04-13 23:45:42,406 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:45:42,503 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 23:45:42,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 32 transitions, 78 flow [2025-04-13 23:45:42,572 INFO L116 PetriNetUnfolderBase]: 5/30 cut-off events. [2025-04-13 23:45:42,573 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:45:42,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 5/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 52 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 26. Up to 3 conditions per place. [2025-04-13 23:45:42,578 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 32 transitions, 78 flow [2025-04-13 23:45:42,580 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 28 transitions, 65 flow [2025-04-13 23:45:42,589 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:45:42,599 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;@e305070, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:45:42,599 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 23:45:42,600 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:45:42,600 INFO L116 PetriNetUnfolderBase]: 0/0 cut-off events. [2025-04-13 23:45:42,600 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:45:42,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:45:42,601 INFO L206 CegarLoopForPetriNet]: trace histogram [1] [2025-04-13 23:45:42,601 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:45:42,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:45:42,605 INFO L85 PathProgramCache]: Analyzing trace with hash 3789, now seen corresponding path program 1 times [2025-04-13 23:45:42,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:45:42,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644856994] [2025-04-13 23:45:42,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:45:42,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:45:42,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-13 23:45:42,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-13 23:45:42,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:45:42,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:45:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:42,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:45:42,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644856994] [2025-04-13 23:45:42,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644856994] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:45:42,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:45:42,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2025-04-13 23:45:42,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480321501] [2025-04-13 23:45:42,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:45:42,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:45:42,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:45:42,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:45:42,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:45:42,719 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 23:45:42,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 65 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-13 23:45:42,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:45:42,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 23:45:42,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:45:43,186 INFO L116 PetriNetUnfolderBase]: 261/445 cut-off events. [2025-04-13 23:45:43,187 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 23:45:43,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 445 events. 261/445 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1463 event pairs, 222 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 880. Up to 446 conditions per place. [2025-04-13 23:45:43,191 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 24 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2025-04-13 23:45:43,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 24 transitions, 105 flow [2025-04-13 23:45:43,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:45:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:45:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2025-04-13 23:45:43,203 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 23:45:43,203 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 65 flow. Second operand 2 states and 32 transitions. [2025-04-13 23:45:43,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 24 transitions, 105 flow [2025-04-13 23:45:43,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 24 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 23:45:43,209 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 52 flow [2025-04-13 23:45:43,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2025-04-13 23:45:43,215 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2025-04-13 23:45:43,215 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 52 flow [2025-04-13 23:45:43,215 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-13 23:45:43,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:45:43,215 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:45:43,215 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:45:43,215 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:45:43,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:45:43,216 INFO L85 PathProgramCache]: Analyzing trace with hash -677990440, now seen corresponding path program 1 times [2025-04-13 23:45:43,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:45:43,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955939519] [2025-04-13 23:45:43,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:45:43,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:45:43,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:45:43,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:45:43,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:45:43,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:45:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:45,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:45:45,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955939519] [2025-04-13 23:45:45,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955939519] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:45:45,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:45:45,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:45:45,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498194821] [2025-04-13 23:45:45,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:45:45,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:45:45,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:45:45,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:45:45,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:45:45,095 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 23:45:45,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:45,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:45:45,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 23:45:45,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:45:45,945 INFO L116 PetriNetUnfolderBase]: 280/472 cut-off events. [2025-04-13 23:45:45,945 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:45:45,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 472 events. 280/472 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1596 event pairs, 80 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 965. Up to 428 conditions per place. [2025-04-13 23:45:45,950 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2025-04-13 23:45:45,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 142 flow [2025-04-13 23:45:45,950 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:45:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:45:45,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-13 23:45:45,951 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2025-04-13 23:45:45,951 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 52 flow. Second operand 3 states and 41 transitions. [2025-04-13 23:45:45,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 142 flow [2025-04-13 23:45:45,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 142 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 23:45:45,953 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 78 flow [2025-04-13 23:45:45,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2025-04-13 23:45:45,954 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2025-04-13 23:45:45,954 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 78 flow [2025-04-13 23:45:45,954 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:45,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:45:45,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:45:45,954 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:45:45,954 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:45:45,954 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:45:45,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1270349180, now seen corresponding path program 1 times [2025-04-13 23:45:45,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:45:45,955 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387775141] [2025-04-13 23:45:45,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:45:45,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:45:45,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:45:46,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:45:46,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:45:46,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:45:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:46,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:45:46,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387775141] [2025-04-13 23:45:46,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387775141] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:45:46,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:45:46,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:45:46,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370127116] [2025-04-13 23:45:46,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:45:46,265 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:45:46,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:45:46,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:45:46,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:45:46,266 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 23:45:46,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:46,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:45:46,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 23:45:46,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:45:46,633 INFO L116 PetriNetUnfolderBase]: 296/504 cut-off events. [2025-04-13 23:45:46,633 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 23:45:46,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 504 events. 296/504 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1715 event pairs, 143 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 1120. Up to 281 conditions per place. [2025-04-13 23:45:46,635 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 34 selfloop transitions, 2 changer transitions 1/37 dead transitions. [2025-04-13 23:45:46,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 173 flow [2025-04-13 23:45:46,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:45:46,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:45:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-13 23:45:46,636 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-04-13 23:45:46,636 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 78 flow. Second operand 3 states and 42 transitions. [2025-04-13 23:45:46,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 173 flow [2025-04-13 23:45:46,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:45:46,637 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 82 flow [2025-04-13 23:45:46,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2025-04-13 23:45:46,639 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2025-04-13 23:45:46,639 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 82 flow [2025-04-13 23:45:46,639 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:46,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:45:46,639 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:45:46,639 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:45:46,639 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:45:46,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:45:46,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1847568413, now seen corresponding path program 1 times [2025-04-13 23:45:46,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:45:46,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311868072] [2025-04-13 23:45:46,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:45:46,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:45:46,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:45:46,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:45:46,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:45:46,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:45:47,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:47,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:45:47,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311868072] [2025-04-13 23:45:47,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311868072] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:45:47,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:45:47,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:45:47,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69402123] [2025-04-13 23:45:47,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:45:47,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:45:47,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:45:47,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:45:47,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:45:47,076 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 23:45:47,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:47,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:45:47,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 23:45:47,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:45:48,088 INFO L116 PetriNetUnfolderBase]: 221/399 cut-off events. [2025-04-13 23:45:48,089 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-13 23:45:48,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 399 events. 221/399 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1408 event pairs, 78 based on Foata normal form. 30/380 useless extension candidates. Maximal degree in co-relation 906. Up to 227 conditions per place. [2025-04-13 23:45:48,090 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 32 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2025-04-13 23:45:48,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 183 flow [2025-04-13 23:45:48,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:45:48,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:45:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-04-13 23:45:48,092 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-04-13 23:45:48,092 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 82 flow. Second operand 3 states and 44 transitions. [2025-04-13 23:45:48,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 183 flow [2025-04-13 23:45:48,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 181 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:45:48,094 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 92 flow [2025-04-13 23:45:48,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2025-04-13 23:45:48,094 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2025-04-13 23:45:48,094 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 92 flow [2025-04-13 23:45:48,094 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:48,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:45:48,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:45:48,095 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:45:48,095 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:45:48,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:45:48,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1652964285, now seen corresponding path program 1 times [2025-04-13 23:45:48,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:45:48,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706993608] [2025-04-13 23:45:48,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:45:48,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:45:48,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:45:48,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:45:48,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:45:48,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:45:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:49,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:45:49,491 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706993608] [2025-04-13 23:45:49,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706993608] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:45:49,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:45:49,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:45:49,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41687487] [2025-04-13 23:45:49,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:45:49,492 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:45:49,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:45:49,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:45:49,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:45:49,492 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 23:45:49,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:49,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:45:49,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 23:45:49,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:45:50,104 INFO L116 PetriNetUnfolderBase]: 214/386 cut-off events. [2025-04-13 23:45:50,104 INFO L117 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-04-13 23:45:50,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 386 events. 214/386 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1274 event pairs, 87 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 950. Up to 290 conditions per place. [2025-04-13 23:45:50,105 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 30 selfloop transitions, 3 changer transitions 2/35 dead transitions. [2025-04-13 23:45:50,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 184 flow [2025-04-13 23:45:50,106 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:45:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:45:50,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-04-13 23:45:50,107 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40625 [2025-04-13 23:45:50,107 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 92 flow. Second operand 3 states and 39 transitions. [2025-04-13 23:45:50,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 184 flow [2025-04-13 23:45:50,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:45:50,109 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 86 flow [2025-04-13 23:45:50,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2025-04-13 23:45:50,109 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2025-04-13 23:45:50,109 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 86 flow [2025-04-13 23:45:50,109 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:50,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:45:50,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:45:50,109 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:45:50,110 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:45:50,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:45:50,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2016577529, now seen corresponding path program 1 times [2025-04-13 23:45:50,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:45:50,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252912573] [2025-04-13 23:45:50,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:45:50,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:45:50,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:45:50,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:45:50,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:45:50,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:45:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:52,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:45:52,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252912573] [2025-04-13 23:45:52,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252912573] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:45:52,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:45:52,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:45:52,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446143472] [2025-04-13 23:45:52,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:45:52,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:45:52,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:45:52,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:45:52,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:45:52,853 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 23:45:52,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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-13 23:45:52,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:45:52,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 23:45:52,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:45:53,979 INFO L116 PetriNetUnfolderBase]: 209/386 cut-off events. [2025-04-13 23:45:53,980 INFO L117 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-04-13 23:45:53,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 386 events. 209/386 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1341 event pairs, 58 based on Foata normal form. 7/375 useless extension candidates. Maximal degree in co-relation 919. Up to 296 conditions per place. [2025-04-13 23:45:53,982 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 44 selfloop transitions, 11 changer transitions 0/55 dead transitions. [2025-04-13 23:45:53,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 55 transitions, 283 flow [2025-04-13 23:45:53,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:45:53,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 23:45:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2025-04-13 23:45:53,984 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3080357142857143 [2025-04-13 23:45:53,984 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 86 flow. Second operand 7 states and 69 transitions. [2025-04-13 23:45:53,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 55 transitions, 283 flow [2025-04-13 23:45:53,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 55 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:45:53,985 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 154 flow [2025-04-13 23:45:53,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=154, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2025-04-13 23:45:53,986 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2025-04-13 23:45:53,986 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 154 flow [2025-04-13 23:45:53,986 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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-13 23:45:53,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:45:53,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:45:53,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:45:53,986 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:45:53,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:45:53,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1588043469, now seen corresponding path program 2 times [2025-04-13 23:45:53,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:45:53,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207898875] [2025-04-13 23:45:53,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:45:53,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:45:54,023 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:45:54,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:45:54,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:45:54,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:45:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:56,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:45:56,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207898875] [2025-04-13 23:45:56,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207898875] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:45:56,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:45:56,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:45:56,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129067595] [2025-04-13 23:45:56,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:45:56,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:45:56,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:45:56,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:45:56,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:45:56,796 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 23:45:56,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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-13 23:45:56,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:45:56,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 23:45:56,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:45:57,756 INFO L116 PetriNetUnfolderBase]: 246/459 cut-off events. [2025-04-13 23:45:57,756 INFO L117 PetriNetUnfolderBase]: For 255/255 co-relation queries the response was YES. [2025-04-13 23:45:57,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 459 events. 246/459 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1766 event pairs, 62 based on Foata normal form. 7/444 useless extension candidates. Maximal degree in co-relation 1234. Up to 308 conditions per place. [2025-04-13 23:45:57,758 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 57 selfloop transitions, 20 changer transitions 0/77 dead transitions. [2025-04-13 23:45:57,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 77 transitions, 458 flow [2025-04-13 23:45:57,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:45:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 23:45:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2025-04-13 23:45:57,760 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-04-13 23:45:57,760 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 154 flow. Second operand 9 states and 90 transitions. [2025-04-13 23:45:57,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 77 transitions, 458 flow [2025-04-13 23:45:57,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 77 transitions, 446 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-13 23:45:57,762 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 261 flow [2025-04-13 23:45:57,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=261, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-04-13 23:45:57,762 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2025-04-13 23:45:57,762 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 261 flow [2025-04-13 23:45:57,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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-13 23:45:57,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:45:57,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:45:57,763 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:45:57,763 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:45:57,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:45:57,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1730233029, now seen corresponding path program 3 times [2025-04-13 23:45:57,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:45:57,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054811528] [2025-04-13 23:45:57,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:45:57,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:45:57,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:45:57,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:45:57,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:45:57,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:46:00,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-13 23:46:00,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:46:00,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054811528] [2025-04-13 23:46:00,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054811528] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:46:00,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:46:00,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:46:00,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253655043] [2025-04-13 23:46:00,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:46:00,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:46:00,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:46:00,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:46:00,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:46:00,178 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 23:46:00,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 261 flow. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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-13 23:46:00,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:46:00,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 23:46:00,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:46:00,852 INFO L116 PetriNetUnfolderBase]: 356/653 cut-off events. [2025-04-13 23:46:00,853 INFO L117 PetriNetUnfolderBase]: For 599/599 co-relation queries the response was YES. [2025-04-13 23:46:00,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1898 conditions, 653 events. 356/653 cut-off events. For 599/599 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2602 event pairs, 73 based on Foata normal form. 7/620 useless extension candidates. Maximal degree in co-relation 1885. Up to 167 conditions per place. [2025-04-13 23:46:00,857 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 69 selfloop transitions, 23 changer transitions 0/92 dead transitions. [2025-04-13 23:46:00,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 92 transitions, 617 flow [2025-04-13 23:46:00,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:46:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 23:46:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2025-04-13 23:46:00,859 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-04-13 23:46:00,859 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 261 flow. Second operand 7 states and 88 transitions. [2025-04-13 23:46:00,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 92 transitions, 617 flow [2025-04-13 23:46:00,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 92 transitions, 572 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-04-13 23:46:00,864 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 336 flow [2025-04-13 23:46:00,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=336, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2025-04-13 23:46:00,865 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2025-04-13 23:46:00,865 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 336 flow [2025-04-13 23:46:00,866 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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-13 23:46:00,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:46:00,866 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:46:00,866 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:46:00,866 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:46:00,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:46:00,866 INFO L85 PathProgramCache]: Analyzing trace with hash 129110945, now seen corresponding path program 4 times [2025-04-13 23:46:00,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:46:00,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439965455] [2025-04-13 23:46:00,866 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:46:00,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:46:00,906 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 23:46:01,061 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:46:01,062 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:46:01,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:46:03,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:46:03,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:46:03,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439965455] [2025-04-13 23:46:03,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439965455] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:46:03,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:46:03,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:46:03,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027625304] [2025-04-13 23:46:03,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:46:03,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:46:03,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:46:03,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:46:03,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:46:03,294 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 23:46:03,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 336 flow. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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-13 23:46:03,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:46:03,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 23:46:03,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:46:04,220 INFO L116 PetriNetUnfolderBase]: 376/691 cut-off events. [2025-04-13 23:46:04,220 INFO L117 PetriNetUnfolderBase]: For 1233/1233 co-relation queries the response was YES. [2025-04-13 23:46:04,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2196 conditions, 691 events. 376/691 cut-off events. For 1233/1233 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2824 event pairs, 100 based on Foata normal form. 7/654 useless extension candidates. Maximal degree in co-relation 2181. Up to 540 conditions per place. [2025-04-13 23:46:04,224 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 61 selfloop transitions, 18 changer transitions 0/79 dead transitions. [2025-04-13 23:46:04,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 79 transitions, 587 flow [2025-04-13 23:46:04,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:46:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 23:46:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2025-04-13 23:46:04,226 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34375 [2025-04-13 23:46:04,226 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 336 flow. Second operand 7 states and 77 transitions. [2025-04-13 23:46:04,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 79 transitions, 587 flow [2025-04-13 23:46:04,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 552 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-04-13 23:46:04,231 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 369 flow [2025-04-13 23:46:04,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=369, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2025-04-13 23:46:04,232 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 28 predicate places. [2025-04-13 23:46:04,232 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 369 flow [2025-04-13 23:46:04,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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-13 23:46:04,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:46:04,233 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:46:04,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:46:04,233 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:46:04,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:46:04,233 INFO L85 PathProgramCache]: Analyzing trace with hash -37695051, now seen corresponding path program 1 times [2025-04-13 23:46:04,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:46:04,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167669880] [2025-04-13 23:46:04,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:46:04,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:46:04,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:46:04,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:46:04,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:46:04,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:46:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:46:08,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:46:08,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167669880] [2025-04-13 23:46:08,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167669880] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:46:08,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444281661] [2025-04-13 23:46:08,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:46:08,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:46:08,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:46:08,046 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:46:08,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 23:46:08,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:46:08,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:46:08,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:46:08,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:46:08,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 3444 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 23:46:08,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:46:08,872 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-04-13 23:46:09,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-13 23:46:09,070 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2025-04-13 23:46:09,292 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-04-13 23:46:09,315 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:46:09,315 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 52 [2025-04-13 23:46:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:46:09,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:46:10,470 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:46:10,475 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-04-13 23:46:10,499 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 23:46:10,499 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-04-13 23:46:12,429 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 23:46:12,430 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-04-13 23:46:12,440 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:46:12,440 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-04-13 23:46:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:46:14,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444281661] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:46:14,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:46:14,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 19 [2025-04-13 23:46:14,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759978058] [2025-04-13 23:46:14,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:46:14,565 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 23:46:14,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:46:14,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 23:46:14,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-04-13 23:46:14,566 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 23:46:14,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 369 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-13 23:46:14,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:46:14,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 23:46:14,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:46:21,138 INFO L116 PetriNetUnfolderBase]: 459/840 cut-off events. [2025-04-13 23:46:21,138 INFO L117 PetriNetUnfolderBase]: For 1646/1646 co-relation queries the response was YES. [2025-04-13 23:46:21,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2739 conditions, 840 events. 459/840 cut-off events. For 1646/1646 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3586 event pairs, 37 based on Foata normal form. 7/791 useless extension candidates. Maximal degree in co-relation 2722. Up to 383 conditions per place. [2025-04-13 23:46:21,143 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 70 selfloop transitions, 50 changer transitions 0/120 dead transitions. [2025-04-13 23:46:21,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 120 transitions, 956 flow [2025-04-13 23:46:21,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:46:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 23:46:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2025-04-13 23:46:21,146 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32386363636363635 [2025-04-13 23:46:21,146 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 369 flow. Second operand 11 states and 114 transitions. [2025-04-13 23:46:21,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 120 transitions, 956 flow [2025-04-13 23:46:21,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 120 transitions, 910 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-04-13 23:46:21,152 INFO L231 Difference]: Finished difference. Result has 66 places, 81 transitions, 709 flow [2025-04-13 23:46:21,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=709, PETRI_PLACES=66, PETRI_TRANSITIONS=81} [2025-04-13 23:46:21,153 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 36 predicate places. [2025-04-13 23:46:21,153 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 81 transitions, 709 flow [2025-04-13 23:46:21,153 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-13 23:46:21,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:46:21,153 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:46:21,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 23:46:21,353 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 23:46:21,354 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:46:21,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:46:21,354 INFO L85 PathProgramCache]: Analyzing trace with hash -179884611, now seen corresponding path program 2 times [2025-04-13 23:46:21,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:46:21,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457913963] [2025-04-13 23:46:21,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:46:21,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:46:21,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 23:46:21,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:46:21,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:46:21,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:46:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:46:24,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:46:24,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457913963] [2025-04-13 23:46:24,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457913963] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:46:24,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416520610] [2025-04-13 23:46:24,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:46:24,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:46:24,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:46:24,447 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:46:24,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 23:46:24,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 23:46:26,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:46:26,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:46:26,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:46:26,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 3444 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 23:46:26,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:46:26,056 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-04-13 23:46:26,108 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-13 23:46:26,115 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:46:26,115 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 31 [2025-04-13 23:46:26,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:46:26,298 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2025-04-13 23:46:26,320 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:46:26,320 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 51 [2025-04-13 23:46:26,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:46:26,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:46:27,095 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:46:27,096 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-04-13 23:46:27,110 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 23:46:27,111 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-04-13 23:46:27,963 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 23:46:27,965 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-04-13 23:46:27,978 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:46:27,978 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-04-13 23:46:28,573 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 23:46:28,574 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-04-13 23:46:28,585 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 23:46:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:46:29,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416520610] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:46:29,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:46:29,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-04-13 23:46:29,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832231388] [2025-04-13 23:46:29,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:46:29,103 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:46:29,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:46:29,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:46:29,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:46:29,104 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 23:46:29,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 81 transitions, 709 flow. Second operand has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:46:29,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:46:29,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 23:46:29,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:46:30,373 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:46:33,743 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:46:36,020 INFO L116 PetriNetUnfolderBase]: 472/871 cut-off events. [2025-04-13 23:46:36,020 INFO L117 PetriNetUnfolderBase]: For 2373/2373 co-relation queries the response was YES. [2025-04-13 23:46:36,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3171 conditions, 871 events. 472/871 cut-off events. For 2373/2373 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3816 event pairs, 33 based on Foata normal form. 14/877 useless extension candidates. Maximal degree in co-relation 3151. Up to 383 conditions per place. [2025-04-13 23:46:36,024 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 87 selfloop transitions, 53 changer transitions 0/140 dead transitions. [2025-04-13 23:46:36,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 140 transitions, 1216 flow [2025-04-13 23:46:36,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:46:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 23:46:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 120 transitions. [2025-04-13 23:46:36,026 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-04-13 23:46:36,026 INFO L175 Difference]: Start difference. First operand has 66 places, 81 transitions, 709 flow. Second operand 12 states and 120 transitions. [2025-04-13 23:46:36,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 140 transitions, 1216 flow [2025-04-13 23:46:36,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 140 transitions, 1127 flow, removed 39 selfloop flow, removed 2 redundant places. [2025-04-13 23:46:36,033 INFO L231 Difference]: Finished difference. Result has 77 places, 93 transitions, 844 flow [2025-04-13 23:46:36,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=844, PETRI_PLACES=77, PETRI_TRANSITIONS=93} [2025-04-13 23:46:36,034 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2025-04-13 23:46:36,034 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 93 transitions, 844 flow [2025-04-13 23:46:36,034 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:46:36,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:46:36,034 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:46:36,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 23:46:36,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 23:46:36,235 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:46:36,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:46:36,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1952451525, now seen corresponding path program 3 times [2025-04-13 23:46:36,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:46:36,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452763184] [2025-04-13 23:46:36,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:46:36,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:46:36,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 23:46:36,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:46:36,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:46:36,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:46:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:46:40,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:46:40,833 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452763184] [2025-04-13 23:46:40,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452763184] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:46:40,833 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492219907] [2025-04-13 23:46:40,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:46:40,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:46:40,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:46:40,835 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:46:40,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 23:46:41,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 23:46:42,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:46:42,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:46:42,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:46:42,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 3444 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 23:46:42,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:46:42,944 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-04-13 23:46:43,051 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-13 23:46:43,065 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:46:43,065 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 31 [2025-04-13 23:46:43,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:46:43,289 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2025-04-13 23:46:43,349 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2025-04-13 23:46:44,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:46:44,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:46:46,234 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 597 treesize of output 585 [2025-04-13 23:46:46,249 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 895 treesize of output 847 [2025-04-13 23:46:46,626 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 23:46:46,626 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2025-04-13 23:46:46,805 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:46:46,805 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 449 treesize of output 327 [2025-04-13 23:46:47,156 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:46:47,157 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 615 treesize of output 421 [2025-04-13 23:46:47,719 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:46:47,719 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2025-04-13 23:46:47,944 INFO L325 Elim1Store]: treesize reduction 5, result has 92.5 percent of original size [2025-04-13 23:46:47,945 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 714 treesize of output 491 [2025-04-13 23:46:48,292 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:46:48,292 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 2955 treesize of output 1761 [2025-04-13 23:46:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:46:49,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492219907] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:46:49,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:46:49,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-04-13 23:46:49,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678495328] [2025-04-13 23:46:49,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:46:49,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:46:49,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:46:49,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:46:49,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:46:49,644 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 23:46:49,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 93 transitions, 844 flow. Second operand has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:46:49,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:46:49,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 23:46:49,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:46:53,163 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:46:58,106 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:47:00,857 INFO L116 PetriNetUnfolderBase]: 465/864 cut-off events. [2025-04-13 23:47:00,858 INFO L117 PetriNetUnfolderBase]: For 2313/2313 co-relation queries the response was YES. [2025-04-13 23:47:00,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3315 conditions, 864 events. 465/864 cut-off events. For 2313/2313 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3785 event pairs, 83 based on Foata normal form. 7/863 useless extension candidates. Maximal degree in co-relation 3292. Up to 741 conditions per place. [2025-04-13 23:47:00,862 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 103 selfloop transitions, 16 changer transitions 0/119 dead transitions. [2025-04-13 23:47:00,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 119 transitions, 1161 flow [2025-04-13 23:47:00,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:47:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 23:47:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2025-04-13 23:47:00,863 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30078125 [2025-04-13 23:47:00,863 INFO L175 Difference]: Start difference. First operand has 77 places, 93 transitions, 844 flow. Second operand 8 states and 77 transitions. [2025-04-13 23:47:00,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 119 transitions, 1161 flow [2025-04-13 23:47:00,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 119 transitions, 1088 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-04-13 23:47:00,871 INFO L231 Difference]: Finished difference. Result has 78 places, 93 transitions, 801 flow [2025-04-13 23:47:00,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=801, PETRI_PLACES=78, PETRI_TRANSITIONS=93} [2025-04-13 23:47:00,871 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2025-04-13 23:47:00,871 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 93 transitions, 801 flow [2025-04-13 23:47:00,872 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:47:00,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:47:00,872 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:47:00,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 23:47:01,072 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:47:01,072 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:47:01,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:47:01,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1803159070, now seen corresponding path program 1 times [2025-04-13 23:47:01,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:47:01,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238422305] [2025-04-13 23:47:01,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:47:01,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:47:01,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:47:01,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:47:01,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:47:01,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:47:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:47:01,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:47:01,491 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238422305] [2025-04-13 23:47:01,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238422305] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:47:01,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:47:01,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:47:01,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632386697] [2025-04-13 23:47:01,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:47:01,492 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:47:01,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:47:01,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:47:01,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:47:01,492 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 23:47:01,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 93 transitions, 801 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:47:01,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:47:01,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 23:47:01,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:47:02,415 INFO L116 PetriNetUnfolderBase]: 516/956 cut-off events. [2025-04-13 23:47:02,416 INFO L117 PetriNetUnfolderBase]: For 2676/2676 co-relation queries the response was YES. [2025-04-13 23:47:02,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3573 conditions, 956 events. 516/956 cut-off events. For 2676/2676 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4234 event pairs, 182 based on Foata normal form. 14/962 useless extension candidates. Maximal degree in co-relation 3549. Up to 518 conditions per place. [2025-04-13 23:47:02,421 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 66 selfloop transitions, 26 changer transitions 14/106 dead transitions. [2025-04-13 23:47:02,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 106 transitions, 1097 flow [2025-04-13 23:47:02,421 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:47:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 23:47:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-13 23:47:02,422 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3359375 [2025-04-13 23:47:02,422 INFO L175 Difference]: Start difference. First operand has 78 places, 93 transitions, 801 flow. Second operand 4 states and 43 transitions. [2025-04-13 23:47:02,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 106 transitions, 1097 flow [2025-04-13 23:47:02,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 106 transitions, 1075 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-13 23:47:02,430 INFO L231 Difference]: Finished difference. Result has 78 places, 85 transitions, 833 flow [2025-04-13 23:47:02,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=833, PETRI_PLACES=78, PETRI_TRANSITIONS=85} [2025-04-13 23:47:02,432 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2025-04-13 23:47:02,432 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 85 transitions, 833 flow [2025-04-13 23:47:02,432 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:47:02,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:47:02,432 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:47:02,432 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 23:47:02,432 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:47:02,433 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:47:02,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2119254438, now seen corresponding path program 2 times [2025-04-13 23:47:02,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:47:02,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339237184] [2025-04-13 23:47:02,433 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:47:02,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:47:02,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:47:02,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:47:02,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:47:02,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:47:02,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:47:02,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:47:03,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:47:03,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:47:03,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:47:03,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:47:03,276 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:47:03,276 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 23:47:03,278 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 23:47:03,278 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 23:47:03,278 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 23:47:03,278 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 23:47:03,278 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 23:47:03,278 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 23:47:03,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 23:47:03,278 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1] [2025-04-13 23:47:03,370 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:47:03,370 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:47:03,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:47:03 BasicIcfg [2025-04-13 23:47:03,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:47:03,375 INFO L158 Benchmark]: Toolchain (without parser) took 121601.46ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 97.6MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2025-04-13 23:47:03,375 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:47:03,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.49ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 48.2MB in the end (delta: 49.5MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2025-04-13 23:47:03,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.57ms. Allocated memory is still 142.6MB. Free memory was 48.2MB in the beginning and 32.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 23:47:03,375 INFO L158 Benchmark]: Boogie Preprocessor took 154.72ms. Allocated memory is still 142.6MB. Free memory was 32.1MB in the beginning and 83.8MB in the end (delta: -51.7MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. [2025-04-13 23:47:03,375 INFO L158 Benchmark]: IcfgBuilder took 39780.37ms. Allocated memory was 142.6MB in the beginning and 7.0GB in the end (delta: 6.9GB). Free memory was 83.8MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2025-04-13 23:47:03,375 INFO L158 Benchmark]: TraceAbstraction took 80985.17ms. Allocated memory was 7.0GB in the beginning and 3.5GB in the end (delta: -3.5GB). Free memory was 5.5GB in the beginning and 2.2GB in the end (delta: 3.3GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-04-13 23:47:03,376 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.21ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 578.49ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 48.2MB in the end (delta: 49.5MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 97.57ms. Allocated memory is still 142.6MB. Free memory was 48.2MB in the beginning and 32.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 154.72ms. Allocated memory is still 142.6MB. Free memory was 32.1MB in the beginning and 83.8MB in the end (delta: -51.7MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. * IcfgBuilder took 39780.37ms. Allocated memory was 142.6MB in the beginning and 7.0GB in the end (delta: 6.9GB). Free memory was 83.8MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. * TraceAbstraction took 80985.17ms. Allocated memory was 7.0GB in the beginning and 3.5GB in the end (delta: -3.5GB). Free memory was 5.5GB in the beginning and 2.2GB in the end (delta: 3.3GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L950] 0 _Bool enqueue_flag, dequeue_flag; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L951] 0 QType queue; [L1054] 0 pthread_t id1, id2; [L1055] 0 enqueue_flag=(1) [L1056] 0 dequeue_flag=(0) [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 [L955] 0 q->tail=0 [L956] 0 q->amount=0 [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head [L960] EXPR 0 q->tail [L960] COND TRUE 0 q->head == q->tail [L963] 0 return (-1); [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) [L1062] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1007] 1 int value, i; VAL [\at(arg, Pre)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1063] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-1, id2=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1009] 1 value = __VERIFIER_nondet_int() [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (800)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) [L1013] 1 stored_elements[0]=value [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head [L960] EXPR 1 q->tail [L960] COND FALSE 1 !(q->head == q->tail) [L966] 1 return 0; [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) [L1018] 1 i=0 [L1018] COND TRUE 1 i<((800)-1) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1036] 2 int i; [L1037] 2 i=0 [L1037] COND TRUE 2 i<(800) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] 2 i++ [L1037] COND TRUE 2 i<(800) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1021] COND TRUE 1 \read(enqueue_flag) [L1023] 1 value = __VERIFIER_nondet_int() [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (800)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value [L1026] 1 enqueue_flag=(0) [L1027] 1 dequeue_flag=(1) VAL [\at(arg, Pre)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; [L995] EXPR 2 q->head [L995] EXPR 2 q->element[q->head] [L995] 2 x = q->element[q->head] [L996] EXPR 2 q->amount [L996] 2 q->amount-- [L996] 2 q->amount-- [L997] EXPR 2 q->head [L997] COND FALSE 2 !(q->head == (800)) [L1002] EXPR 2 q->head [L1002] 2 q->head++ [L1002] 2 q->head++ [L1003] 2 return x; [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1043] 2 reach_error() VAL [\at(arg, Pre)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] - UnprovableResult [Line: 1059]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 48 locations, 57 edges, 7 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: 80.8s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 32.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 400 SdHoareTripleChecker+Valid, 29.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 400 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 28.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2536 IncrementalHoareTripleChecker+Invalid, 2593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 0 mSDtfsCounter, 2536 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=844occurred in iteration=11, InterpolantAutomatonStates: 79, 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.2s SsaConstructionTime, 6.0s SatisfiabilityAnalysisTime, 39.7s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 265 ConstructedInterpolants, 55 QuantifiedInterpolants, 46597 SizeOfPredicates, 96 NumberOfNonLiveVariables, 10332 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 3/29 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 23:47:03,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...