/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:21:45,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:21:45,724 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 21:21:45,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:21:45,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:21:45,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:21:45,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:21:45,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:21:45,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:21:45,742 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:21:45,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:21:45,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:21:45,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:21:45,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:21:45,742 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:21:45,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:21:45,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:21:45,742 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:21:45,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:21:45,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:21:45,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:21:45,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:21:45,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:21:45,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:21:45,744 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:21:45,744 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:21:45,744 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:21:45,744 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:21:45,744 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:21:45,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:21:45,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:21:45,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:21:45,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:21:45,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:21:45,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:21:45,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:21:45,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:21:45,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:21:45,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:21:45,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:21:45,745 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:21:45,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:21:45,745 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:21:45,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:21:45,745 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:21:45,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:21:45,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:21:45,745 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:21:45,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:21:45,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:21:45,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:21:45,956 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:21:45,956 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:21:45,958 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 21:21:47,233 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab990e5b/ab6017e56f7b42238f75f4d83518280a/FLAGea93d1557 [2025-04-13 21:21:47,441 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:21:47,442 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2025-04-13 21:21:47,458 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab990e5b/ab6017e56f7b42238f75f4d83518280a/FLAGea93d1557 [2025-04-13 21:21:48,435 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab990e5b/ab6017e56f7b42238f75f4d83518280a [2025-04-13 21:21:48,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:21:48,438 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:21:48,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:21:48,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:21:48,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:21:48,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:21:48" (1/1) ... [2025-04-13 21:21:48,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e42ed4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:21:48, skipping insertion in model container [2025-04-13 21:21:48,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:21:48" (1/1) ... [2025-04-13 21:21:48,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:21:48,814 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 21:21:48,822 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 21:21:48,825 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 21:21:48,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:21:48,867 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:21:48,939 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 21:21:48,940 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 21:21:48,941 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 21:21:48,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:21:49,025 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:21:49,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:21:49 WrapperNode [2025-04-13 21:21:49,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:21:49,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:21:49,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:21:49,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:21:49,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:21:49" (1/1) ... [2025-04-13 21:21:49,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:21:49" (1/1) ... [2025-04-13 21:21:49,155 INFO L138 Inliner]: procedures = 274, calls = 1656, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 1834 [2025-04-13 21:21:49,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:21:49,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:21:49,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:21:49,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:21:49,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:21:49" (1/1) ... [2025-04-13 21:21:49,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:21:49" (1/1) ... [2025-04-13 21:21:49,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:21:49" (1/1) ... [2025-04-13 21:21:49,227 INFO L175 MemorySlicer]: Split 1644 memory accesses to 4 slices as follows [2, 5, 803, 834]. 51 percent of accesses are in the largest equivalence class. The 1610 initializations are split as follows [2, 5, 800, 803]. The 16 writes are split as follows [0, 0, 2, 14]. [2025-04-13 21:21:49,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:21:49" (1/1) ... [2025-04-13 21:21:49,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:21:49" (1/1) ... [2025-04-13 21:21:49,300 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:21:49" (1/1) ... [2025-04-13 21:21:49,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:21:49" (1/1) ... [2025-04-13 21:21:49,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:21:49" (1/1) ... [2025-04-13 21:21:49,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:21:49" (1/1) ... [2025-04-13 21:21:49,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:21:49,333 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:21:49,333 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:21:49,333 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:21:49,334 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:21:49" (1/1) ... [2025-04-13 21:21:49,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:21:49,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:21:49,360 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 21:21:49,365 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 21:21:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 21:21:49,378 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 21:21:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 21:21:49,378 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 21:21:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 21:21:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 21:21:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 21:21:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 21:21:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 21:21:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 21:21:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 21:21:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 21:21:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 21:21:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 21:21:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:21:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:21:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:21:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 21:21:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 21:21:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:21:49,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:21:49,380 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:21:49,500 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:21:49,501 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:21:50,882 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:21:50,882 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:21:50,883 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:22:28,670 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:22:28,671 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:22:28,672 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:22:28,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:22:28 BoogieIcfgContainer [2025-04-13 21:22:28,673 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:22:28,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:22:28,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:22:28,677 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:22:28,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:21:48" (1/3) ... [2025-04-13 21:22:28,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e23085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:22:28, skipping insertion in model container [2025-04-13 21:22:28,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:21:49" (2/3) ... [2025-04-13 21:22:28,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e23085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:22:28, skipping insertion in model container [2025-04-13 21:22:28,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:22:28" (3/3) ... [2025-04-13 21:22:28,679 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2025-04-13 21:22:28,690 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:22:28,691 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 21:22:28,692 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:22:28,771 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:22:28,795 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 32 transitions, 78 flow [2025-04-13 21:22:28,822 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 171 states, 167 states have (on average 2.6526946107784433) internal successors, (443), 170 states have internal predecessors, (443), 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 21:22:28,841 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:22:28,851 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@553fbc5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:22:28,851 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 21:22:28,853 INFO L278 IsEmpty]: Start isEmpty. Operand has 171 states, 167 states have (on average 2.6526946107784433) internal successors, (443), 170 states have internal predecessors, (443), 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 21:22:28,857 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2025-04-13 21:22:28,857 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:22:28,857 INFO L218 NwaCegarLoop]: trace histogram [1] [2025-04-13 21:22:28,857 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 21:22:28,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:22:28,861 INFO L85 PathProgramCache]: Analyzing trace with hash 3789, now seen corresponding path program 1 times [2025-04-13 21:22:28,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:22:28,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198039277] [2025-04-13 21:22:28,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:22:28,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:22:28,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-13 21:22:28,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-13 21:22:28,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:22:28,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:22:28,945 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 21:22:28,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:22:28,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198039277] [2025-04-13 21:22:28,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198039277] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:22:28,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:22:28,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2025-04-13 21:22:28,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830237521] [2025-04-13 21:22:28,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:22:28,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:22:28,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:22:28,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:22:28,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:22:28,966 INFO L87 Difference]: Start difference. First operand has 171 states, 167 states have (on average 2.6526946107784433) internal successors, (443), 170 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 21:22:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:22:29,326 INFO L93 Difference]: Finished difference Result 199 states and 485 transitions. [2025-04-13 21:22:29,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:22:29,328 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2025-04-13 21:22:29,328 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:22:29,334 INFO L225 Difference]: With dead ends: 199 [2025-04-13 21:22:29,334 INFO L226 Difference]: Without dead ends: 170 [2025-04-13 21:22:29,339 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:22:29,340 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:22:29,341 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:22:29,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-04-13 21:22:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-04-13 21:22:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 167 states have (on average 2.431137724550898) internal successors, (406), 169 states have internal predecessors, (406), 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 21:22:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 406 transitions. [2025-04-13 21:22:29,380 INFO L79 Accepts]: Start accepts. Automaton has 170 states and 406 transitions. Word has length 1 [2025-04-13 21:22:29,381 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:22:29,381 INFO L485 AbstractCegarLoop]: Abstraction has 170 states and 406 transitions. [2025-04-13 21:22:29,381 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 21:22:29,381 INFO L278 IsEmpty]: Start isEmpty. Operand 170 states and 406 transitions. [2025-04-13 21:22:29,381 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 21:22:29,381 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:22:29,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 21:22:29,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:22:29,382 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 21:22:29,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:22:29,382 INFO L85 PathProgramCache]: Analyzing trace with hash -677990440, now seen corresponding path program 1 times [2025-04-13 21:22:29,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:22:29,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970244952] [2025-04-13 21:22:29,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:22:29,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:22:29,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 21:22:29,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 21:22:29,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:22:29,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:22:31,011 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 21:22:31,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:22:31,011 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970244952] [2025-04-13 21:22:31,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970244952] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:22:31,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:22:31,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:22:31,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811132930] [2025-04-13 21:22:31,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:22:31,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:22:31,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:22:31,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:22:31,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:22:31,014 INFO L87 Difference]: Start difference. First operand 170 states and 406 transitions. Second operand has 3 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 21:22:31,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:22:31,453 INFO L93 Difference]: Finished difference Result 194 states and 464 transitions. [2025-04-13 21:22:31,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:22:31,455 INFO L79 Accepts]: Start accepts. Automaton has has 3 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) Word has length 5 [2025-04-13 21:22:31,456 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:22:31,457 INFO L225 Difference]: With dead ends: 194 [2025-04-13 21:22:31,457 INFO L226 Difference]: Without dead ends: 178 [2025-04-13 21:22:31,457 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:22:31,458 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:22:31,458 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 21:22:31,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-04-13 21:22:31,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-04-13 21:22:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 175 states have (on average 2.474285714285714) internal successors, (433), 177 states have internal predecessors, (433), 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 21:22:31,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 433 transitions. [2025-04-13 21:22:31,468 INFO L79 Accepts]: Start accepts. Automaton has 178 states and 433 transitions. Word has length 5 [2025-04-13 21:22:31,469 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:22:31,469 INFO L485 AbstractCegarLoop]: Abstraction has 178 states and 433 transitions. [2025-04-13 21:22:31,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 21:22:31,469 INFO L278 IsEmpty]: Start isEmpty. Operand 178 states and 433 transitions. [2025-04-13 21:22:31,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 21:22:31,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:22:31,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:22:31,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:22:31,469 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 21:22:31,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:22:31,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1270349180, now seen corresponding path program 1 times [2025-04-13 21:22:31,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:22:31,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923015964] [2025-04-13 21:22:31,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:22:31,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:22:31,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 21:22:31,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 21:22:31,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:22:31,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:22:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:22:31,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:22:31,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923015964] [2025-04-13 21:22:31,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923015964] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:22:31,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:22:31,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:22:31,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440089153] [2025-04-13 21:22:31,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:22:31,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:22:31,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:22:31,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:22:31,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:22:31,853 INFO L87 Difference]: Start difference. First operand 178 states and 433 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:22:32,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:22:32,088 INFO L93 Difference]: Finished difference Result 213 states and 511 transitions. [2025-04-13 21:22:32,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:22:32,089 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-13 21:22:32,089 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:22:32,090 INFO L225 Difference]: With dead ends: 213 [2025-04-13 21:22:32,090 INFO L226 Difference]: Without dead ends: 190 [2025-04-13 21:22:32,091 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:22:32,091 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:22:32,091 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:22:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-04-13 21:22:32,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-04-13 21:22:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 188 states have (on average 2.4202127659574466) internal successors, (455), 189 states have internal predecessors, (455), 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 21:22:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 455 transitions. [2025-04-13 21:22:32,102 INFO L79 Accepts]: Start accepts. Automaton has 190 states and 455 transitions. Word has length 7 [2025-04-13 21:22:32,102 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:22:32,102 INFO L485 AbstractCegarLoop]: Abstraction has 190 states and 455 transitions. [2025-04-13 21:22:32,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:22:32,102 INFO L278 IsEmpty]: Start isEmpty. Operand 190 states and 455 transitions. [2025-04-13 21:22:32,103 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 21:22:32,103 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:22:32,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:22:32,103 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:22:32,103 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 21:22:32,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:22:32,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2018861635, now seen corresponding path program 1 times [2025-04-13 21:22:32,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:22:32,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142614980] [2025-04-13 21:22:32,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:22:32,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:22:32,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:22:32,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:22:32,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:22:32,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:22:32,405 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 21:22:32,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:22:32,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142614980] [2025-04-13 21:22:32,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142614980] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:22:32,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:22:32,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:22:32,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399771498] [2025-04-13 21:22:32,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:22:32,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:22:32,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:22:32,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:22:32,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:22:32,407 INFO L87 Difference]: Start difference. First operand 190 states and 455 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 21:22:32,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:22:32,942 INFO L93 Difference]: Finished difference Result 269 states and 648 transitions. [2025-04-13 21:22:32,942 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:22:32,942 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-13 21:22:32,942 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:22:32,943 INFO L225 Difference]: With dead ends: 269 [2025-04-13 21:22:32,943 INFO L226 Difference]: Without dead ends: 160 [2025-04-13 21:22:32,944 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:22:32,944 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:22:32,944 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 21:22:32,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-04-13 21:22:32,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 148. [2025-04-13 21:22:32,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 144 states have (on average 2.2569444444444446) internal successors, (325), 147 states have internal predecessors, (325), 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 21:22:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 325 transitions. [2025-04-13 21:22:32,951 INFO L79 Accepts]: Start accepts. Automaton has 148 states and 325 transitions. Word has length 10 [2025-04-13 21:22:32,951 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:22:32,951 INFO L485 AbstractCegarLoop]: Abstraction has 148 states and 325 transitions. [2025-04-13 21:22:32,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 21:22:32,951 INFO L278 IsEmpty]: Start isEmpty. Operand 148 states and 325 transitions. [2025-04-13 21:22:32,955 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 21:22:32,955 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:22:32,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:22:32,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:22:32,956 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 21:22:32,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:22:32,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1839778705, now seen corresponding path program 1 times [2025-04-13 21:22:32,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:22:32,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037634563] [2025-04-13 21:22:32,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:22:32,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:22:32,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:22:33,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:22:33,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:22:33,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:22:34,382 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 21:22:34,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:22:34,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037634563] [2025-04-13 21:22:34,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037634563] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:22:34,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:22:34,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:22:34,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974430211] [2025-04-13 21:22:34,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:22:34,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:22:34,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:22:34,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:22:34,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:22:34,383 INFO L87 Difference]: Start difference. First operand 148 states and 325 transitions. Second operand has 4 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 21:22:34,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:22:34,805 INFO L93 Difference]: Finished difference Result 148 states and 325 transitions. [2025-04-13 21:22:34,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:22:34,805 INFO L79 Accepts]: Start accepts. Automaton has has 4 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) Word has length 11 [2025-04-13 21:22:34,805 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:22:34,806 INFO L225 Difference]: With dead ends: 148 [2025-04-13 21:22:34,806 INFO L226 Difference]: Without dead ends: 136 [2025-04-13 21:22:34,806 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:22:34,807 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 21:22:34,807 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 21:22:34,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-04-13 21:22:34,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2025-04-13 21:22:34,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 2.234375) internal successors, (286), 129 states have internal predecessors, (286), 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 21:22:34,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 286 transitions. [2025-04-13 21:22:34,811 INFO L79 Accepts]: Start accepts. Automaton has 130 states and 286 transitions. Word has length 11 [2025-04-13 21:22:34,811 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:22:34,811 INFO L485 AbstractCegarLoop]: Abstraction has 130 states and 286 transitions. [2025-04-13 21:22:34,811 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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 21:22:34,811 INFO L278 IsEmpty]: Start isEmpty. Operand 130 states and 286 transitions. [2025-04-13 21:22:34,811 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 21:22:34,811 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:22:34,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:22:34,811 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:22:34,811 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 21:22:34,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:22:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash -7582173, now seen corresponding path program 1 times [2025-04-13 21:22:34,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:22:34,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050862125] [2025-04-13 21:22:34,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:22:34,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:22:34,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:22:35,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:22:35,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:22:35,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:22:37,540 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 21:22:37,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:22:37,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050862125] [2025-04-13 21:22:37,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050862125] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:22:37,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:22:37,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:22:37,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159575139] [2025-04-13 21:22:37,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:22:37,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:22:37,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:22:37,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:22:37,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:22:37,541 INFO L87 Difference]: Start difference. First operand 130 states and 286 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 21:22:38,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:22:38,342 INFO L93 Difference]: Finished difference Result 177 states and 384 transitions. [2025-04-13 21:22:38,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:22:38,343 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 21:22:38,343 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:22:38,344 INFO L225 Difference]: With dead ends: 177 [2025-04-13 21:22:38,344 INFO L226 Difference]: Without dead ends: 170 [2025-04-13 21:22:38,344 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:22:38,345 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:22:38,345 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 21:22:38,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-04-13 21:22:38,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 160. [2025-04-13 21:22:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 158 states have (on average 2.2151898734177213) internal successors, (350), 159 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:22:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 350 transitions. [2025-04-13 21:22:38,349 INFO L79 Accepts]: Start accepts. Automaton has 160 states and 350 transitions. Word has length 15 [2025-04-13 21:22:38,350 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:22:38,350 INFO L485 AbstractCegarLoop]: Abstraction has 160 states and 350 transitions. [2025-04-13 21:22:38,350 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 21:22:38,350 INFO L278 IsEmpty]: Start isEmpty. Operand 160 states and 350 transitions. [2025-04-13 21:22:38,350 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 21:22:38,350 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:22:38,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:22:38,350 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:22:38,351 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 21:22:38,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:22:38,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1753162933, now seen corresponding path program 2 times [2025-04-13 21:22:38,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:22:38,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447756822] [2025-04-13 21:22:38,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:22:38,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:22:38,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:22:38,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:22:38,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:22:38,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:22:41,591 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 21:22:41,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:22:41,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447756822] [2025-04-13 21:22:41,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447756822] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:22:41,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:22:41,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:22:41,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561477750] [2025-04-13 21:22:41,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:22:41,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:22:41,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:22:41,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:22:41,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:22:41,593 INFO L87 Difference]: Start difference. First operand 160 states and 350 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 21:22:42,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:22:42,091 INFO L93 Difference]: Finished difference Result 266 states and 591 transitions. [2025-04-13 21:22:42,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:22:42,091 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 21:22:42,091 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:22:42,093 INFO L225 Difference]: With dead ends: 266 [2025-04-13 21:22:42,093 INFO L226 Difference]: Without dead ends: 259 [2025-04-13 21:22:42,093 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:22:42,093 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:22:42,093 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 21:22:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-04-13 21:22:42,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 181. [2025-04-13 21:22:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 2.217877094972067) internal successors, (397), 180 states have internal predecessors, (397), 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 21:22:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 397 transitions. [2025-04-13 21:22:42,105 INFO L79 Accepts]: Start accepts. Automaton has 181 states and 397 transitions. Word has length 15 [2025-04-13 21:22:42,105 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:22:42,105 INFO L485 AbstractCegarLoop]: Abstraction has 181 states and 397 transitions. [2025-04-13 21:22:42,105 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 21:22:42,105 INFO L278 IsEmpty]: Start isEmpty. Operand 181 states and 397 transitions. [2025-04-13 21:22:42,106 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 21:22:42,106 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:22:42,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:22:42,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 21:22:42,106 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 21:22:42,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:22:42,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1756824343, now seen corresponding path program 3 times [2025-04-13 21:22:42,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:22:42,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454063132] [2025-04-13 21:22:42,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:22:42,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:22:42,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:22:42,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:22:42,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:22:42,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:22:44,586 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 21:22:44,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:22:44,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454063132] [2025-04-13 21:22:44,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454063132] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:22:44,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:22:44,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:22:44,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071619328] [2025-04-13 21:22:44,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:22:44,587 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:22:44,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:22:44,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:22:44,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:22:44,587 INFO L87 Difference]: Start difference. First operand 181 states and 397 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 21:22:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:22:45,325 INFO L93 Difference]: Finished difference Result 232 states and 501 transitions. [2025-04-13 21:22:45,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:22:45,326 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 21:22:45,326 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:22:45,327 INFO L225 Difference]: With dead ends: 232 [2025-04-13 21:22:45,327 INFO L226 Difference]: Without dead ends: 225 [2025-04-13 21:22:45,327 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:22:45,328 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 21:22:45,328 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 21:22:45,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-04-13 21:22:45,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 181. [2025-04-13 21:22:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 2.217877094972067) internal successors, (397), 180 states have internal predecessors, (397), 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 21:22:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 397 transitions. [2025-04-13 21:22:45,332 INFO L79 Accepts]: Start accepts. Automaton has 181 states and 397 transitions. Word has length 15 [2025-04-13 21:22:45,332 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:22:45,332 INFO L485 AbstractCegarLoop]: Abstraction has 181 states and 397 transitions. [2025-04-13 21:22:45,332 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 21:22:45,332 INFO L278 IsEmpty]: Start isEmpty. Operand 181 states and 397 transitions. [2025-04-13 21:22:45,333 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 21:22:45,333 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:22:45,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:22:45,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:22:45,333 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 21:22:45,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:22:45,333 INFO L85 PathProgramCache]: Analyzing trace with hash -682460389, now seen corresponding path program 4 times [2025-04-13 21:22:45,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:22:45,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271287069] [2025-04-13 21:22:45,333 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:22:45,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:22:45,366 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:22:45,673 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:22:45,673 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:22:45,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:22:47,825 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 21:22:47,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:22:47,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271287069] [2025-04-13 21:22:47,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271287069] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:22:47,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:22:47,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:22:47,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106516556] [2025-04-13 21:22:47,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:22:47,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:22:47,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:22:47,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:22:47,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:22:47,827 INFO L87 Difference]: Start difference. First operand 181 states and 397 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 21:22:48,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:22:48,467 INFO L93 Difference]: Finished difference Result 232 states and 501 transitions. [2025-04-13 21:22:48,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:22:48,467 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 21:22:48,467 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:22:48,468 INFO L225 Difference]: With dead ends: 232 [2025-04-13 21:22:48,468 INFO L226 Difference]: Without dead ends: 225 [2025-04-13 21:22:48,469 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:22:48,469 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:22:48,469 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:22:48,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-04-13 21:22:48,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 181. [2025-04-13 21:22:48,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 2.217877094972067) internal successors, (397), 180 states have internal predecessors, (397), 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 21:22:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 397 transitions. [2025-04-13 21:22:48,473 INFO L79 Accepts]: Start accepts. Automaton has 181 states and 397 transitions. Word has length 15 [2025-04-13 21:22:48,473 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:22:48,473 INFO L485 AbstractCegarLoop]: Abstraction has 181 states and 397 transitions. [2025-04-13 21:22:48,474 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 21:22:48,474 INFO L278 IsEmpty]: Start isEmpty. Operand 181 states and 397 transitions. [2025-04-13 21:22:48,474 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:22:48,474 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:22:48,474 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:22:48,474 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 21:22:48,474 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 21:22:48,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:22:48,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1066972602, now seen corresponding path program 1 times [2025-04-13 21:22:48,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:22:48,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591725395] [2025-04-13 21:22:48,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:22:48,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:22:48,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:22:48,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:22:48,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:22:48,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:22:48,841 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:22:48,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:22:49,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:22:49,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:22:49,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:22:49,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:22:49,165 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:22:49,166 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 21:22:49,167 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 21:22:49,167 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 21:22:49,167 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 21:22:49,167 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 21:22:49,167 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 21:22:49,167 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 21:22:49,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 21:22:49,169 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2025-04-13 21:22:49,265 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:22:49,265 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:22:49,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:22:49 BasicIcfg [2025-04-13 21:22:49,267 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:22:49,268 INFO L158 Benchmark]: Toolchain (without parser) took 60829.92ms. Allocated memory was 142.6MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 98.4MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. [2025-04-13 21:22:49,268 INFO L158 Benchmark]: CDTParser took 1.34ms. Allocated memory is still 159.4MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:22:49,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 588.95ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 48.7MB in the end (delta: 49.6MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2025-04-13 21:22:49,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 127.54ms. Allocated memory is still 142.6MB. Free memory was 48.7MB in the beginning and 32.5MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 21:22:49,268 INFO L158 Benchmark]: Boogie Preprocessor took 175.68ms. Allocated memory is still 142.6MB. Free memory was 32.5MB in the beginning and 84.5MB in the end (delta: -52.1MB). Peak memory consumption was 23.0MB. Max. memory is 8.0GB. [2025-04-13 21:22:49,268 INFO L158 Benchmark]: IcfgBuilder took 39340.07ms. Allocated memory was 142.6MB in the beginning and 7.0GB in the end (delta: 6.9GB). Free memory was 83.9MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2025-04-13 21:22:49,268 INFO L158 Benchmark]: TraceAbstraction took 20592.91ms. Allocated memory was 7.0GB in the beginning and 7.2GB in the end (delta: 213.9MB). Free memory was 5.4GB in the beginning and 2.9GB in the end (delta: 2.6GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2025-04-13 21:22:49,269 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34ms. Allocated memory is still 159.4MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 588.95ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 48.7MB in the end (delta: 49.6MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 127.54ms. Allocated memory is still 142.6MB. Free memory was 48.7MB in the beginning and 32.5MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 175.68ms. Allocated memory is still 142.6MB. Free memory was 32.5MB in the beginning and 84.5MB in the end (delta: -52.1MB). Peak memory consumption was 23.0MB. Max. memory is 8.0GB. * IcfgBuilder took 39340.07ms. Allocated memory was 142.6MB in the beginning and 7.0GB in the end (delta: 6.9GB). Free memory was 83.9MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. * TraceAbstraction took 20592.91ms. Allocated memory was 7.0GB in the beginning and 7.2GB in the end (delta: 213.9MB). Free memory was 5.4GB in the beginning and 2.9GB in the end (delta: 2.6GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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=6, 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=6, id2=7, 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}] [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}] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [dequeue_flag=0, enqueue_flag=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}] [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] [L1037] 2 i++ [L1037] COND TRUE 2 i<(800) VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; [L995] EXPR 2 q->head [L995] EXPR 2 q->element[q->head] [L995] 2 x = q->element[q->head] [L996] EXPR 2 q->amount [L996] 2 q->amount-- [L996] 2 q->amount-- [L997] EXPR 2 q->head [L997] COND FALSE 2 !(q->head == (800)) [L1002] EXPR 2 q->head [L1002] 2 q->head++ [L1002] 2 q->head++ [L1003] 2 return x; [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1043] 2 reach_error() VAL [\at(arg, Pre)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] - UnprovableResult [Line: 1059]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 48 locations, 57 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 835 IncrementalHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 0 mSDtfsCounter, 835 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=3, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 194 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 2375 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 21:22:49,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...