/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:11:50,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:11:50,066 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 19:11:50,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:11:50,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:11:50,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:11:50,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:11:50,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:11:50,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:11:50,096 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:11:50,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:11:50,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:11:50,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:11:50,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:11:50,097 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:11:50,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:11:50,097 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:11:50,097 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:11:50,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:11:50,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:11:50,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:11:50,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:11:50,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:11:50,098 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:11:50,098 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:11:50,098 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:11:50,098 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:11:50,098 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:11:50,098 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:11:50,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:11:50,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:11:50,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:11:50,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:11:50,098 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:11:50,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:11:50,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:11:50,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:11:50,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:11:50,099 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:11:50,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:11:50,099 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:11:50,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:11:50,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:11:50,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:11:50,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:11:50,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:11:50,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:11:50,099 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 [2025-04-13 19:11:50,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:11:50,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:11:50,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:11:50,297 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:11:50,297 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:11:50,298 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 19:11:51,558 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21fa500f7/f129b8dacaf2481fb8efb0cfd37a3923/FLAGf69306190 [2025-04-13 19:11:51,802 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:11:51,803 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2025-04-13 19:11:51,823 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21fa500f7/f129b8dacaf2481fb8efb0cfd37a3923/FLAGf69306190 [2025-04-13 19:11:52,558 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21fa500f7/f129b8dacaf2481fb8efb0cfd37a3923 [2025-04-13 19:11:52,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:11:52,561 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:11:52,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:11:52,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:11:52,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:11:52,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:11:52" (1/1) ... [2025-04-13 19:11:52,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a499178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:52, skipping insertion in model container [2025-04-13 19:11:52,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:11:52" (1/1) ... [2025-04-13 19:11:52,598 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:11:52,874 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 19:11:52,882 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 19:11:52,884 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 19:11:52,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:11:52,931 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:11:52,996 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 19:11:52,998 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 19:11:52,999 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 19:11:53,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:11:53,092 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:11:53,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:53 WrapperNode [2025-04-13 19:11:53,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:11:53,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:11:53,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:11:53,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:11:53,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:53" (1/1) ... [2025-04-13 19:11:53,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:53" (1/1) ... [2025-04-13 19:11:53,200 INFO L138 Inliner]: procedures = 274, calls = 1656, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 1834 [2025-04-13 19:11:53,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:11:53,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:11:53,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:11:53,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:11:53,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:53" (1/1) ... [2025-04-13 19:11:53,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:53" (1/1) ... [2025-04-13 19:11:53,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:53" (1/1) ... [2025-04-13 19:11:53,268 INFO L175 MemorySlicer]: Split 1644 memory accesses to 4 slices as follows [2, 834, 5, 803]. 51 percent of accesses are in the largest equivalence class. The 1610 initializations are split as follows [2, 803, 5, 800]. The 16 writes are split as follows [0, 14, 0, 2]. [2025-04-13 19:11:53,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:53" (1/1) ... [2025-04-13 19:11:53,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:53" (1/1) ... [2025-04-13 19:11:53,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:53" (1/1) ... [2025-04-13 19:11:53,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:53" (1/1) ... [2025-04-13 19:11:53,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:53" (1/1) ... [2025-04-13 19:11:53,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:53" (1/1) ... [2025-04-13 19:11:53,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:53" (1/1) ... [2025-04-13 19:11:53,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:11:53,342 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:11:53,342 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:11:53,342 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:11:53,342 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:53" (1/1) ... [2025-04-13 19:11:53,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:11:53,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:11:53,364 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 19:11:53,394 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 19:11:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 19:11:53,411 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 19:11:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 19:11:53,411 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 19:11:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:11:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:11:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:11:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 19:11:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 19:11:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:11:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:11:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 19:11:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 19:11:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:11:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:11:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:11:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:11:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:11:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 19:11:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:11:53,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:11:53,414 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:11:53,537 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:11:53,538 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:11:54,985 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:11:54,986 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:11:54,986 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:12:34,525 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:12:34,526 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:12:34,528 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:12:34,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:12:34 BoogieIcfgContainer [2025-04-13 19:12:34,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:12:34,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:12:34,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:12:34,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:12:34,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:11:52" (1/3) ... [2025-04-13 19:12:34,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d09baa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:12:34, skipping insertion in model container [2025-04-13 19:12:34,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:53" (2/3) ... [2025-04-13 19:12:34,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d09baa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:12:34, skipping insertion in model container [2025-04-13 19:12:34,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:12:34" (3/3) ... [2025-04-13 19:12:34,534 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2025-04-13 19:12:34,544 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:12:34,545 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 19:12:34,545 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:12:34,628 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 19:12:34,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 32 transitions, 78 flow [2025-04-13 19:12:34,695 INFO L116 PetriNetUnfolderBase]: 5/30 cut-off events. [2025-04-13 19:12:34,697 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:12:34,699 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 55 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 19:12:34,700 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 32 transitions, 78 flow [2025-04-13 19:12:34,702 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 28 transitions, 65 flow [2025-04-13 19:12:34,708 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:12:34,718 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;@68c1db4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:12:34,718 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:12:34,719 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:12:34,719 INFO L116 PetriNetUnfolderBase]: 0/0 cut-off events. [2025-04-13 19:12:34,719 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:12:34,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:12:34,719 INFO L206 CegarLoopForPetriNet]: trace histogram [1] [2025-04-13 19:12:34,722 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 19:12:34,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:12:34,725 INFO L85 PathProgramCache]: Analyzing trace with hash 3848, now seen corresponding path program 1 times [2025-04-13 19:12:34,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:12:34,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874428214] [2025-04-13 19:12:34,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:12:34,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:12:34,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-13 19:12:34,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-13 19:12:34,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:12:34,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:34,806 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 19:12:34,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:12:34,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874428214] [2025-04-13 19:12:34,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874428214] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:12:34,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:12:34,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2025-04-13 19:12:34,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497744836] [2025-04-13 19:12:34,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:12:34,813 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:12:34,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:12:34,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:12:34,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:12:34,832 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 19:12:34,834 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 19:12:34,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:12:34,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 19:12:34,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:12:35,286 INFO L116 PetriNetUnfolderBase]: 261/445 cut-off events. [2025-04-13 19:12:35,286 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 19:12:35,287 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 1466 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 19:12:35,289 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 24 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2025-04-13 19:12:35,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 24 transitions, 105 flow [2025-04-13 19:12:35,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:12:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:12:35,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2025-04-13 19:12:35,299 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 19:12:35,300 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 65 flow. Second operand 2 states and 32 transitions. [2025-04-13 19:12:35,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 24 transitions, 105 flow [2025-04-13 19:12:35,304 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 19:12:35,305 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 52 flow [2025-04-13 19:12:35,307 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 19:12:35,310 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2025-04-13 19:12:35,310 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 52 flow [2025-04-13 19:12:35,310 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 19:12:35,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:12:35,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:12:35,310 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:12:35,311 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 19:12:35,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:12:35,311 INFO L85 PathProgramCache]: Analyzing trace with hash -621901933, now seen corresponding path program 1 times [2025-04-13 19:12:35,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:12:35,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192242311] [2025-04-13 19:12:35,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:12:35,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:12:35,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:12:35,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:12:35,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:12:35,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:37,005 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 19:12:37,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:12:37,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192242311] [2025-04-13 19:12:37,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192242311] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:12:37,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:12:37,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:12:37,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951142336] [2025-04-13 19:12:37,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:12:37,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:12:37,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:12:37,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:12:37,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:12:37,007 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 19:12:37,007 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 19:12:37,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:12:37,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 19:12:37,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:12:37,578 INFO L116 PetriNetUnfolderBase]: 280/472 cut-off events. [2025-04-13 19:12:37,579 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:12:37,579 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 19:12:37,581 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2025-04-13 19:12:37,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 142 flow [2025-04-13 19:12:37,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:12:37,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:12:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-13 19:12:37,582 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2025-04-13 19:12:37,582 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 52 flow. Second operand 3 states and 41 transitions. [2025-04-13 19:12:37,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 142 flow [2025-04-13 19:12:37,582 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 19:12:37,583 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 78 flow [2025-04-13 19:12:37,584 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 19:12:37,584 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2025-04-13 19:12:37,584 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 78 flow [2025-04-13 19:12:37,584 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 19:12:37,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:12:37,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:12:37,584 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:12:37,584 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 19:12:37,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:12:37,585 INFO L85 PathProgramCache]: Analyzing trace with hash -666862861, now seen corresponding path program 1 times [2025-04-13 19:12:37,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:12:37,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385364266] [2025-04-13 19:12:37,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:12:37,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:12:37,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:12:37,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:12:37,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:12:37,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:37,881 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 19:12:37,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:12:37,881 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385364266] [2025-04-13 19:12:37,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385364266] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:12:37,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:12:37,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:12:37,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641138324] [2025-04-13 19:12:37,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:12:37,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:12:37,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:12:37,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:12:37,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:12:37,883 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 19:12:37,883 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 19:12:37,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:12:37,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 19:12:37,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:12:38,310 INFO L116 PetriNetUnfolderBase]: 296/504 cut-off events. [2025-04-13 19:12:38,310 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 19:12:38,311 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 1713 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 19:12:38,312 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 34 selfloop transitions, 2 changer transitions 1/37 dead transitions. [2025-04-13 19:12:38,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 173 flow [2025-04-13 19:12:38,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:12:38,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:12:38,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-13 19:12:38,313 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-04-13 19:12:38,313 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 78 flow. Second operand 3 states and 42 transitions. [2025-04-13 19:12:38,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 173 flow [2025-04-13 19:12:38,314 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 19:12:38,314 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 82 flow [2025-04-13 19:12:38,315 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 19:12:38,315 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2025-04-13 19:12:38,315 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 82 flow [2025-04-13 19:12:38,315 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 19:12:38,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:12:38,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:12:38,315 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:12:38,315 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 19:12:38,316 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:12:38,316 INFO L85 PathProgramCache]: Analyzing trace with hash 965522290, now seen corresponding path program 1 times [2025-04-13 19:12:38,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:12:38,316 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698861495] [2025-04-13 19:12:38,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:12:38,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:12:38,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:12:38,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:12:38,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:12:38,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:38,613 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 19:12:38,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:12:38,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698861495] [2025-04-13 19:12:38,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698861495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:12:38,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:12:38,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:12:38,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667175322] [2025-04-13 19:12:38,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:12:38,613 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:12:38,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:12:38,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:12:38,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:12:38,614 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 19:12:38,614 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 19:12:38,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:12:38,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 19:12:38,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:12:39,534 INFO L116 PetriNetUnfolderBase]: 221/399 cut-off events. [2025-04-13 19:12:39,534 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-13 19:12:39,535 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 1404 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 19:12:39,536 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 32 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2025-04-13 19:12:39,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 183 flow [2025-04-13 19:12:39,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:12:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:12:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-04-13 19:12:39,536 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-04-13 19:12:39,536 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 82 flow. Second operand 3 states and 44 transitions. [2025-04-13 19:12:39,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 183 flow [2025-04-13 19:12:39,537 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 19:12:39,538 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 92 flow [2025-04-13 19:12:39,538 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 19:12:39,538 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2025-04-13 19:12:39,538 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 92 flow [2025-04-13 19:12:39,538 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 19:12:39,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:12:39,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:12:39,539 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:12:39,539 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 19:12:39,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:12:39,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1068377026, now seen corresponding path program 1 times [2025-04-13 19:12:39,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:12:39,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884728556] [2025-04-13 19:12:39,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:12:39,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:12:39,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:12:39,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:12:39,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:12:39,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:40,686 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 19:12:40,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:12:40,686 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884728556] [2025-04-13 19:12:40,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884728556] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:12:40,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:12:40,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:12:40,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143219371] [2025-04-13 19:12:40,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:12:40,686 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:12:40,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:12:40,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:12:40,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:12:40,688 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 19:12:40,688 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 19:12:40,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:12:40,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 19:12:40,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:12:41,132 INFO L116 PetriNetUnfolderBase]: 214/386 cut-off events. [2025-04-13 19:12:41,133 INFO L117 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-04-13 19:12:41,133 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 1276 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 19:12:41,134 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 30 selfloop transitions, 3 changer transitions 2/35 dead transitions. [2025-04-13 19:12:41,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 184 flow [2025-04-13 19:12:41,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:12:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:12:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-04-13 19:12:41,135 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40625 [2025-04-13 19:12:41,135 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 92 flow. Second operand 3 states and 39 transitions. [2025-04-13 19:12:41,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 184 flow [2025-04-13 19:12:41,136 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 19:12:41,137 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 86 flow [2025-04-13 19:12:41,137 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 19:12:41,137 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2025-04-13 19:12:41,137 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 86 flow [2025-04-13 19:12:41,137 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 19:12:41,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:12:41,137 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:12:41,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:12:41,138 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 19:12:41,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:12:41,138 INFO L85 PathProgramCache]: Analyzing trace with hash 835742982, now seen corresponding path program 1 times [2025-04-13 19:12:41,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:12:41,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261996654] [2025-04-13 19:12:41,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:12:41,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:12:41,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:12:41,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:12:41,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:12:41,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:43,585 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 19:12:43,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:12:43,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261996654] [2025-04-13 19:12:43,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261996654] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:12:43,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:12:43,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:12:43,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441788380] [2025-04-13 19:12:43,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:12:43,586 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:12:43,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:12:43,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:12:43,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:12:43,587 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 19:12:43,587 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 19:12:43,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:12:43,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 19:12:43,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:12:44,378 INFO L116 PetriNetUnfolderBase]: 209/386 cut-off events. [2025-04-13 19:12:44,379 INFO L117 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-04-13 19:12:44,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 386 events. 209/386 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1340 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 19:12:44,380 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 44 selfloop transitions, 11 changer transitions 0/55 dead transitions. [2025-04-13 19:12:44,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 55 transitions, 283 flow [2025-04-13 19:12:44,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:12:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:12:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2025-04-13 19:12:44,382 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3080357142857143 [2025-04-13 19:12:44,382 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 86 flow. Second operand 7 states and 69 transitions. [2025-04-13 19:12:44,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 55 transitions, 283 flow [2025-04-13 19:12:44,382 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 19:12:44,383 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 154 flow [2025-04-13 19:12:44,383 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 19:12:44,383 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2025-04-13 19:12:44,383 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 154 flow [2025-04-13 19:12:44,383 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 19:12:44,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:12:44,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:12:44,384 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:12:44,384 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 19:12:44,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:12:44,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1264277042, now seen corresponding path program 2 times [2025-04-13 19:12:44,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:12:44,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107460476] [2025-04-13 19:12:44,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:12:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:12:44,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:12:44,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:12:44,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:12:44,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:47,031 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 19:12:47,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:12:47,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107460476] [2025-04-13 19:12:47,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107460476] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:12:47,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:12:47,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:12:47,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390853395] [2025-04-13 19:12:47,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:12:47,031 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:12:47,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:12:47,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:12:47,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:12:47,032 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 19:12:47,032 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 19:12:47,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:12:47,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 19:12:47,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:12:48,204 INFO L116 PetriNetUnfolderBase]: 241/448 cut-off events. [2025-04-13 19:12:48,204 INFO L117 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2025-04-13 19:12:48,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 448 events. 241/448 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1700 event pairs, 62 based on Foata normal form. 7/433 useless extension candidates. Maximal degree in co-relation 1204. Up to 304 conditions per place. [2025-04-13 19:12:48,206 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 54 selfloop transitions, 18 changer transitions 0/72 dead transitions. [2025-04-13 19:12:48,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 428 flow [2025-04-13 19:12:48,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:12:48,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:12:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2025-04-13 19:12:48,207 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32421875 [2025-04-13 19:12:48,207 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 154 flow. Second operand 8 states and 83 transitions. [2025-04-13 19:12:48,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 428 flow [2025-04-13 19:12:48,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 416 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-13 19:12:48,210 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 245 flow [2025-04-13 19:12:48,210 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=8, PETRI_FLOW=245, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2025-04-13 19:12:48,211 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2025-04-13 19:12:48,211 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 245 flow [2025-04-13 19:12:48,211 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 19:12:48,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:12:48,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:12:48,211 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:12:48,211 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 19:12:48,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:12:48,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1122087482, now seen corresponding path program 3 times [2025-04-13 19:12:48,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:12:48,212 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433644032] [2025-04-13 19:12:48,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:12:48,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:12:48,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:12:48,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:12:48,405 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:12:48,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:50,856 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 19:12:50,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:12:50,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433644032] [2025-04-13 19:12:50,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433644032] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:12:50,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:12:50,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:12:50,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469576557] [2025-04-13 19:12:50,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:12:50,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:12:50,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:12:50,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:12:50,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:12:50,857 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 19:12:50,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 245 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 19:12:50,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:12:50,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 19:12:50,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:12:51,553 INFO L116 PetriNetUnfolderBase]: 287/533 cut-off events. [2025-04-13 19:12:51,553 INFO L117 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2025-04-13 19:12:51,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 533 events. 287/533 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2057 event pairs, 28 based on Foata normal form. 7/510 useless extension candidates. Maximal degree in co-relation 1555. Up to 282 conditions per place. [2025-04-13 19:12:51,556 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 59 selfloop transitions, 23 changer transitions 0/82 dead transitions. [2025-04-13 19:12:51,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 82 transitions, 532 flow [2025-04-13 19:12:51,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:12:51,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:12:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2025-04-13 19:12:51,557 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34765625 [2025-04-13 19:12:51,557 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 245 flow. Second operand 8 states and 89 transitions. [2025-04-13 19:12:51,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 82 transitions, 532 flow [2025-04-13 19:12:51,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 82 transitions, 493 flow, removed 16 selfloop flow, removed 2 redundant places. [2025-04-13 19:12:51,561 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 302 flow [2025-04-13 19:12:51,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=302, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2025-04-13 19:12:51,562 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2025-04-13 19:12:51,562 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 302 flow [2025-04-13 19:12:51,562 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 19:12:51,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:12:51,562 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 19:12:51,562 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:12:51,562 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 19:12:51,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:12:51,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1056649059, now seen corresponding path program 1 times [2025-04-13 19:12:51,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:12:51,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121270206] [2025-04-13 19:12:51,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:12:51,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:12:51,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:12:51,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:12:51,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:12:51,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:51,989 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 19:12:51,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:12:51,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121270206] [2025-04-13 19:12:51,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121270206] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:12:51,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:12:51,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:12:51,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116868312] [2025-04-13 19:12:51,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:12:51,989 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:12:51,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:12:51,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:12:51,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:12:51,990 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 19:12:51,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 302 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 19:12:51,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:12:51,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 19:12:51,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:12:52,381 INFO L116 PetriNetUnfolderBase]: 319/590 cut-off events. [2025-04-13 19:12:52,382 INFO L117 PetriNetUnfolderBase]: For 799/799 co-relation queries the response was YES. [2025-04-13 19:12:52,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1813 conditions, 590 events. 319/590 cut-off events. For 799/799 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2333 event pairs, 133 based on Foata normal form. 7/561 useless extension candidates. Maximal degree in co-relation 1798. Up to 314 conditions per place. [2025-04-13 19:12:52,385 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 46 selfloop transitions, 10 changer transitions 2/58 dead transitions. [2025-04-13 19:12:52,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 461 flow [2025-04-13 19:12:52,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:12:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:12:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-13 19:12:52,387 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3359375 [2025-04-13 19:12:52,387 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 302 flow. Second operand 4 states and 43 transitions. [2025-04-13 19:12:52,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 461 flow [2025-04-13 19:12:52,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 426 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-04-13 19:12:52,392 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 332 flow [2025-04-13 19:12:52,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=332, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2025-04-13 19:12:52,393 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2025-04-13 19:12:52,393 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 332 flow [2025-04-13 19:12:52,393 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 19:12:52,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:12:52,393 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 19:12:52,393 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:12:52,393 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 19:12:52,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:12:52,394 INFO L85 PathProgramCache]: Analyzing trace with hash -740553691, now seen corresponding path program 2 times [2025-04-13 19:12:52,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:12:52,394 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104737156] [2025-04-13 19:12:52,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:12:52,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:12:52,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:12:52,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:12:52,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:12:52,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:12:52,719 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:12:52,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:12:53,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:12:53,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:12:53,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:12:53,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:12:53,107 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:12:53,108 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 19:12:53,109 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 19:12:53,109 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 19:12:53,110 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 19:12:53,110 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 19:12:53,110 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 19:12:53,110 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 19:12:53,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:12:53,110 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2025-04-13 19:12:53,182 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:12:53,182 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:12:53,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:12:53 BasicIcfg [2025-04-13 19:12:53,187 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:12:53,188 INFO L158 Benchmark]: Toolchain (without parser) took 60626.29ms. Allocated memory was 155.2MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 109.6MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2025-04-13 19:12:53,188 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 159.4MB. Free memory is still 89.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:12:53,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.82ms. Allocated memory is still 155.2MB. Free memory was 109.6MB in the beginning and 59.9MB in the end (delta: 49.7MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2025-04-13 19:12:53,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.18ms. Allocated memory is still 155.2MB. Free memory was 59.9MB in the beginning and 43.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 19:12:53,189 INFO L158 Benchmark]: Boogie Preprocessor took 139.89ms. Allocated memory is still 155.2MB. Free memory was 43.8MB in the beginning and 30.7MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 19:12:53,189 INFO L158 Benchmark]: RCFGBuilder took 41186.47ms. Allocated memory was 155.2MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 30.1MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2025-04-13 19:12:53,189 INFO L158 Benchmark]: TraceAbstraction took 18658.02ms. Allocated memory is still 7.2GB. Free memory was 5.2GB in the beginning and 5.2GB in the end (delta: -52.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:12:53,190 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.12ms. Allocated memory is still 159.4MB. Free memory is still 89.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 531.82ms. Allocated memory is still 155.2MB. Free memory was 109.6MB in the beginning and 59.9MB in the end (delta: 49.7MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 106.18ms. Allocated memory is still 155.2MB. Free memory was 59.9MB in the beginning and 43.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 139.89ms. Allocated memory is still 155.2MB. Free memory was 43.8MB in the beginning and 30.7MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * RCFGBuilder took 41186.47ms. Allocated memory was 155.2MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 30.1MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. * TraceAbstraction took 18658.02ms. Allocated memory is still 7.2GB. Free memory was 5.2GB in the beginning and 5.2GB in the end (delta: -52.4MB). There was no memory consumed. 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=-2, 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=-2, id2=-1, 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: 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: 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: 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: 18.5s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 784 IncrementalHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 0 mSDtfsCounter, 784 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=9, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 1973 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 2/2 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 19:12:53,209 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...